java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:40:26,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:40:26,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:40:26,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:40:26,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:40:26,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:40:26,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:40:26,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:40:26,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:40:26,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:40:26,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:40:26,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:40:26,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:40:26,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:40:26,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:40:26,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:40:26,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:40:26,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:40:26,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:40:26,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:40:26,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:40:26,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:40:26,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:40:26,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:40:26,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:40:26,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:40:26,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:40:26,226 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:40:26,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:40:26,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:40:26,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:40:26,227 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:40:26,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:40:26,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:40:26,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:40:26,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:40:26,236 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:40:26,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:40:26,236 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:40:26,237 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:40:26,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:40:26,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:40:26,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:40:26,239 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:40:26,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:40:26,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:40:26,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:40:26,271 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:40:26,273 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:40:26,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:40:26,275 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:40:26,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-02-03 23:40:26,400 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:40:26,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:40:26,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:40:26,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:40:26,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:40:26,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa21b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26, skipping insertion in model container [2018-02-03 23:40:26,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,417 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:40:26,443 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:40:26,527 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:40:26,543 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:40:26,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26 WrapperNode [2018-02-03 23:40:26,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:40:26,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:40:26,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:40:26,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:40:26,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... [2018-02-03 23:40:26,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:40:26,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:40:26,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:40:26,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:40:26,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:40:26,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:40:26,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:40:26,613 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:40:26,613 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:40:26,613 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:40:26,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:40:26,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:40:26,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:40:26,792 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:40:26,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:40:26 BoogieIcfgContainer [2018-02-03 23:40:26,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:40:26,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:40:26,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:40:26,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:40:26,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:40:26" (1/3) ... [2018-02-03 23:40:26,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b487eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:40:26, skipping insertion in model container [2018-02-03 23:40:26,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:40:26" (2/3) ... [2018-02-03 23:40:26,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b487eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:40:26, skipping insertion in model container [2018-02-03 23:40:26,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:40:26" (3/3) ... [2018-02-03 23:40:26,799 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-02-03 23:40:26,804 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:40:26,809 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-03 23:40:26,837 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:40:26,837 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:40:26,838 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:40:26,838 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:40:26,838 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:40:26,838 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:40:26,838 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:40:26,838 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:40:26,839 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:40:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-03 23:40:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-03 23:40:26,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:26,858 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:26,858 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487999, now seen corresponding path program 1 times [2018-02-03 23:40:26,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:26,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:26,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:26,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:26,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:26,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:40:27,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:40:27,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:40:27,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:40:27,023 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-02-03 23:40:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,221 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-03 23:40:27,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:40:27,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-03 23:40:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,228 INFO L225 Difference]: With dead ends: 82 [2018-02-03 23:40:27,228 INFO L226 Difference]: Without dead ends: 78 [2018-02-03 23:40:27,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-03 23:40:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-03 23:40:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 23:40:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-03 23:40:27,250 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-02-03 23:40:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,250 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-03 23:40:27,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:40:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-03 23:40:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-03 23:40:27,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,251 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,251 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487998, now seen corresponding path program 1 times [2018-02-03 23:40:27,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:40:27,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:40:27,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:40:27,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:40:27,313 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-02-03 23:40:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,387 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-03 23:40:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:40:27,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-02-03 23:40:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,388 INFO L225 Difference]: With dead ends: 104 [2018-02-03 23:40:27,388 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 23:40:27,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 23:40:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 54. [2018-02-03 23:40:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 23:40:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-03 23:40:27,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2018-02-03 23:40:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,394 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-03 23:40:27,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:40:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-03 23:40:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 23:40:27,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 689004913, now seen corresponding path program 1 times [2018-02-03 23:40:27,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:40:27,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:40:27,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:40:27,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:40:27,443 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-03 23:40:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,528 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-03 23:40:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:40:27,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-03 23:40:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,530 INFO L225 Difference]: With dead ends: 64 [2018-02-03 23:40:27,530 INFO L226 Difference]: Without dead ends: 64 [2018-02-03 23:40:27,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-03 23:40:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-03 23:40:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 23:40:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-02-03 23:40:27,534 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2018-02-03 23:40:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,535 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-02-03 23:40:27,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:40:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-02-03 23:40:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 23:40:27,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,535 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,535 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash 689004914, now seen corresponding path program 1 times [2018-02-03 23:40:27,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:40:27,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:40:27,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:40:27,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:27,611 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2018-02-03 23:40:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,711 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-02-03 23:40:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:40:27,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 23:40:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,712 INFO L225 Difference]: With dead ends: 139 [2018-02-03 23:40:27,712 INFO L226 Difference]: Without dead ends: 139 [2018-02-03 23:40:27,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:40:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-03 23:40:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-02-03 23:40:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-03 23:40:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-02-03 23:40:27,716 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2018-02-03 23:40:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,716 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-02-03 23:40:27,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:40:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-02-03 23:40:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 23:40:27,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,716 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,716 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 689036531, now seen corresponding path program 1 times [2018-02-03 23:40:27,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:40:27,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:40:27,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:40:27,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:40:27,743 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 4 states. [2018-02-03 23:40:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,793 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-03 23:40:27,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:40:27,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-03 23:40:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,795 INFO L225 Difference]: With dead ends: 92 [2018-02-03 23:40:27,795 INFO L226 Difference]: Without dead ends: 92 [2018-02-03 23:40:27,796 INFO L554 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-02-03 23:40:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-03 23:40:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2018-02-03 23:40:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 23:40:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-02-03 23:40:27,800 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2018-02-03 23:40:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,800 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-02-03 23:40:27,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:40:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-02-03 23:40:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 23:40:27,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,801 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 689036532, now seen corresponding path program 1 times [2018-02-03 23:40:27,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:40:27,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:40:27,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:40:27,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:40:27,858 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 4 states. [2018-02-03 23:40:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:27,925 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-02-03 23:40:27,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:40:27,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-03 23:40:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:27,926 INFO L225 Difference]: With dead ends: 110 [2018-02-03 23:40:27,926 INFO L226 Difference]: Without dead ends: 110 [2018-02-03 23:40:27,926 INFO L554 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-02-03 23:40:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-03 23:40:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-02-03 23:40:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-03 23:40:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-02-03 23:40:27,932 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 18 [2018-02-03 23:40:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:27,932 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-02-03 23:40:27,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:40:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-02-03 23:40:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:40:27,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:27,933 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:27,933 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -115685232, now seen corresponding path program 1 times [2018-02-03 23:40:27,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:27,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:27,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,934 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:27,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:27,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:27,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:27,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:40:27,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:40:27,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:40:27,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:27,963 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-02-03 23:40:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:28,036 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-02-03 23:40:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:40:28,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-03 23:40:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:28,038 INFO L225 Difference]: With dead ends: 87 [2018-02-03 23:40:28,039 INFO L226 Difference]: Without dead ends: 87 [2018-02-03 23:40:28,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:40:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-03 23:40:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-02-03 23:40:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-03 23:40:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-02-03 23:40:28,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 19 [2018-02-03 23:40:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:28,045 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-02-03 23:40:28,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:40:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-02-03 23:40:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:40:28,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:28,046 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:28,047 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 580005852, now seen corresponding path program 1 times [2018-02-03 23:40:28,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:28,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:28,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:28,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:28,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:28,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:28,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:40:28,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:40:28,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:40:28,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:40:28,177 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 7 states. [2018-02-03 23:40:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:28,306 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-03 23:40:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:40:28,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-03 23:40:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:28,308 INFO L225 Difference]: With dead ends: 77 [2018-02-03 23:40:28,308 INFO L226 Difference]: Without dead ends: 77 [2018-02-03 23:40:28,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:40:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-03 23:40:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-03 23:40:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-03 23:40:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-02-03 23:40:28,312 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 23 [2018-02-03 23:40:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:28,312 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-02-03 23:40:28,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:40:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-02-03 23:40:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:40:28,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:28,313 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:28,313 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -493029770, now seen corresponding path program 1 times [2018-02-03 23:40:28,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:28,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:28,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:28,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:28,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:28,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:28,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:40:28,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:40:28,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:40:28,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:28,381 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-02-03 23:40:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:28,432 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-03 23:40:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:40:28,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-03 23:40:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:28,433 INFO L225 Difference]: With dead ends: 107 [2018-02-03 23:40:28,433 INFO L226 Difference]: Without dead ends: 107 [2018-02-03 23:40:28,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:40:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-03 23:40:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2018-02-03 23:40:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-03 23:40:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-03 23:40:28,435 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 23 [2018-02-03 23:40:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:28,435 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-03 23:40:28,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:40:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-03 23:40:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 23:40:28,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:28,436 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:28,436 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash -951533272, now seen corresponding path program 1 times [2018-02-03 23:40:28,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:28,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:28,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,437 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:28,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:28,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:28,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:28,516 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:28,522 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:28,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:28,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:28,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:28,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 8 treesize of output 7 [2018-02-03 23:40:28,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-02-03 23:40:28,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:40:28,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:28,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:40:28,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-03 23:40:28,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:28,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:40:28,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-02-03 23:40:28,689 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 26 treesize of output 19 [2018-02-03 23:40:28,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:28,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-02-03 23:40:28,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,706 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 26 treesize of output 19 [2018-02-03 23:40:28,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-03 23:40:28,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:28,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-02-03 23:40:28,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-03 23:40:28,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-03 23:40:28,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-03 23:40:28,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:40:28,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 29 treesize of output 21 [2018-02-03 23:40:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:28,833 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-03 23:40:28,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-03 23:40:28,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:40:28,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-03 23:40:28,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:136 [2018-02-03 23:40:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:28,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:28,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 15 [2018-02-03 23:40:28,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:40:28,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:40:28,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:40:28,927 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 15 states. [2018-02-03 23:40:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:29,370 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-03 23:40:29,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 23:40:29,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-03 23:40:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:29,371 INFO L225 Difference]: With dead ends: 76 [2018-02-03 23:40:29,371 INFO L226 Difference]: Without dead ends: 76 [2018-02-03 23:40:29,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:40:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-03 23:40:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-02-03 23:40:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 23:40:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-02-03 23:40:29,376 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 25 [2018-02-03 23:40:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:29,376 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-02-03 23:40:29,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:40:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-02-03 23:40:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:40:29,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:29,377 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:29,378 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash 567238585, now seen corresponding path program 1 times [2018-02-03 23:40:29,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:29,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:29,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:29,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:29,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:29,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:29,445 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:29,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:29,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:29,521 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-02-03 23:40:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-03 23:40:29,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:29,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-02-03 23:40:29,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:40:29,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:40:29,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-02-03 23:40:29,572 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 10 states. [2018-02-03 23:40:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:29,705 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-03 23:40:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:40:29,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-03 23:40:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:29,706 INFO L225 Difference]: With dead ends: 72 [2018-02-03 23:40:29,706 INFO L226 Difference]: Without dead ends: 61 [2018-02-03 23:40:29,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2018-02-03 23:40:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-03 23:40:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-03 23:40:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-03 23:40:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-02-03 23:40:29,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 26 [2018-02-03 23:40:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:29,709 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-02-03 23:40:29,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:40:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-02-03 23:40:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 23:40:29,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:29,710 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:29,710 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1660969695, now seen corresponding path program 1 times [2018-02-03 23:40:29,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:29,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:29,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:29,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:29,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:29,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:29,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:40:29,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:40:29,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:40:29,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:29,769 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-02-03 23:40:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:29,870 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-03 23:40:29,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:40:29,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-03 23:40:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:29,870 INFO L225 Difference]: With dead ends: 119 [2018-02-03 23:40:29,871 INFO L226 Difference]: Without dead ends: 119 [2018-02-03 23:40:29,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:40:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-03 23:40:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2018-02-03 23:40:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-03 23:40:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-02-03 23:40:29,874 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 29 [2018-02-03 23:40:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:29,874 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-02-03 23:40:29,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:40:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-02-03 23:40:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:40:29,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:29,875 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:29,875 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1477377571, now seen corresponding path program 1 times [2018-02-03 23:40:29,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:29,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:29,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:29,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:29,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:29,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:29,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:40:29,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:40:29,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:40:29,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:40:29,946 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 6 states. [2018-02-03 23:40:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:30,011 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-02-03 23:40:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:40:30,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-03 23:40:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:30,012 INFO L225 Difference]: With dead ends: 101 [2018-02-03 23:40:30,012 INFO L226 Difference]: Without dead ends: 101 [2018-02-03 23:40:30,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:40:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-03 23:40:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2018-02-03 23:40:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 23:40:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-02-03 23:40:30,015 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2018-02-03 23:40:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:30,015 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-02-03 23:40:30,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:40:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-02-03 23:40:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:40:30,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:30,016 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:30,016 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 49545921, now seen corresponding path program 1 times [2018-02-03 23:40:30,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:30,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:30,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,017 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:30,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:30,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:30,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:30,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:40:30,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:40:30,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:40:30,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:40:30,057 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2018-02-03 23:40:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:30,107 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-03 23:40:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:40:30,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-03 23:40:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:30,108 INFO L225 Difference]: With dead ends: 79 [2018-02-03 23:40:30,108 INFO L226 Difference]: Without dead ends: 79 [2018-02-03 23:40:30,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:40:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-03 23:40:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2018-02-03 23:40:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 23:40:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-03 23:40:30,109 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 30 [2018-02-03 23:40:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:30,109 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-03 23:40:30,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:40:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-03 23:40:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:40:30,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:30,110 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:30,110 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -873404019, now seen corresponding path program 1 times [2018-02-03 23:40:30,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:30,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:30,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:30,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:30,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:30,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:30,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:40:30,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:40:30,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:40:30,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:40:30,248 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 8 states. [2018-02-03 23:40:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:30,433 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-03 23:40:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:40:30,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-03 23:40:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:30,434 INFO L225 Difference]: With dead ends: 89 [2018-02-03 23:40:30,434 INFO L226 Difference]: Without dead ends: 89 [2018-02-03 23:40:30,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:40:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-03 23:40:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2018-02-03 23:40:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 23:40:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-02-03 23:40:30,436 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 34 [2018-02-03 23:40:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:30,437 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-02-03 23:40:30,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:40:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-02-03 23:40:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 23:40:30,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:30,438 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:30,438 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 733993419, now seen corresponding path program 1 times [2018-02-03 23:40:30,438 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:30,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:30,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,439 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:30,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:30,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:30,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:30,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:40:30,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:40:30,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:40:30,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:40:30,536 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2018-02-03 23:40:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:30,701 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-02-03 23:40:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:40:30,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-03 23:40:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:30,702 INFO L225 Difference]: With dead ends: 105 [2018-02-03 23:40:30,702 INFO L226 Difference]: Without dead ends: 105 [2018-02-03 23:40:30,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:40:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-03 23:40:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2018-02-03 23:40:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 23:40:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-03 23:40:30,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 35 [2018-02-03 23:40:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:30,705 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-03 23:40:30,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:40:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-03 23:40:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 23:40:30,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:30,706 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:30,706 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 733993420, now seen corresponding path program 1 times [2018-02-03 23:40:30,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:30,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:30,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,708 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:30,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:30,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:30,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:30,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:40:30,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:40:30,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:40:30,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:40:30,819 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 9 states. [2018-02-03 23:40:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:31,084 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-03 23:40:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 23:40:31,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-03 23:40:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:31,085 INFO L225 Difference]: With dead ends: 93 [2018-02-03 23:40:31,085 INFO L226 Difference]: Without dead ends: 93 [2018-02-03 23:40:31,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-02-03 23:40:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-03 23:40:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-02-03 23:40:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 23:40:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-03 23:40:31,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 35 [2018-02-03 23:40:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:31,088 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-03 23:40:31,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:40:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-03 23:40:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:40:31,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:31,088 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 23:40:31,088 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:31,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048103, now seen corresponding path program 1 times [2018-02-03 23:40:31,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:31,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:31,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:31,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:31,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:31,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:31,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:31,227 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:31,232 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:31,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:31,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:31,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:31,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:31,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-03 23:40:31,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:31,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:31,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-03 23:40:31,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-03 23:40:31,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:40:31,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:31,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-03 23:40:31,380 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 42 treesize of output 36 [2018-02-03 23:40:31,385 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 33 treesize of output 38 [2018-02-03 23:40:31,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:31,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-02-03 23:40:31,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-02-03 23:40:31,496 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 2 case distinctions, treesize of input 24 treesize of output 26 [2018-02-03 23:40:31,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:31,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:40:31,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:31,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:31,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:73 [2018-02-03 23:40:31,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:31,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:40:31,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:31,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:31,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-03 23:40:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:31,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:31,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2018-02-03 23:40:31,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:40:31,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:40:31,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-03 23:40:31,658 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 22 states. [2018-02-03 23:40:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:32,810 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-03 23:40:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-03 23:40:32,811 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-02-03 23:40:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:32,811 INFO L225 Difference]: With dead ends: 110 [2018-02-03 23:40:32,811 INFO L226 Difference]: Without dead ends: 110 [2018-02-03 23:40:32,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=399, Invalid=1763, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 23:40:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-03 23:40:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2018-02-03 23:40:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-03 23:40:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-03 23:40:32,813 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 36 [2018-02-03 23:40:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:32,813 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-03 23:40:32,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:40:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-03 23:40:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:40:32,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:32,814 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 23:40:32,814 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1814048102, now seen corresponding path program 1 times [2018-02-03 23:40:32,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:32,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:32,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:32,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:32,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:32,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:32,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:32,970 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:32,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:32,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:33,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:33,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-03 23:40:33,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:33,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:33,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:33,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:33,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 23:40:33,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-03 23:40:33,118 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-02-03 23:40:33,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-03 23:40:33,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 23:40:33,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-02-03 23:40:33,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-02-03 23:40:33,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-02-03 23:40:33,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,200 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 30 treesize of output 33 [2018-02-03 23:40:33,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:40:33,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-03 23:40:33,344 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 54 treesize of output 43 [2018-02-03 23:40:33,355 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 2 case distinctions, treesize of input 33 treesize of output 33 [2018-02-03 23:40:33,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:33,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:40:33,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:33,417 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 46 treesize of output 38 [2018-02-03 23:40:33,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-02-03 23:40:33,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:33,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-02-03 23:40:33,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,467 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:40:33,468 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:33,476 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:33,478 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 45 treesize of output 37 [2018-02-03 23:40:33,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:33,495 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:40:33,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:33,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:33,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-02-03 23:40:33,542 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:81, output treesize:108 [2018-02-03 23:40:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:33,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:33,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2018-02-03 23:40:33,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 23:40:33,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 23:40:33,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:40:33,644 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 27 states. [2018-02-03 23:40:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:36,972 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-02-03 23:40:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-03 23:40:36,972 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-03 23:40:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:36,973 INFO L225 Difference]: With dead ends: 272 [2018-02-03 23:40:36,973 INFO L226 Difference]: Without dead ends: 272 [2018-02-03 23:40:36,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1358, Invalid=7384, Unknown=0, NotChecked=0, Total=8742 [2018-02-03 23:40:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-03 23:40:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 133. [2018-02-03 23:40:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-03 23:40:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2018-02-03 23:40:36,976 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 36 [2018-02-03 23:40:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:36,976 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2018-02-03 23:40:36,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 23:40:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2018-02-03 23:40:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:40:36,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:36,977 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:36,977 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 993040720, now seen corresponding path program 1 times [2018-02-03 23:40:36,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:36,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:36,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:36,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:36,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:36,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:37,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:37,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:40:37,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:40:37,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:40:37,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:40:37,095 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand 11 states. [2018-02-03 23:40:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:37,350 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2018-02-03 23:40:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 23:40:37,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-03 23:40:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:37,351 INFO L225 Difference]: With dead ends: 147 [2018-02-03 23:40:37,351 INFO L226 Difference]: Without dead ends: 147 [2018-02-03 23:40:37,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:40:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-03 23:40:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-02-03 23:40:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-03 23:40:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2018-02-03 23:40:37,354 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 37 [2018-02-03 23:40:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:37,354 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2018-02-03 23:40:37,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:40:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2018-02-03 23:40:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:40:37,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:37,355 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:37,355 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -400917400, now seen corresponding path program 1 times [2018-02-03 23:40:37,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:37,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:37,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:37,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:37,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:37,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:37,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:37,478 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:37,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:37,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:37,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:37,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:37,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-03 23:40:37,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:37,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:37,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-03 23:40:37,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-03 23:40:37,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:40:37,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:37,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-03 23:40:37,600 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 41 treesize of output 35 [2018-02-03 23:40:37,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-02-03 23:40:37,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:37,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 23:40:37,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-02-03 23:40:37,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:40:37,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:37,697 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-02-03 23:40:37,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-02-03 23:40:37,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:40:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:40:37,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:26 [2018-02-03 23:40:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:37,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:37,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 22 [2018-02-03 23:40:37,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:40:37,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:40:37,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-03 23:40:37,764 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand 22 states. [2018-02-03 23:40:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:38,353 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2018-02-03 23:40:38,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-03 23:40:38,353 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-02-03 23:40:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:38,353 INFO L225 Difference]: With dead ends: 156 [2018-02-03 23:40:38,353 INFO L226 Difference]: Without dead ends: 156 [2018-02-03 23:40:38,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2018-02-03 23:40:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-03 23:40:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-02-03 23:40:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-03 23:40:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2018-02-03 23:40:38,357 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 37 [2018-02-03 23:40:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:38,357 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2018-02-03 23:40:38,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:40:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2018-02-03 23:40:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 23:40:38,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:38,358 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 23:40:38,358 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -58648115, now seen corresponding path program 1 times [2018-02-03 23:40:38,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:38,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:38,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:38,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:38,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:38,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:38,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:38,698 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:38,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:38,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:38,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:38,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:38,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:38,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-03 23:40:38,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:38,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:38,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-02-03 23:40:38,776 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-02-03 23:40:38,778 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 10 treesize of output 9 [2018-02-03 23:40:38,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:38,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2018-02-03 23:40:38,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:38,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:38,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-03 23:40:38,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:38,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2018-02-03 23:40:38,850 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 50 treesize of output 42 [2018-02-03 23:40:38,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-02-03 23:40:38,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:38,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:38,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:64 [2018-02-03 23:40:39,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 59 [2018-02-03 23:40:39,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,042 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2018-02-03 23:40:39,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:39,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:40:39,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:39,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:39,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:39,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:226 [2018-02-03 23:40:39,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-02-03 23:40:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:39,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-02-03 23:40:39,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:39,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2018-02-03 23:40:39,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-03 23:40:39,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-02-03 23:40:39,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:103, output treesize:122 [2018-02-03 23:40:39,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:39,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-03 23:40:39,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:39,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:39,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:24 [2018-02-03 23:40:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:39,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:39,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-02-03 23:40:39,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-03 23:40:39,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-03 23:40:39,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-02-03 23:40:39,474 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand 29 states. [2018-02-03 23:40:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:41,399 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-02-03 23:40:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-03 23:40:41,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-02-03 23:40:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:41,402 INFO L225 Difference]: With dead ends: 154 [2018-02-03 23:40:41,402 INFO L226 Difference]: Without dead ends: 154 [2018-02-03 23:40:41,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=708, Invalid=2832, Unknown=0, NotChecked=0, Total=3540 [2018-02-03 23:40:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-03 23:40:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2018-02-03 23:40:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-03 23:40:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2018-02-03 23:40:41,405 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 40 [2018-02-03 23:40:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:41,405 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2018-02-03 23:40:41,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-03 23:40:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2018-02-03 23:40:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:40:41,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:41,406 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:41,406 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1617180596, now seen corresponding path program 1 times [2018-02-03 23:40:41,406 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:41,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:41,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:41,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:41,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:41,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:41,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:41,808 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:41,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:41,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:41,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:40:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:40:41,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,854 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 15 treesize of output 12 [2018-02-03 23:40:41,855 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-02-03 23:40:41,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-02-03 23:40:41,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:41,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:41,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:41,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-02-03 23:40:41,919 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 25 treesize of output 26 [2018-02-03 23:40:41,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:41,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,941 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 25 treesize of output 30 [2018-02-03 23:40:41,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:41,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:41,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:55 [2018-02-03 23:40:41,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-02-03 23:40:41,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:41,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:41,996 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 28 treesize of output 61 [2018-02-03 23:40:41,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-02-03 23:40:42,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 57 [2018-02-03 23:40:42,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:89 [2018-02-03 23:40:42,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-02-03 23:40:42,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:40:42,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,093 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 90 treesize of output 89 [2018-02-03 23:40:42,095 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 92 treesize of output 106 [2018-02-03 23:40:42,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:100 [2018-02-03 23:40:42,431 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:42,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,433 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2018-02-03 23:40:42,435 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:42,442 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2018-02-03 23:40:42,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:42,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,459 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:42,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:42,460 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 44 treesize of output 39 [2018-02-03 23:40:42,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:42,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:42,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:138, output treesize:64 [2018-02-03 23:40:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:42,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:42,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 31 [2018-02-03 23:40:42,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 23:40:42,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 23:40:42,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=829, Unknown=5, NotChecked=0, Total=930 [2018-02-03 23:40:42,543 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 31 states. [2018-02-03 23:40:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:44,746 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-02-03 23:40:44,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-03 23:40:44,746 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-02-03 23:40:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:44,747 INFO L225 Difference]: With dead ends: 207 [2018-02-03 23:40:44,747 INFO L226 Difference]: Without dead ends: 207 [2018-02-03 23:40:44,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=745, Invalid=3802, Unknown=9, NotChecked=0, Total=4556 [2018-02-03 23:40:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-03 23:40:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2018-02-03 23:40:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-03 23:40:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2018-02-03 23:40:44,750 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 41 [2018-02-03 23:40:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:44,750 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2018-02-03 23:40:44,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 23:40:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2018-02-03 23:40:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 23:40:44,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:44,750 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:44,750 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:44,750 INFO L82 PathProgramCache]: Analyzing trace with hash -659016960, now seen corresponding path program 2 times [2018-02-03 23:40:44,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:44,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:44,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:44,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:44,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:44,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:45,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:45,004 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:45,011 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:40:45,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:40:45,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:40:45,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:45,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 11 treesize of output 8 [2018-02-03 23:40:45,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:45,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:45,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-03 23:40:45,055 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 26 treesize of output 21 [2018-02-03 23:40:45,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:40:45,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,070 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 26 treesize of output 21 [2018-02-03 23:40:45,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:40:45,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-02-03 23:40:45,114 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 32 treesize of output 25 [2018-02-03 23:40:45,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-02-03 23:40:45,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-03 23:40:45,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-03 23:40:45,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-03 23:40:45,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:40:45,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-02-03 23:40:45,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-03 23:40:45,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:45,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,288 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 33 treesize of output 34 [2018-02-03 23:40:45,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:45,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-02-03 23:40:45,332 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:45,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 60 treesize of output 48 [2018-02-03 23:40:45,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-02-03 23:40:45,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 76 [2018-02-03 23:40:45,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-02-03 23:40:45,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-02-03 23:40:45,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-02-03 23:40:45,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:40:45,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,422 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 90 treesize of output 79 [2018-02-03 23:40:45,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 98 [2018-02-03 23:40:45,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:45,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:104 [2018-02-03 23:40:45,722 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:45,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,725 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 112 treesize of output 86 [2018-02-03 23:40:45,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:45,759 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 73 [2018-02-03 23:40:45,759 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-03 23:40:45,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 88 dim-0 vars, End of recursive call: 88 dim-0 vars, and 96 xjuncts. [2018-02-03 23:40:46,159 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:46,160 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 61 treesize of output 48 [2018-02-03 23:40:46,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:46,162 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:46,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-02-03 23:40:46,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:46,165 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:46,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-02-03 23:40:46,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:46,169 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:40:46,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-02-03 23:40:46,170 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:46,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-03 23:40:46,264 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 47 [2018-02-03 23:40:46,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:46,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-03 23:40:46,269 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:46,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:46,275 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 55 treesize of output 43 [2018-02-03 23:40:46,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:46,281 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 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-03 23:40:46,281 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,291 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,293 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 58 treesize of output 46 [2018-02-03 23:40:46,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:46,314 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 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-03 23:40:46,314 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,325 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,329 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 58 treesize of output 46 [2018-02-03 23:40:46,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:46,335 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 1 case distinctions, treesize of input 21 treesize of output 17 [2018-02-03 23:40:46,335 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,346 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:46,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-03 23:40:46,386 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:120 [2018-02-03 23:40:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:46,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:46,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 32 [2018-02-03 23:40:46,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 23:40:46,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 23:40:46,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-02-03 23:40:46,498 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand 32 states. [2018-02-03 23:40:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:48,166 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2018-02-03 23:40:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 23:40:48,166 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2018-02-03 23:40:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:48,167 INFO L225 Difference]: With dead ends: 187 [2018-02-03 23:40:48,167 INFO L226 Difference]: Without dead ends: 187 [2018-02-03 23:40:48,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=407, Invalid=3374, Unknown=1, NotChecked=0, Total=3782 [2018-02-03 23:40:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-03 23:40:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-02-03 23:40:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-03 23:40:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2018-02-03 23:40:48,170 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 43 [2018-02-03 23:40:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:48,170 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2018-02-03 23:40:48,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 23:40:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2018-02-03 23:40:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 23:40:48,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:48,171 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-03 23:40:48,171 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1045309665, now seen corresponding path program 2 times [2018-02-03 23:40:48,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:48,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:48,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:48,171 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:40:48,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:48,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:48,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:48,512 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:48,517 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:40:48,534 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:40:48,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:40:48,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:48,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:48,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:48,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2018-02-03 23:40:48,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:48,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 60 [2018-02-03 23:40:48,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:40:48,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:48,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2018-02-03 23:40:48,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:48,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-02-03 23:40:48,723 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 54 treesize of output 63 [2018-02-03 23:40:48,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:48,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-02-03 23:40:48,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:48,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-02-03 23:40:48,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:40:48,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:48,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:48,845 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 2 case distinctions, treesize of input 39 treesize of output 43 [2018-02-03 23:40:48,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:48,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:48,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:40:48,892 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:112 [2018-02-03 23:40:49,185 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_117 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (not (= v_prenex_117 0)) (not (= main_~y~0.base 0)) (= |c_#valid| (store (store .cse0 v_prenex_117 0) main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0) (= (select .cse0 v_prenex_117) 0)))) is different from true [2018-02-03 23:40:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-03 23:40:49,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:49,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-02-03 23:40:49,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 23:40:49,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 23:40:49,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=841, Unknown=19, NotChecked=58, Total=992 [2018-02-03 23:40:49,227 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand 32 states. [2018-02-03 23:40:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:50,554 INFO L93 Difference]: Finished difference Result 186 states and 213 transitions. [2018-02-03 23:40:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 23:40:50,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-02-03 23:40:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:50,554 INFO L225 Difference]: With dead ends: 186 [2018-02-03 23:40:50,554 INFO L226 Difference]: Without dead ends: 168 [2018-02-03 23:40:50,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=1924, Unknown=19, NotChecked=90, Total=2256 [2018-02-03 23:40:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-03 23:40:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-02-03 23:40:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-03 23:40:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2018-02-03 23:40:50,557 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 44 [2018-02-03 23:40:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:50,557 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2018-02-03 23:40:50,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 23:40:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2018-02-03 23:40:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-03 23:40:50,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:50,558 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:50,558 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 731145119, now seen corresponding path program 1 times [2018-02-03 23:40:50,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:50,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:50,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:50,559 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:40:50,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:50,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:40:50,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:40:50,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:40:50,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:40:50,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:40:50,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:40:50,709 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand 10 states. [2018-02-03 23:40:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:50,920 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2018-02-03 23:40:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:40:50,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-02-03 23:40:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:50,921 INFO L225 Difference]: With dead ends: 180 [2018-02-03 23:40:50,922 INFO L226 Difference]: Without dead ends: 180 [2018-02-03 23:40:50,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-02-03 23:40:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-03 23:40:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-02-03 23:40:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-03 23:40:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 191 transitions. [2018-02-03 23:40:50,925 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 191 transitions. Word has length 45 [2018-02-03 23:40:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:50,925 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 191 transitions. [2018-02-03 23:40:50,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:40:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 191 transitions. [2018-02-03 23:40:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:40:50,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:50,926 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:40:50,926 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1902183403, now seen corresponding path program 1 times [2018-02-03 23:40:50,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:50,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:50,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:50,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:50,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:50,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:52,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:52,224 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:52,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:52,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:52,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:52,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:52,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:37 [2018-02-03 23:40:52,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,423 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 60 [2018-02-03 23:40:52,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:40:52,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:52,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2018-02-03 23:40:52,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-02-03 23:40:52,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 89 [2018-02-03 23:40:52,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:52,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:86 [2018-02-03 23:40:52,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 85 [2018-02-03 23:40:52,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:40:52,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:52,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:52,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 83 [2018-02-03 23:40:52,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:52,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:53,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-03 23:40:53,097 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:334 [2018-02-03 23:40:53,539 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse1 (store |c_old(#valid)| main_~y~0.base 1))) (let ((.cse0 (store .cse1 v_prenex_129 1))) (and (= 0 (select .cse0 v_prenex_130)) (not (= main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0) (= (store (store (store .cse0 v_prenex_130 0) v_prenex_129 0) main_~y~0.base 0) |c_#valid|) (not (= v_prenex_129 0)) (= (select .cse1 v_prenex_129) 0) (not (= v_prenex_130 0)))))) is different from true [2018-02-03 23:40:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-02-03 23:40:53,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:53,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-03 23:40:53,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 23:40:53,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 23:40:53,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1445, Unknown=23, NotChecked=76, Total=1640 [2018-02-03 23:40:53,578 INFO L87 Difference]: Start difference. First operand 167 states and 191 transitions. Second operand 41 states. [2018-02-03 23:40:55,356 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 157 DAG size of output 79 [2018-02-03 23:40:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:55,970 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-02-03 23:40:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:40:55,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2018-02-03 23:40:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:55,971 INFO L225 Difference]: With dead ends: 171 [2018-02-03 23:40:55,971 INFO L226 Difference]: Without dead ends: 150 [2018-02-03 23:40:55,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=299, Invalid=3338, Unknown=27, NotChecked=118, Total=3782 [2018-02-03 23:40:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-03 23:40:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-03 23:40:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-03 23:40:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2018-02-03 23:40:55,973 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 48 [2018-02-03 23:40:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:55,973 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2018-02-03 23:40:55,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 23:40:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2018-02-03 23:40:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:40:55,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:55,974 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-03 23:40:55,974 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:40:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2055869351, now seen corresponding path program 3 times [2018-02-03 23:40:55,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:55,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:55,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:55,975 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:55,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:55,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:56,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:56,097 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:40:56,125 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:40:56,180 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:40:56,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:40:56,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:56,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:40:56,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:40:56,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-03 23:40:56,222 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 39 [2018-02-03 23:40:56,224 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 31 treesize of output 30 [2018-02-03 23:40:56,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:56,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-02-03 23:40:56,272 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2018-02-03 23:40:56,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-02-03 23:40:56,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,294 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 29 treesize of output 40 [2018-02-03 23:40:56,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:56,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-03 23:40:56,375 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 48 treesize of output 44 [2018-02-03 23:40:56,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-02-03 23:40:56,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,400 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 1 case distinctions, treesize of input 36 treesize of output 31 [2018-02-03 23:40:56,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-02-03 23:40:56,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,438 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 1 case distinctions, treesize of input 48 treesize of output 44 [2018-02-03 23:40:56,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-02-03 23:40:56,440 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,453 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 26 treesize of output 19 [2018-02-03 23:40:56,454 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:56,470 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 1 case distinctions, treesize of input 36 treesize of output 31 [2018-02-03 23:40:56,470 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-03 23:40:56,479 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:56,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:40:56,487 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:97, output treesize:20 [2018-02-03 23:40:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:40:56,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:56,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-02-03 23:40:56,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 23:40:56,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 23:40:56,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:40:56,530 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand 20 states. [2018-02-03 23:41:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:01,337 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-02-03 23:41:01,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 23:41:01,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-02-03 23:41:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:01,338 INFO L225 Difference]: With dead ends: 196 [2018-02-03 23:41:01,338 INFO L226 Difference]: Without dead ends: 196 [2018-02-03 23:41:01,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2018-02-03 23:41:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-03 23:41:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2018-02-03 23:41:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-03 23:41:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-03 23:41:01,341 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 48 [2018-02-03 23:41:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:01,341 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-03 23:41:01,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 23:41:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-03 23:41:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 23:41:01,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:01,342 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:41:01,342 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash 692593450, now seen corresponding path program 1 times [2018-02-03 23:41:01,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:01,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:01,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:01,343 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:41:01,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:01,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:01,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:01,556 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:01,564 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:01,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:01,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:41:01,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:41:01,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:01,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 23:41:01,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:01,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:01,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-03 23:41:01,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:01,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:01,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:01,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:01,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-02-03 23:41:01,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-03 23:41:01,718 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-02-03 23:41:01,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-03 23:41:01,742 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-02-03 23:41:01,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-02-03 23:41:01,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-02-03 23:41:01,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-02-03 23:41:01,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,838 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 30 treesize of output 33 [2018-02-03 23:41:01,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:01,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:41:01,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:01,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-02-03 23:41:02,099 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 54 treesize of output 43 [2018-02-03 23:41:02,110 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 2 case distinctions, treesize of input 33 treesize of output 33 [2018-02-03 23:41:02,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:02,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:41:02,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:02,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:02,184 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 45 treesize of output 37 [2018-02-03 23:41:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:02,190 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:02,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:02,201 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:02,203 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 46 treesize of output 38 [2018-02-03 23:41:02,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:02,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-02-03 23:41:02,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:02,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:02,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-02-03 23:41:02,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:02,218 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:02,218 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:02,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:02,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-02-03 23:41:02,252 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:145 [2018-02-03 23:41:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:02,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:02,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2018-02-03 23:41:02,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 23:41:02,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 23:41:02,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-03 23:41:02,395 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 26 states. [2018-02-03 23:41:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:04,341 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2018-02-03 23:41:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-03 23:41:04,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-02-03 23:41:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:04,342 INFO L225 Difference]: With dead ends: 224 [2018-02-03 23:41:04,342 INFO L226 Difference]: Without dead ends: 224 [2018-02-03 23:41:04,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1004, Invalid=2902, Unknown=0, NotChecked=0, Total=3906 [2018-02-03 23:41:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-03 23:41:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2018-02-03 23:41:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-03 23:41:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-02-03 23:41:04,346 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 49 [2018-02-03 23:41:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:04,346 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-02-03 23:41:04,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 23:41:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-02-03 23:41:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-03 23:41:04,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:04,346 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:41:04,346 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -722803741, now seen corresponding path program 1 times [2018-02-03 23:41:04,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:04,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:04,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:04,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:04,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:04,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:04,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:04,605 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:04,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:04,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:04,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:41:04,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:41:04,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-03 23:41:04,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:04,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-02-03 23:41:04,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:04,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:04,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,692 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 26 [2018-02-03 23:41:04,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:04,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-02-03 23:41:04,726 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 56 [2018-02-03 23:41:04,727 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-02-03 23:41:04,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-03 23:41:04,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-02-03 23:41:04,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:58 [2018-02-03 23:41:04,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-02-03 23:41:04,774 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 44 treesize of output 51 [2018-02-03 23:41:04,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,789 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 59 [2018-02-03 23:41:04,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-02-03 23:41:04,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:61 [2018-02-03 23:41:04,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-02-03 23:41:04,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-03 23:41:04,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:04,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:04,887 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 2 case distinctions, treesize of input 31 treesize of output 37 [2018-02-03 23:41:04,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:04,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:04,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:04,924 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:81, output treesize:164 [2018-02-03 23:41:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-02-03 23:41:05,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:05,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:05,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:179, output treesize:53 [2018-02-03 23:41:05,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:05,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:05,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:05,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:48 [2018-02-03 23:41:05,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-02-03 23:41:05,214 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:05,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,231 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 45 [2018-02-03 23:41:05,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:05,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:05,240 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 1 [2018-02-03 23:41:05,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:05,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:05,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:05,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-02-03 23:41:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:05,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:05,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-02-03 23:41:05,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 23:41:05,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 23:41:05,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:41:05,272 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 31 states. [2018-02-03 23:41:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:07,528 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-02-03 23:41:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-03 23:41:07,528 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-02-03 23:41:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:07,529 INFO L225 Difference]: With dead ends: 227 [2018-02-03 23:41:07,529 INFO L226 Difference]: Without dead ends: 227 [2018-02-03 23:41:07,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=886, Invalid=4664, Unknown=0, NotChecked=0, Total=5550 [2018-02-03 23:41:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-03 23:41:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 179. [2018-02-03 23:41:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-03 23:41:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2018-02-03 23:41:07,532 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 53 [2018-02-03 23:41:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:07,532 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-02-03 23:41:07,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 23:41:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2018-02-03 23:41:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-03 23:41:07,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:07,533 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:41:07,533 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash -722803740, now seen corresponding path program 1 times [2018-02-03 23:41:07,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:07,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:07,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:07,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:07,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:07,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:07,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:07,920 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:07,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:07,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:07,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:41:07,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:41:07,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:41:07,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 10 treesize of output 9 [2018-02-03 23:41:07,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-02-03 23:41:07,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:07,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:07,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:07,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-02-03 23:41:07,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:07,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-02-03 23:41:08,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:08,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 8 treesize of output 7 [2018-02-03 23:41:08,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-03 23:41:08,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:08,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:60 [2018-02-03 23:41:08,075 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-02-03 23:41:08,076 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-02-03 23:41:08,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,092 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 77 treesize of output 61 [2018-02-03 23:41:08,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-02-03 23:41:08,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:104, output treesize:88 [2018-02-03 23:41:08,143 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 30 treesize of output 33 [2018-02-03 23:41:08,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:41:08,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,164 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 80 treesize of output 73 [2018-02-03 23:41:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2018-02-03 23:41:08,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:91 [2018-02-03 23:41:08,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,279 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 33 treesize of output 29 [2018-02-03 23:41:08,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,286 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 2 case distinctions, treesize of input 16 treesize of output 17 [2018-02-03 23:41:08,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:08,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:41:08,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:08,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:260 [2018-02-03 23:41:08,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-02-03 23:41:08,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:08,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:278, output treesize:68 [2018-02-03 23:41:08,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,656 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:08,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-03 23:41:08,659 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:08,664 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 39 [2018-02-03 23:41:08,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:08,683 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:08,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2018-02-03 23:41:08,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:08,688 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:08,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,689 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 25 treesize of output 26 [2018-02-03 23:41:08,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:08,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,690 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:08,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:08,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-02-03 23:41:08,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:08,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:08,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:08,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-02-03 23:41:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:08,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:08,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 33 [2018-02-03 23:41:08,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-03 23:41:08,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-03 23:41:08,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 23:41:08,791 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 34 states. [2018-02-03 23:41:10,516 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 159 DAG size of output 85 [2018-02-03 23:41:11,900 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 162 DAG size of output 88 [2018-02-03 23:41:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:12,249 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2018-02-03 23:41:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-03 23:41:12,249 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-02-03 23:41:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:12,250 INFO L225 Difference]: With dead ends: 209 [2018-02-03 23:41:12,250 INFO L226 Difference]: Without dead ends: 209 [2018-02-03 23:41:12,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1068, Invalid=4632, Unknown=0, NotChecked=0, Total=5700 [2018-02-03 23:41:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-03 23:41:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2018-02-03 23:41:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-03 23:41:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-03 23:41:12,253 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 53 [2018-02-03 23:41:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:12,253 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-03 23:41:12,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-03 23:41:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-03 23:41:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-03 23:41:12,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:12,253 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:41:12,253 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1715612209, now seen corresponding path program 3 times [2018-02-03 23:41:12,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:12,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:12,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:12,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:12,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:12,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:12,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:12,714 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:12,719 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:41:12,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:41:12,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:41:12,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:12,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:12,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 23:41:12,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:12,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-03 23:41:12,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-02-03 23:41:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:41:12,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:12,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-03 23:41:12,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-03 23:41:12,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,851 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 35 treesize of output 46 [2018-02-03 23:41:12,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:12,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-03 23:41:12,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-02-03 23:41:12,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:12,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2018-02-03 23:41:12,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:12,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 70 [2018-02-03 23:41:13,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-03 23:41:13,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:13,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-02-03 23:41:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,074 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-02-03 23:41:13,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,090 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 160 [2018-02-03 23:41:13,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-02-03 23:41:13,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:13,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:13,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:448 [2018-02-03 23:41:13,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,306 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2018-02-03 23:41:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,316 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 160 [2018-02-03 23:41:13,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:13,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,375 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 106 [2018-02-03 23:41:13,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,384 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 143 [2018-02-03 23:41:13,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:13,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:13,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:229, output treesize:221 [2018-02-03 23:41:13,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,899 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 138 treesize of output 140 [2018-02-03 23:41:13,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:13,933 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 118 treesize of output 150 [2018-02-03 23:41:13,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:13,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:13,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:257, output treesize:221 [2018-02-03 23:41:14,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,132 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2018-02-03 23:41:14,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,164 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 108 [2018-02-03 23:41:14,164 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-03 23:41:14,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 66 dim-0 vars, End of recursive call: 66 dim-0 vars, and 39 xjuncts. [2018-02-03 23:41:14,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,659 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-02-03 23:41:14,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,664 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 89 [2018-02-03 23:41:14,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,672 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2018-02-03 23:41:14,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,677 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,683 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 82 [2018-02-03 23:41:14,683 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,686 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 75 [2018-02-03 23:41:14,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,692 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 77 [2018-02-03 23:41:14,696 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,699 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 83 [2018-02-03 23:41:14,705 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,706 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,707 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 46 treesize of output 49 [2018-02-03 23:41:14,707 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,710 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 77 [2018-02-03 23:41:14,711 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,713 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,714 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 52 treesize of output 59 [2018-02-03 23:41:14,714 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,717 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,721 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 85 [2018-02-03 23:41:14,722 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,729 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 86 [2018-02-03 23:41:14,735 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,738 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-02-03 23:41:14,741 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,744 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 83 [2018-02-03 23:41:14,748 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,750 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,751 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 51 treesize of output 56 [2018-02-03 23:41:14,751 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,762 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-02-03 23:41:14,765 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,770 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,775 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 85 [2018-02-03 23:41:14,775 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:14,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,779 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-02-03 23:41:14,781 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,784 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,785 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 47 treesize of output 52 [2018-02-03 23:41:14,785 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:14,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,788 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:14,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:14,790 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2018-02-03 23:41:14,790 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,212 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 37 treesize of output 30 [2018-02-03 23:41:15,212 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,213 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 47 treesize of output 32 [2018-02-03 23:41:15,213 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,214 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 55 treesize of output 44 [2018-02-03 23:41:15,214 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,216 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 61 treesize of output 46 [2018-02-03 23:41:15,216 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-02-03 23:41:15,217 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2018-02-03 23:41:15,219 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,220 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 55 treesize of output 44 [2018-02-03 23:41:15,220 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,221 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 58 treesize of output 47 [2018-02-03 23:41:15,221 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,223 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 51 treesize of output 44 [2018-02-03 23:41:15,223 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,224 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 61 treesize of output 46 [2018-02-03 23:41:15,224 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2018-02-03 23:41:15,226 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-02-03 23:41:15,227 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-02-03 23:41:15,228 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,229 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 61 treesize of output 46 [2018-02-03 23:41:15,230 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,231 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 45 [2018-02-03 23:41:15,231 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,232 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 53 treesize of output 42 [2018-02-03 23:41:15,232 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-02-03 23:41:15,234 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-02-03 23:41:15,235 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,236 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 55 treesize of output 44 [2018-02-03 23:41:15,236 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,237 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 49 treesize of output 38 [2018-02-03 23:41:15,238 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 19 dim-0 vars, and 20 xjuncts. [2018-02-03 23:41:15,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,892 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:15,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-02-03 23:41:15,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,906 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 58 [2018-02-03 23:41:15,908 INFO L267 ElimStorePlain]: Start of recursive call 45: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-02-03 23:41:15,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,974 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 47 treesize of output 53 [2018-02-03 23:41:15,974 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:15,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-02-03 23:41:15,978 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,982 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 1 case distinctions, treesize of input 50 treesize of output 56 [2018-02-03 23:41:15,983 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-02-03 23:41:15,984 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-02-03 23:41:15,988 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,990 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 36 treesize of output 32 [2018-02-03 23:41:15,990 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:15,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:15,996 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 1 case distinctions, treesize of input 51 treesize of output 57 [2018-02-03 23:41:15,996 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:16,067 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 24 treesize of output 17 [2018-02-03 23:41:16,067 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,068 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 37 treesize of output 26 [2018-02-03 23:41:16,068 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,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 32 treesize of output 25 [2018-02-03 23:41:16,069 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-02-03 23:41:16,071 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,072 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 33 treesize of output 22 [2018-02-03 23:41:16,072 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,073 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 33 treesize of output 26 [2018-02-03 23:41:16,073 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-02-03 23:41:16,074 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,113 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-02-03 23:41:16,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,670 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:16,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2018-02-03 23:41:16,676 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 9 treesize of output 1 [2018-02-03 23:41:16,676 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-02-03 23:41:16,695 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:16,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:16,715 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-02-03 23:41:16,716 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:16,736 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:17,310 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:17,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 117 [2018-02-03 23:41:17,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,317 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:17,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,324 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 68 [2018-02-03 23:41:17,325 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:17,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:17,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 75 [2018-02-03 23:41:17,364 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:17,414 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 33 treesize of output 26 [2018-02-03 23:41:17,414 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:17,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-02-03 23:41:17,416 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:17,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-02-03 23:41:17,417 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:17,443 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:18,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 51 dim-0 vars, and 33 xjuncts. [2018-02-03 23:41:18,090 INFO L202 ElimStorePlain]: Needed 69 recursive calls to eliminate 22 variables, input treesize:529, output treesize:1341 [2018-02-03 23:41:18,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:18,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:18,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:18,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-02-03 23:41:18,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:18,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:18,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-03 23:41:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:18,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:18,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-02-03 23:41:18,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 23:41:18,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 23:41:18,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 23:41:18,462 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 43 states. [2018-02-03 23:41:19,804 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 180 DAG size of output 78 [2018-02-03 23:41:20,106 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 147 DAG size of output 63 [2018-02-03 23:41:20,641 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 162 DAG size of output 76 [2018-02-03 23:41:20,903 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 111 DAG size of output 92 [2018-02-03 23:41:21,104 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 120 DAG size of output 86 [2018-02-03 23:41:21,642 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 209 DAG size of output 73 [2018-02-03 23:41:22,208 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 153 DAG size of output 73 [2018-02-03 23:41:22,638 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 65 [2018-02-03 23:41:22,978 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 192 DAG size of output 86 [2018-02-03 23:41:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:24,160 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2018-02-03 23:41:24,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-03 23:41:24,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-02-03 23:41:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:24,161 INFO L225 Difference]: With dead ends: 261 [2018-02-03 23:41:24,161 INFO L226 Difference]: Without dead ends: 261 [2018-02-03 23:41:24,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2381 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1546, Invalid=7960, Unknown=0, NotChecked=0, Total=9506 [2018-02-03 23:41:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-03 23:41:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 210. [2018-02-03 23:41:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-03 23:41:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 234 transitions. [2018-02-03 23:41:24,164 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 234 transitions. Word has length 54 [2018-02-03 23:41:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:24,164 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 234 transitions. [2018-02-03 23:41:24,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 23:41:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 234 transitions. [2018-02-03 23:41:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-03 23:41:24,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:24,164 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:41:24,164 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1715612210, now seen corresponding path program 2 times [2018-02-03 23:41:24,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:24,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:24,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:24,165 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:41:24,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:24,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:24,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:24,527 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:24,532 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:41:24,552 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:41:24,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:41:24,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:24,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:41:24,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:41:24,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 23:41:24,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:41:24,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-02-03 23:41:24,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:24,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:24,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:24,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:24,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:45 [2018-02-03 23:41:24,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-03 23:41:24,671 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-02-03 23:41:24,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-02-03 23:41:24,686 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-02-03 23:41:24,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-02-03 23:41:24,729 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 30 treesize of output 33 [2018-02-03 23:41:24,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:41:24,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-02-03 23:41:24,757 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 47 treesize of output 56 [2018-02-03 23:41:24,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:80 [2018-02-03 23:41:24,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,843 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 21 treesize of output 40 [2018-02-03 23:41:24,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-03 23:41:24,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-03 23:41:24,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-02-03 23:41:24,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:24,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-02-03 23:41:24,988 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 18 treesize of output 16 [2018-02-03 23:41:24,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:24,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:25,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:25,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:96 [2018-02-03 23:41:25,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 164 [2018-02-03 23:41:25,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,093 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 3 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 168 [2018-02-03 23:41:25,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 18 dim-0 vars, End of recursive call: 18 dim-0 vars, and 20 xjuncts. [2018-02-03 23:41:25,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-02-03 23:41:25,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 227 [2018-02-03 23:41:25,560 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,568 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-03 23:41:25,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,617 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,618 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 157 treesize of output 178 [2018-02-03 23:41:25,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,622 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,650 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-03 23:41:25,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 198 [2018-02-03 23:41:25,701 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,712 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-03 23:41:25,713 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,749 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,755 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,755 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 164 treesize of output 185 [2018-02-03 23:41:25,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,759 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,770 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-03 23:41:25,771 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,814 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,820 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 182 treesize of output 204 [2018-02-03 23:41:25,822 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,835 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-03 23:41:25,836 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,876 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:25,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,882 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,883 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 139 treesize of output 168 [2018-02-03 23:41:25,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,886 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,896 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 106 [2018-02-03 23:41:25,897 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:25,915 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:25,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,920 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,922 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 189 treesize of output 210 [2018-02-03 23:41:25,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,925 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:25,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,937 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 126 [2018-02-03 23:41:25,938 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,980 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:25,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:25,989 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 189 treesize of output 211 [2018-02-03 23:41:25,991 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:26,002 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 107 [2018-02-03 23:41:26,003 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:26,040 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:26,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:26,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 153 [2018-02-03 23:41:26,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:26,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:26,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:26,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 80 [2018-02-03 23:41:26,051 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:26,065 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:26,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 35 dim-0 vars, and 20 xjuncts. [2018-02-03 23:41:26,590 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 2 variables, input treesize:180, output treesize:3766 [2018-02-03 23:41:27,038 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 468 DAG size of output 86 [2018-02-03 23:41:27,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,050 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,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, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2018-02-03 23:41:27,059 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 206 [2018-02-03 23:41:27,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:27,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 177 [2018-02-03 23:41:27,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,213 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 219 [2018-02-03 23:41:27,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:27,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,357 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 195 treesize of output 217 [2018-02-03 23:41:27,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,365 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 67 treesize of output 92 [2018-02-03 23:41:27,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:27,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 180 [2018-02-03 23:41:27,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-02-03 23:41:27,469 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,556 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 141 treesize of output 146 [2018-02-03 23:41:27,565 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 122 [2018-02-03 23:41:27,566 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:27,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,658 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 137 treesize of output 175 [2018-02-03 23:41:27,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:27,667 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 81 treesize of output 106 [2018-02-03 23:41:27,667 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:27,692 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:27,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:27,744 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:524, output treesize:508 [2018-02-03 23:41:28,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,744 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:28,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2018-02-03 23:41:28,751 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:28,757 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:41:28,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:28,791 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 30 treesize of output 23 [2018-02-03 23:41:28,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:28,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,819 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 73 [2018-02-03 23:41:28,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:28,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:28,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,994 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:28,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:28,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 194 [2018-02-03 23:41:28,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,023 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 138 [2018-02-03 23:41:29,024 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-03 23:41:29,034 INFO L267 ElimStorePlain]: Start of recursive call 7: 42 dim-0 vars, End of recursive call: 42 dim-0 vars, and 37 xjuncts. [2018-02-03 23:41:29,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,351 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,356 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 114 [2018-02-03 23:41:29,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:29,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,362 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 156 [2018-02-03 23:41:29,370 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:29,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,376 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 155 [2018-02-03 23:41:29,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-02-03 23:41:29,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,395 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 162 [2018-02-03 23:41:29,406 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:29,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,412 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 162 [2018-02-03 23:41:29,426 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-02-03 23:41:29,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,431 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 160 [2018-02-03 23:41:29,441 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:29,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,445 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 122 [2018-02-03 23:41:29,450 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:29,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,455 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 153 [2018-02-03 23:41:29,466 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:29,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,471 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 155 [2018-02-03 23:41:29,481 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:29,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,485 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 143 [2018-02-03 23:41:29,493 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:29,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,496 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:29,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:29,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 115 [2018-02-03 23:41:29,502 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:30,162 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 93 treesize of output 83 [2018-02-03 23:41:30,163 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,164 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 100 treesize of output 90 [2018-02-03 23:41:30,164 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,166 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 89 treesize of output 79 [2018-02-03 23:41:30,166 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,167 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 99 treesize of output 89 [2018-02-03 23:41:30,168 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,169 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 99 treesize of output 89 [2018-02-03 23:41:30,169 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,171 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 88 treesize of output 78 [2018-02-03 23:41:30,171 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-02-03 23:41:30,173 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,174 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 100 treesize of output 90 [2018-02-03 23:41:30,174 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,176 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 102 treesize of output 92 [2018-02-03 23:41:30,176 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,177 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 100 treesize of output 90 [2018-02-03 23:41:30,178 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,179 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 81 treesize of output 71 [2018-02-03 23:41:30,179 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:30,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 21 dim-0 vars, and 11 xjuncts. [2018-02-03 23:41:30,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2018-02-03 23:41:30,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,911 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2018-02-03 23:41:30,912 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:30,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-03 23:41:30,932 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:30,942 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:30,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 95 [2018-02-03 23:41:30,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,952 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-02-03 23:41:30,953 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:30,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,973 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:30,974 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:30,988 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:30,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-02-03 23:41:30,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:30,998 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2018-02-03 23:41:30,998 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:31,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,017 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 1 case distinctions, treesize of input 20 treesize of output 13 [2018-02-03 23:41:31,018 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,031 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-03 23:41:31,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,497 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 59 [2018-02-03 23:41:31,498 INFO L267 ElimStorePlain]: Start of recursive call 40: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-02-03 23:41:31,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-02-03 23:41:31,528 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,530 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 14 treesize of output 3 [2018-02-03 23:41:31,530 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,542 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-03 23:41:31,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,553 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 24 treesize of output 28 [2018-02-03 23:41:31,554 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,575 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:31,575 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,591 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-02-03 23:41:31,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,606 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-03 23:41:31,607 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-03 23:41:31,653 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,665 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-02-03 23:41:31,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,678 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-03 23:41:31,679 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-03 23:41:31,702 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,714 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-03 23:41:31,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,726 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 24 treesize of output 28 [2018-02-03 23:41:31,727 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,751 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:31,751 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,767 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-03 23:41:31,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,778 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 24 treesize of output 28 [2018-02-03 23:41:31,779 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,800 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:31,800 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,815 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-02-03 23:41:31,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,826 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-03 23:41:31,826 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,845 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 1 case distinctions, treesize of input 20 treesize of output 13 [2018-02-03 23:41:31,845 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,858 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-03 23:41:31,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,869 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 24 treesize of output 28 [2018-02-03 23:41:31,870 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,889 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 23:41:31,890 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,906 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:31,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-02-03 23:41:31,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,926 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 55 [2018-02-03 23:41:31,927 INFO L267 ElimStorePlain]: Start of recursive call 65: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:31,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-02-03 23:41:31,950 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,960 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:31,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-02-03 23:41:31,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:31,973 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-03 23:41:31,973 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:31,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-03 23:41:31,993 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:32,005 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:32,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-02-03 23:41:32,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,018 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2018-02-03 23:41:32,018 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:32,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-02-03 23:41:32,040 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:32,052 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,512 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:32,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:32,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 180 [2018-02-03 23:41:32,519 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:32,526 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 102 [2018-02-03 23:41:32,527 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:32,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-02-03 23:41:32,563 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:32,596 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 114 [2018-02-03 23:41:32,598 INFO L267 ElimStorePlain]: Start of recursive call 76: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:32,677 INFO L267 ElimStorePlain]: Start of recursive call 73: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-03 23:41:33,292 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 113 treesize of output 95 [2018-02-03 23:41:33,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-02-03 23:41:33,297 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-03 23:41:33,313 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,322 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,325 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 109 treesize of output 91 [2018-02-03 23:41:33,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,333 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 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-03 23:41:33,334 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:33,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-02-03 23:41:33,362 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-03 23:41:33,363 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,376 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:33,379 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 106 treesize of output 90 [2018-02-03 23:41:33,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,386 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 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-03 23:41:33,387 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:33,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-02-03 23:41:33,414 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-03 23:41:33,415 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,428 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:33,432 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 109 treesize of output 91 [2018-02-03 23:41:33,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-03 23:41:33,434 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:33,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:33,456 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 1 case distinctions, treesize of input 23 treesize of output 31 [2018-02-03 23:41:33,456 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:33,478 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:33,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 63 dim-0 vars, and 28 xjuncts. [2018-02-03 23:41:33,999 INFO L202 ElimStorePlain]: Needed 90 recursive calls to eliminate 17 variables, input treesize:610, output treesize:1190 [2018-02-03 23:41:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:34,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:34,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2018-02-03 23:41:34,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 23:41:34,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 23:41:34,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 23:41:34,435 INFO L87 Difference]: Start difference. First operand 210 states and 234 transitions. Second operand 41 states. [2018-02-03 23:41:37,251 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 246 DAG size of output 82 [2018-02-03 23:41:37,662 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 241 DAG size of output 77 [2018-02-03 23:41:38,165 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 466 DAG size of output 88 [2018-02-03 23:41:39,042 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 342 DAG size of output 110 [2018-02-03 23:41:39,979 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 355 DAG size of output 122 [2018-02-03 23:41:40,186 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 166 DAG size of output 95 [2018-02-03 23:41:40,395 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 193 DAG size of output 85 [2018-02-03 23:41:40,648 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 206 DAG size of output 91 [2018-02-03 23:41:41,848 WARN L146 SmtUtils]: Spent 524ms on a formula simplification. DAG size of input: 463 DAG size of output 240 [2018-02-03 23:41:42,237 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 249 DAG size of output 96 [2018-02-03 23:41:42,607 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 175 DAG size of output 111 [2018-02-03 23:41:43,509 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 394 DAG size of output 205 [2018-02-03 23:41:44,103 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 317 DAG size of output 103 [2018-02-03 23:41:44,652 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 248 DAG size of output 86 [2018-02-03 23:41:45,666 WARN L146 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 374 DAG size of output 248 [2018-02-03 23:41:46,396 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 531 DAG size of output 111 [2018-02-03 23:41:47,076 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 468 DAG size of output 92 [2018-02-03 23:41:47,915 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 337 DAG size of output 105 [2018-02-03 23:41:48,642 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 244 DAG size of output 171 [2018-02-03 23:41:49,377 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 350 DAG size of output 117 [2018-02-03 23:41:49,608 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 201 DAG size of output 86 [2018-02-03 23:41:50,323 WARN L146 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 458 DAG size of output 235 [2018-02-03 23:41:50,520 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 244 DAG size of output 91 [2018-02-03 23:41:50,924 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 389 DAG size of output 200 [2018-02-03 23:41:51,228 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 312 DAG size of output 98 [2018-02-03 23:41:51,957 WARN L146 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 369 DAG size of output 243 [2018-02-03 23:41:52,411 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 526 DAG size of output 106 [2018-02-03 23:41:53,025 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 239 DAG size of output 166 [2018-02-03 23:41:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:53,227 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2018-02-03 23:41:53,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-03 23:41:53,227 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-02-03 23:41:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:53,228 INFO L225 Difference]: With dead ends: 325 [2018-02-03 23:41:53,228 INFO L226 Difference]: Without dead ends: 325 [2018-02-03 23:41:53,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4024 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2770, Invalid=12236, Unknown=0, NotChecked=0, Total=15006 [2018-02-03 23:41:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-03 23:41:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 221. [2018-02-03 23:41:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-03 23:41:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-02-03 23:41:53,231 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 54 [2018-02-03 23:41:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:53,232 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-02-03 23:41:53,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 23:41:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-02-03 23:41:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-03 23:41:53,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:53,232 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-03 23:41:53,232 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1170308456, now seen corresponding path program 1 times [2018-02-03 23:41:53,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:53,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:53,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:53,233 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:41:53,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:53,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:53,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:53,574 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:53,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:53,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:53,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:53,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 23:41:53,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:41:53,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:41:53,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-03 23:41:53,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-02-03 23:41:53,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-02-03 23:41:53,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:53,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:53,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:53,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:39 [2018-02-03 23:41:53,708 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 65 treesize of output 55 [2018-02-03 23:41:53,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,710 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 25 treesize of output 36 [2018-02-03 23:41:53,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,725 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-02-03 23:41:53,726 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-02-03 23:41:53,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:63 [2018-02-03 23:41:53,760 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 48 [2018-02-03 23:41:53,762 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 47 treesize of output 56 [2018-02-03 23:41:53,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,777 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 30 treesize of output 33 [2018-02-03 23:41:53,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 23:41:53,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:53,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:66 [2018-02-03 23:41:53,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,865 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 33 treesize of output 29 [2018-02-03 23:41:53,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:53,872 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 2 case distinctions, treesize of input 16 treesize of output 17 [2018-02-03 23:41:53,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-03 23:41:53,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:41:53,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:53,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:185 [2018-02-03 23:41:54,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 67 treesize of output 66 [2018-02-03 23:41:54,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:54,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:54,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:203, output treesize:62 [2018-02-03 23:41:54,173 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:54,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:54,175 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-02-03 23:41:54,176 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:41:54,177 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 21 treesize of output 18 [2018-02-03 23:41:54,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:54,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:54,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-02-03 23:41:54,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:54,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:54,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:54,188 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:19 [2018-02-03 23:41:54,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:54,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:54,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-02-03 23:41:54,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:54,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-03 23:41:54,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:73, output treesize:64 [2018-02-03 23:41:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:54,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:41:54,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 34 [2018-02-03 23:41:54,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-03 23:41:54,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-03 23:41:54,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2018-02-03 23:41:54,298 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 35 states. [2018-02-03 23:41:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:41:56,579 INFO L93 Difference]: Finished difference Result 242 states and 270 transitions. [2018-02-03 23:41:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-03 23:41:56,580 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2018-02-03 23:41:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:41:56,580 INFO L225 Difference]: With dead ends: 242 [2018-02-03 23:41:56,580 INFO L226 Difference]: Without dead ends: 242 [2018-02-03 23:41:56,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1006, Invalid=5156, Unknown=0, NotChecked=0, Total=6162 [2018-02-03 23:41:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-03 23:41:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2018-02-03 23:41:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-03 23:41:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2018-02-03 23:41:56,582 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 55 [2018-02-03 23:41:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:41:56,582 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2018-02-03 23:41:56,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-03 23:41:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2018-02-03 23:41:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-03 23:41:56,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:41:56,583 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-03 23:41:56,583 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-03 23:41:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1644369872, now seen corresponding path program 4 times [2018-02-03 23:41:56,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:41:56,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:41:56,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:56,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:41:56,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:41:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:41:56,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:41:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:41:56,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:41:56,898 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:41:56,902 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:41:56,931 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:41:56,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:41:56,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:41:56,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:56,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:56,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:56,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-03 23:41:56,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:41:56,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:41:56,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-03 23:41:56,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-03 23:41:56,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 14 treesize of output 13 [2018-02-03 23:41:56,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:56,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:56,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-03 23:41:57,018 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 43 treesize of output 37 [2018-02-03 23:41:57,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-02-03 23:41:57,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:57,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-03 23:41:57,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:41:57,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:57,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:44 [2018-02-03 23:41:57,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 67 [2018-02-03 23:41:57,149 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 57 treesize of output 56 [2018-02-03 23:41:57,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:57,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-02-03 23:41:57,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 67 [2018-02-03 23:41:57,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-02-03 23:41:57,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:41:57,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2018-02-03 23:41:57,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 89 [2018-02-03 23:41:57,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,270 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 86 treesize of output 111 [2018-02-03 23:41:57,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:41:57,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:41:57,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 113 [2018-02-03 23:41:57,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:41:57,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:41:57,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:41:57,351 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:97, output treesize:161 [2018-02-03 23:42:13,407 WARN L143 SmtUtils]: Spent 14028ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-03 23:42:27,476 WARN L143 SmtUtils]: Spent 14038ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-03 23:43:05,521 WARN L146 SmtUtils]: Spent 38009ms on a formula simplification. DAG size of input: 43 DAG size of output 42 [2018-02-03 23:43:07,597 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 89 [2018-02-03 23:43:09,692 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 89 [2018-02-03 23:43:09,700 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:43:09,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:09,726 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 86 treesize of output 85 [2018-02-03 23:43:09,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:09,748 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 108 treesize of output 107 [2018-02-03 23:43:09,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-03 23:43:09,780 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:429, output treesize:193 [2018-02-03 23:43:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:43:09,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:09,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 80 [2018-02-03 23:43:09,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,926 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 86 [2018-02-03 23:43:09,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:43:09,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-02-03 23:43:09,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:09,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:09,988 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2018-02-03 23:43:09,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 6 xjuncts. [2018-02-03 23:43:10,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:43:10,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 64 [2018-02-03 23:43:10,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 5 xjuncts. [2018-02-03 23:43:10,073 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 24 treesize of output 17 [2018-02-03 23:43:10,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:10,074 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 23 treesize of output 16 [2018-02-03 23:43:10,074 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:10,075 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 27 treesize of output 16 [2018-02-03 23:43:10,075 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:10,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-02-03 23:43:10,076 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 23:43:10,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-03 23:43:10,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:43:10,126 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:125, output treesize:92 [2018-02-03 23:43:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:43:10,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:43:10,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 40 [2018-02-03 23:43:10,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 23:43:10,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 23:43:10,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1447, Unknown=4, NotChecked=0, Total=1560 [2018-02-03 23:43:10,264 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand 40 states. Received shutdown request... [2018-02-03 23:43:47,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:43:47,409 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:43:47,412 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:43:47,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:43:47 BoogieIcfgContainer [2018-02-03 23:43:47,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:43:47,412 INFO L168 Benchmark]: Toolchain (without parser) took 201011.59 ms. Allocated memory was 400.0 MB in the beginning and 1.0 GB in the end (delta: 640.7 MB). Free memory was 356.9 MB in the beginning and 603.0 MB in the end (delta: -246.1 MB). Peak memory consumption was 394.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:43:47,413 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:43:47,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.44 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 346.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:43:47,413 INFO L168 Benchmark]: Boogie Preprocessor took 25.20 ms. Allocated memory is still 400.0 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:43:47,414 INFO L168 Benchmark]: RCFGBuilder took 218.03 ms. Allocated memory is still 400.0 MB. Free memory was 344.9 MB in the beginning and 322.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-03 23:43:47,414 INFO L168 Benchmark]: TraceAbstraction took 200618.38 ms. Allocated memory was 400.0 MB in the beginning and 1.0 GB in the end (delta: 640.7 MB). Free memory was 321.6 MB in the beginning and 603.0 MB in the end (delta: -281.4 MB). Peak memory consumption was 359.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:43:47,414 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.09 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.44 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 346.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.20 ms. Allocated memory is still 400.0 MB. Free memory was 346.2 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 218.03 ms. Allocated memory is still 400.0 MB. Free memory was 344.9 MB in the beginning and 322.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 200618.38 ms. Allocated memory was 400.0 MB in the beginning and 1.0 GB in the end (delta: 640.7 MB). Free memory was 321.6 MB in the beginning and 603.0 MB in the end (delta: -281.4 MB). Peak memory consumption was 359.3 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 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (222states) and interpolant automaton (currently 20 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 25 error locations. TIMEOUT Result, 200.5s OverallTime, 35 OverallIterations, 3 TraceHistogramMax, 93.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1447 SDtfs, 7012 SDslu, 11244 SDs, 0 SdLazy, 17504 SolverSat, 3063 SolverUnsat, 78 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1962 GetRequests, 607 SyntacticMatches, 87 SemanticMatches, 1267 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 19541 ImplicationChecksByTransitivity, 125.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 1101 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 105.2s InterpolantComputationTime, 2024 NumberOfCodeBlocks, 2024 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1971 ConstructedInterpolants, 270 QuantifiedInterpolants, 2702796 SizeOfPredicates, 297 NumberOfNonLiveVariables, 3494 ConjunctsInSsa, 838 ConjunctsInUnsatCore, 53 InterpolantComputations, 17 PerfectInterpolantSequences, 143/589 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-43-47-418.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-43-47-418.csv Completed graceful shutdown