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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:29:36,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:29:36,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:29:36,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:29:36,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:29:36,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:29:36,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:29:36,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:29:36,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:29:36,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:29:36,433 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:29:36,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:29:36,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:29:36,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:29:36,436 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:29:36,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:29:36,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:29:36,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:29:36,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:29:36,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:29:36,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:29:36,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:29:36,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:29:36,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:29:36,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:29:36,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:29:36,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:29:36,449 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:29:36,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:29:36,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:29:36,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:29:36,450 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-04 13:29:36,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:29:36,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:29:36,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:29:36,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:29:36,460 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:29:36,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:29:36,461 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:29:36,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:29:36,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:29:36,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:29:36,463 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:29:36,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:29:36,497 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:29:36,499 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:29:36,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:29:36,500 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:29:36,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-02-04 13:29:36,626 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:29:36,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:29:36,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:29:36,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:29:36,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:29:36,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac502e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36, skipping insertion in model container [2018-02-04 13:29:36,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:29:36,685 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:29:36,776 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:29:36,790 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:29:36,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36 WrapperNode [2018-02-04 13:29:36,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:29:36,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:29:36,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:29:36,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:29:36,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (1/1) ... [2018-02-04 13:29:36,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:29:36,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:29:36,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:29:36,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:29:36,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (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-04 13:29:36,886 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:29:36,886 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:29:36,886 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:29:36,886 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:29:36,887 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:29:36,888 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 13:29:36,888 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:29:36,888 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:29:36,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:29:36,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:29:37,220 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:29:37,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:29:37 BoogieIcfgContainer [2018-02-04 13:29:37,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:29:37,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:29:37,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:29:37,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:29:37,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:29:36" (1/3) ... [2018-02-04 13:29:37,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18630a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:29:37, skipping insertion in model container [2018-02-04 13:29:37,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:29:36" (2/3) ... [2018-02-04 13:29:37,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18630a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:29:37, skipping insertion in model container [2018-02-04 13:29:37,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:29:37" (3/3) ... [2018-02-04 13:29:37,226 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-02-04 13:29:37,231 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:29:37,236 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 13:29:37,266 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:29:37,266 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:29:37,266 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:29:37,266 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:29:37,266 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:29:37,266 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:29:37,266 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:29:37,267 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:29:37,267 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:29:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-02-04 13:29:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 13:29:37,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,287 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-02-04 13:29:37,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:37,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:37,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:29:37,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 13:29:37,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 13:29:37,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:29:37,396 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-02-04 13:29:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:37,471 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-04 13:29:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 13:29:37,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 13:29:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:37,480 INFO L225 Difference]: With dead ends: 101 [2018-02-04 13:29:37,481 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 13:29:37,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:29:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 13:29:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 13:29:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 13:29:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-02-04 13:29:37,510 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-02-04 13:29:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:37,510 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-02-04 13:29:37,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 13:29:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-02-04 13:29:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 13:29:37,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,511 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-02-04 13:29:37,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:37,551 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-04 13:29:37,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:37,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:37,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:29:37,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:29:37,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:37,553 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-02-04 13:29:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:37,584 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 13:29:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:29:37,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 13:29:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:37,586 INFO L225 Difference]: With dead ends: 107 [2018-02-04 13:29:37,586 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 13:29:37,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 13:29:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-02-04 13:29:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 13:29:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-04 13:29:37,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-02-04 13:29:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:37,594 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-04 13:29:37,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:29:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-04 13:29:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:29:37,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,595 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,595 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-02-04 13:29:37,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:37,648 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-04 13:29:37,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:37,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:37,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:37,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:37,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:37,649 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-02-04 13:29:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:37,744 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-02-04 13:29:37,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:29:37,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 13:29:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:37,746 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:29:37,746 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:29:37,746 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-04 13:29:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:29:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 13:29:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 13:29:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 13:29:37,750 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-02-04 13:29:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:37,751 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 13:29:37,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 13:29:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:29:37,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,751 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,751 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-02-04 13:29:37,751 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:37,807 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-04 13:29:37,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:37,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:37,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:37,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:37,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:37,808 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-02-04 13:29:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:37,898 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-02-04 13:29:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:29:37,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 13:29:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:37,899 INFO L225 Difference]: With dead ends: 138 [2018-02-04 13:29:37,899 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 13:29:37,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-04 13:29:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 13:29:37,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-02-04 13:29:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:29:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-04 13:29:37,905 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-02-04 13:29:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:37,906 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-04 13:29:37,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-04 13:29:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:29:37,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,906 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-02-04 13:29:37,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:37,928 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-04 13:29:37,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:37,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:29:37,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:29:37,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:29:37,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:37,929 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-02-04 13:29:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:37,967 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 13:29:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:29:37,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 13:29:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:37,968 INFO L225 Difference]: With dead ends: 102 [2018-02-04 13:29:37,968 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 13:29:37,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 13:29:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-02-04 13:29:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 13:29:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-02-04 13:29:37,971 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-02-04 13:29:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:37,972 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-02-04 13:29:37,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:29:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-02-04 13:29:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:29:37,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:37,972 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:37,972 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-02-04 13:29:37,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:37,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:37,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:37,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:37,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:38,031 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-04 13:29:38,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:38,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:38,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:29:38,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:29:38,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:38,032 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-02-04 13:29:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:38,042 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-02-04 13:29:38,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:29:38,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 13:29:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:38,043 INFO L225 Difference]: With dead ends: 143 [2018-02-04 13:29:38,043 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 13:29:38,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:29:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 13:29:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-02-04 13:29:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 13:29:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-02-04 13:29:38,049 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-02-04 13:29:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:38,050 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-02-04 13:29:38,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:29:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-02-04 13:29:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:29:38,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:38,051 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:38,051 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-02-04 13:29:38,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:38,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:38,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:38,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:38,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:38,156 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-04 13:29:38,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:38,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:29:38,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:29:38,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:29:38,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:38,157 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-02-04 13:29:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:38,276 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2018-02-04 13:29:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:29:38,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 13:29:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:38,277 INFO L225 Difference]: With dead ends: 225 [2018-02-04 13:29:38,277 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 13:29:38,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:29:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 13:29:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-02-04 13:29:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 13:29:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-04 13:29:38,280 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-02-04 13:29:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:38,280 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-04 13:29:38,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:29:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-04 13:29:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:29:38,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:38,281 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:38,281 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-02-04 13:29:38,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:38,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:38,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:38,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:38,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:38,318 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-04 13:29:38,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:38,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:38,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:38,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:38,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:38,319 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-02-04 13:29:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:38,453 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-02-04 13:29:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:29:38,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 13:29:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:38,455 INFO L225 Difference]: With dead ends: 171 [2018-02-04 13:29:38,455 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 13:29:38,455 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-04 13:29:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 13:29:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-02-04 13:29:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 13:29:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-02-04 13:29:38,460 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-02-04 13:29:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:38,460 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-02-04 13:29:38,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-02-04 13:29:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 13:29:38,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:38,461 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:38,461 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-02-04 13:29:38,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:38,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:38,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,462 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:38,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:38,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:38,536 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-04 13:29:38,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:38,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:38,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:38,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:38,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:38,538 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-02-04 13:29:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:38,620 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-02-04 13:29:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:29:38,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 13:29:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:38,621 INFO L225 Difference]: With dead ends: 159 [2018-02-04 13:29:38,621 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 13:29:38,622 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-04 13:29:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 13:29:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-02-04 13:29:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 13:29:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-02-04 13:29:38,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-02-04 13:29:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:38,625 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-02-04 13:29:38,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-02-04 13:29:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:29:38,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:38,626 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:38,626 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-02-04 13:29:38,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:38,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:38,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:38,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:38,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:38,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:38,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:29:38,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:38,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:38,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:38,704 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-02-04 13:29:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:38,835 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-02-04 13:29:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:29:38,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 13:29:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:38,838 INFO L225 Difference]: With dead ends: 185 [2018-02-04 13:29:38,838 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 13:29:38,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:29:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 13:29:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-02-04 13:29:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 13:29:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-02-04 13:29:38,842 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-02-04 13:29:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:38,842 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-02-04 13:29:38,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-02-04 13:29:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:29:38,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:38,843 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:38,843 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-02-04 13:29:38,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:38,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:38,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:38,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:38,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:39,034 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-04 13:29:39,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:39,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 13:29:39,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:29:39,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:29:39,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:29:39,035 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 11 states. [2018-02-04 13:29:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:39,391 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2018-02-04 13:29:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:29:39,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 13:29:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:39,393 INFO L225 Difference]: With dead ends: 234 [2018-02-04 13:29:39,393 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 13:29:39,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:29:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 13:29:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-02-04 13:29:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 13:29:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-02-04 13:29:39,397 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-02-04 13:29:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:39,397 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-02-04 13:29:39,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:29:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-02-04 13:29:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:29:39,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:39,398 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] [2018-02-04 13:29:39,399 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-02-04 13:29:39,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:39,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:39,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:39,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:39,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:39,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:39,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:39,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:39,437 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-02-04 13:29:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:39,517 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-02-04 13:29:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:39,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-04 13:29:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:39,518 INFO L225 Difference]: With dead ends: 160 [2018-02-04 13:29:39,518 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 13:29:39,518 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-04 13:29:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 13:29:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-02-04 13:29:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 13:29:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-02-04 13:29:39,521 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-02-04 13:29:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:39,522 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-02-04 13:29:39,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-02-04 13:29:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 13:29:39,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:39,523 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] [2018-02-04 13:29:39,523 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-02-04 13:29:39,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:39,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:39,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:39,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:39,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:29:39,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:29:39,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:29:39,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:39,582 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-02-04 13:29:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:39,704 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-02-04 13:29:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:39,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 13:29:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:39,705 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:29:39,706 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 13:29:39,706 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-04 13:29:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 13:29:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-02-04 13:29:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 13:29:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-02-04 13:29:39,710 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-02-04 13:29:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:39,710 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-02-04 13:29:39,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:29:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-02-04 13:29:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:29:39,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:39,711 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] [2018-02-04 13:29:39,711 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:39,711 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-02-04 13:29:39,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:39,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:39,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:39,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:39,738 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-04 13:29:39,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:39,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:39,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-02-04 13:29:39,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:29:39,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:29:39,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:39,827 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 5 states. [2018-02-04 13:29:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:39,853 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 13:29:39,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:39,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 13:29:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:39,856 INFO L225 Difference]: With dead ends: 162 [2018-02-04 13:29:39,856 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 13:29:39,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-04 13:29:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 13:29:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-04 13:29:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 13:29:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-02-04 13:29:39,860 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-02-04 13:29:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:39,860 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-02-04 13:29:39,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:29:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-02-04 13:29:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:29:39,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:39,861 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] [2018-02-04 13:29:39,861 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-02-04 13:29:39,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:39,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:39,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:29:39,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:39,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:39,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:39,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:39,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:39,889 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-02-04 13:29:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:39,947 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-04 13:29:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:39,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 13:29:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:39,948 INFO L225 Difference]: With dead ends: 176 [2018-02-04 13:29:39,948 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 13:29:39,948 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-04 13:29:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 13:29:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-02-04 13:29:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 13:29:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-02-04 13:29:39,952 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-02-04 13:29:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:39,952 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-02-04 13:29:39,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-02-04 13:29:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:29:39,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:39,953 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] [2018-02-04 13:29:39,953 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-02-04 13:29:39,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:39,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:39,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:39,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:39,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:40,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:40,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:29:40,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:40,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:40,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:40,024 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-02-04 13:29:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:40,239 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2018-02-04 13:29:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:29:40,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 13:29:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:40,241 INFO L225 Difference]: With dead ends: 250 [2018-02-04 13:29:40,241 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 13:29:40,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:29:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 13:29:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-02-04 13:29:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 13:29:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-02-04 13:29:40,246 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-02-04 13:29:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:40,246 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-02-04 13:29:40,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-02-04 13:29:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:29:40,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:40,247 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:40,247 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-02-04 13:29:40,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:40,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:40,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,248 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:40,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:40,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:40,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:40,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:29:40,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:29:40,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:29:40,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:29:40,356 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 8 states. [2018-02-04 13:29:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:40,588 INFO L93 Difference]: Finished difference Result 268 states and 332 transitions. [2018-02-04 13:29:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:29:40,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 13:29:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:40,590 INFO L225 Difference]: With dead ends: 268 [2018-02-04 13:29:40,590 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 13:29:40,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:29:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 13:29:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 199. [2018-02-04 13:29:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 13:29:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2018-02-04 13:29:40,595 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2018-02-04 13:29:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:40,596 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2018-02-04 13:29:40,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:29:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2018-02-04 13:29:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:29:40,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:40,596 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:40,596 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash -521175963, now seen corresponding path program 1 times [2018-02-04 13:29:40,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:40,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:40,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:40,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:40,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:40,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:40,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:29:40,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:29:40,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:29:40,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:29:40,697 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand 7 states. [2018-02-04 13:29:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:40,885 INFO L93 Difference]: Finished difference Result 257 states and 318 transitions. [2018-02-04 13:29:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:29:40,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 13:29:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:40,887 INFO L225 Difference]: With dead ends: 257 [2018-02-04 13:29:40,887 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 13:29:40,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:29:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 13:29:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-02-04 13:29:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 13:29:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-02-04 13:29:40,892 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-02-04 13:29:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:40,892 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-02-04 13:29:40,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:29:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-02-04 13:29:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 13:29:40,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:40,893 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:40,893 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-02-04 13:29:40,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:40,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:40,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:40,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:40,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:40,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:40,952 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-04 13:29:40,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:40,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:41,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:41,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-02-04 13:29:41,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:29:41,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:29:41,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:41,029 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-02-04 13:29:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:41,072 INFO L93 Difference]: Finished difference Result 253 states and 312 transitions. [2018-02-04 13:29:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:41,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 13:29:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:41,073 INFO L225 Difference]: With dead ends: 253 [2018-02-04 13:29:41,073 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 13:29:41,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 13:29:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-02-04 13:29:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 13:29:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-02-04 13:29:41,078 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-02-04 13:29:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:41,078 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-02-04 13:29:41,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:29:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-02-04 13:29:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 13:29:41,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:41,080 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, 1, 1] [2018-02-04 13:29:41,080 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-02-04 13:29:41,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:41,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:41,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:41,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:41,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:41,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:41,194 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-04 13:29:41,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:41,195 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-04 13:29:41,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:41,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:41,343 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (not (= 0 main_~x~1.base)))) is different from true [2018-02-04 13:29:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:29:41,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:41,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-02-04 13:29:41,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:29:41,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:29:41,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-02-04 13:29:41,385 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 14 states. [2018-02-04 13:29:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:41,757 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2018-02-04 13:29:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:29:41,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 13:29:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:41,759 INFO L225 Difference]: With dead ends: 243 [2018-02-04 13:29:41,759 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 13:29:41,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=257, Unknown=1, NotChecked=34, Total=380 [2018-02-04 13:29:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 13:29:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-02-04 13:29:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 13:29:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-02-04 13:29:41,764 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-02-04 13:29:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:41,764 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-02-04 13:29:41,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:29:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-02-04 13:29:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:29:41,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:41,764 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:41,765 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-02-04 13:29:41,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:41,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:41,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:41,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:41,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:41,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:41,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:41,829 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-04 13:29:41,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:41,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:41,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 13:29:41,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:41,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 13:29:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:41,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:41,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-02-04 13:29:41,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:29:41,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:29:41,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:29:41,936 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 8 states. [2018-02-04 13:29:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:42,140 INFO L93 Difference]: Finished difference Result 263 states and 327 transitions. [2018-02-04 13:29:42,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:42,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-04 13:29:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:42,141 INFO L225 Difference]: With dead ends: 263 [2018-02-04 13:29:42,141 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 13:29:42,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:29:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 13:29:42,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2018-02-04 13:29:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 13:29:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-02-04 13:29:42,146 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-02-04 13:29:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:42,146 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-02-04 13:29:42,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:29:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-02-04 13:29:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:29:42,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:42,147 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:42,147 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-02-04 13:29:42,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:42,148 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:42,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:42,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:42,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:42,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:42,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:42,250 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-04 13:29:42,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:42,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:42,288 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-04 13:29:42,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:29:42,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-02-04 13:29:42,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-02-04 13:29:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:42,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:42,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-04 13:29:42,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:29:42,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:29:42,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:29:42,388 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 12 states. [2018-02-04 13:29:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:42,742 INFO L93 Difference]: Finished difference Result 317 states and 402 transitions. [2018-02-04 13:29:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:29:42,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 13:29:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:42,746 INFO L225 Difference]: With dead ends: 317 [2018-02-04 13:29:42,746 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 13:29:42,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:29:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 13:29:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-02-04 13:29:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 13:29:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-02-04 13:29:42,751 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-02-04 13:29:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:42,752 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-02-04 13:29:42,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:29:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-02-04 13:29:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:29:42,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:42,753 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:42,753 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-02-04 13:29:42,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:42,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:42,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:42,754 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:42,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:42,763 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:42,764 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:42,764 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:42,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:42,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:42,804 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-04 13:29:42,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:42,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,810 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-04 13:29:42,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 13:29:42,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 13:29:42,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 13:29:42,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 13:29:42,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 26 treesize of output 25 [2018-02-04 13:29:42,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,873 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-04 13:29:42,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-04 13:29:42,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 13:29:42,895 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-04 13:29:42,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-04 13:29:42,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 13:29:42,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:42,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:42,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-02-04 13:29:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:42,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:42,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 13:29:42,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:29:42,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:29:42,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:29:42,955 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand 9 states. [2018-02-04 13:29:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:43,089 INFO L93 Difference]: Finished difference Result 248 states and 321 transitions. [2018-02-04 13:29:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:29:43,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-02-04 13:29:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:43,115 INFO L225 Difference]: With dead ends: 248 [2018-02-04 13:29:43,115 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 13:29:43,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:29:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 13:29:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2018-02-04 13:29:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 13:29:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-02-04 13:29:43,117 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 48 [2018-02-04 13:29:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:43,118 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-02-04 13:29:43,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:29:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-02-04 13:29:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 13:29:43,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:43,118 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:43,118 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623146, now seen corresponding path program 1 times [2018-02-04 13:29:43,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:43,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:43,119 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:43,119 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:43,119 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:43,126 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:43,127 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:43,127 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:43,134 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:43,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:43,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:29:43,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:29:43,189 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-04 13:29:43,190 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-04 13:29:43,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,199 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-04 13:29:43,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:43,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-02-04 13:29:43,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-02-04 13:29:43,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-02-04 13:29:43,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 13:29:43,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:29:43,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 13:29:43,350 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 33 treesize of output 32 [2018-02-04 13:29:43,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:43,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-02-04 13:29:43,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 13:29:43,427 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-04 13:29:43,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-04 13:29:43,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 13:29:43,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-02-04 13:29:43,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-02-04 13:29:43,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:43,500 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-02-04 13:29:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:43,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:43,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 13:29:43,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:29:43,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:29:43,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:29:43,532 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand 11 states. [2018-02-04 13:29:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:43,838 INFO L93 Difference]: Finished difference Result 316 states and 407 transitions. [2018-02-04 13:29:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:29:43,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 13:29:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:43,839 INFO L225 Difference]: With dead ends: 316 [2018-02-04 13:29:43,839 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 13:29:43,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=271, Unknown=2, NotChecked=0, Total=380 [2018-02-04 13:29:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 13:29:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 209. [2018-02-04 13:29:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 13:29:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2018-02-04 13:29:43,841 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 48 [2018-02-04 13:29:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:43,842 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2018-02-04 13:29:43,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:29:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2018-02-04 13:29:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 13:29:43,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:43,842 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:43,842 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1869223904, now seen corresponding path program 1 times [2018-02-04 13:29:43,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:43,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:43,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:43,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:43,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:43,848 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:43,848 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:43,849 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:43,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:43,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:43,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:43,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:43,889 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-04 13:29:43,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 13:29:43,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:43,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 13:29:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:43,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:43,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 13:29:43,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:44,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:44,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:44,000 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand 6 states. [2018-02-04 13:29:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:44,195 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2018-02-04 13:29:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:29:44,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-04 13:29:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:44,197 INFO L225 Difference]: With dead ends: 308 [2018-02-04 13:29:44,197 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 13:29:44,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:29:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 13:29:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2018-02-04 13:29:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 13:29:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2018-02-04 13:29:44,201 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 49 [2018-02-04 13:29:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:44,201 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2018-02-04 13:29:44,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2018-02-04 13:29:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 13:29:44,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:44,202 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:44,202 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1027839999, now seen corresponding path program 1 times [2018-02-04 13:29:44,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:44,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:44,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,210 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:44,210 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:44,212 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:44,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:44,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:29:44,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:44,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:29:44,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:44,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:44,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:44,310 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand 6 states. [2018-02-04 13:29:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:44,414 INFO L93 Difference]: Finished difference Result 248 states and 323 transitions. [2018-02-04 13:29:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:29:44,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-02-04 13:29:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:44,416 INFO L225 Difference]: With dead ends: 248 [2018-02-04 13:29:44,416 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 13:29:44,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:29:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 13:29:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2018-02-04 13:29:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 13:29:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2018-02-04 13:29:44,419 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 51 [2018-02-04 13:29:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:44,419 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2018-02-04 13:29:44,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2018-02-04 13:29:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 13:29:44,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:44,420 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:44,420 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560870, now seen corresponding path program 1 times [2018-02-04 13:29:44,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:44,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:44,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,427 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:44,428 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:44,428 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:44,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:44,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:29:44,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:44,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:29:44,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:29:44,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:29:44,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:29:44,514 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand 7 states. [2018-02-04 13:29:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:44,599 INFO L93 Difference]: Finished difference Result 242 states and 314 transitions. [2018-02-04 13:29:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:29:44,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-02-04 13:29:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:44,600 INFO L225 Difference]: With dead ends: 242 [2018-02-04 13:29:44,601 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 13:29:44,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:29:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 13:29:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2018-02-04 13:29:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 13:29:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2018-02-04 13:29:44,604 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 55 [2018-02-04 13:29:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:44,604 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2018-02-04 13:29:44,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:29:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2018-02-04 13:29:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 13:29:44,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:44,605 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:44,605 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:44,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560827, now seen corresponding path program 1 times [2018-02-04 13:29:44,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:44,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:44,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,613 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:44,613 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:44,613 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:44,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:44,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:44,655 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-04 13:29:44,656 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-04 13:29:44,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,662 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-04 13:29:44,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 13:29:44,678 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 17 treesize of output 13 [2018-02-04 13:29:44,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 13:29:44,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 13:29:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:44,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:44,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:29:44,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:29:44,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:29:44,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:29:44,706 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand 8 states. [2018-02-04 13:29:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:44,850 INFO L93 Difference]: Finished difference Result 259 states and 326 transitions. [2018-02-04 13:29:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:29:44,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 13:29:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:44,850 INFO L225 Difference]: With dead ends: 259 [2018-02-04 13:29:44,850 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 13:29:44,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:29:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 13:29:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-02-04 13:29:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 13:29:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2018-02-04 13:29:44,853 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 55 [2018-02-04 13:29:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:44,853 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2018-02-04 13:29:44,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:29:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2018-02-04 13:29:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 13:29:44,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:44,853 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:44,853 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560826, now seen corresponding path program 1 times [2018-02-04 13:29:44,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:44,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:44,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:44,858 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:44,859 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:44,859 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:44,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:44,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:44,941 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-04 13:29:44,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-04 13:29:44,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,959 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-04 13:29:44,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, 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-04 13:29:44,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:44,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-02-04 13:29:45,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:29:45,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-04 13:29:45,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,028 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 33 treesize of output 25 [2018-02-04 13:29:45,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 13:29:45,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 13:29:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:45,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:45,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 13:29:45,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:29:45,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:29:45,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:29:45,082 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand 14 states. [2018-02-04 13:29:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:45,517 INFO L93 Difference]: Finished difference Result 384 states and 495 transitions. [2018-02-04 13:29:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:29:45,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 13:29:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:45,518 INFO L225 Difference]: With dead ends: 384 [2018-02-04 13:29:45,518 INFO L226 Difference]: Without dead ends: 384 [2018-02-04 13:29:45,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:29:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-04 13:29:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2018-02-04 13:29:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 13:29:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-02-04 13:29:45,521 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 55 [2018-02-04 13:29:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:45,521 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-02-04 13:29:45,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:29:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-02-04 13:29:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 13:29:45,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:45,522 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:45,522 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash -115996377, now seen corresponding path program 1 times [2018-02-04 13:29:45,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:45,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:45,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:45,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:45,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:45,527 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:45,527 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:45,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:45,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:45,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:45,597 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-04 13:29:45,599 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-04 13:29:45,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,607 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-04 13:29:45,609 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-04 13:29:45,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-02-04 13:29:45,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:29:45,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-04 13:29:45,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,654 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 33 treesize of output 25 [2018-02-04 13:29:45,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 13:29:45,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:45,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 13:29:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:45,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:45,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 13:29:45,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:29:45,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:29:45,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:29:45,719 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 16 states. [2018-02-04 13:29:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:46,404 INFO L93 Difference]: Finished difference Result 435 states and 556 transitions. [2018-02-04 13:29:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:29:46,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-02-04 13:29:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:46,405 INFO L225 Difference]: With dead ends: 435 [2018-02-04 13:29:46,405 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 13:29:46,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 13:29:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 13:29:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 233. [2018-02-04 13:29:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 13:29:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2018-02-04 13:29:46,410 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 57 [2018-02-04 13:29:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:46,410 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2018-02-04 13:29:46,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:29:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2018-02-04 13:29:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 13:29:46,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:46,411 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:46,411 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash -115996378, now seen corresponding path program 1 times [2018-02-04 13:29:46,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:46,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:46,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:46,412 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:46,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:46,419 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:46,419 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:46,419 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:46,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:46,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 13:29:46,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:46,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:29:46,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:29:46,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:29:46,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:29:46,500 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand 4 states. [2018-02-04 13:29:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:46,534 INFO L93 Difference]: Finished difference Result 249 states and 319 transitions. [2018-02-04 13:29:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:46,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-02-04 13:29:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:46,535 INFO L225 Difference]: With dead ends: 249 [2018-02-04 13:29:46,536 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 13:29:46,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-04 13:29:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 13:29:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-02-04 13:29:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 13:29:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2018-02-04 13:29:46,539 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 57 [2018-02-04 13:29:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:46,539 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2018-02-04 13:29:46,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:29:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2018-02-04 13:29:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 13:29:46,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:46,540 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:46,540 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash 156065119, now seen corresponding path program 1 times [2018-02-04 13:29:46,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:46,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:46,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:46,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:46,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:46,548 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:46,548 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:46,549 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:46,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:46,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:46,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:46,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:46,595 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-04 13:29:46,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:46,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:46,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 13:29:46,611 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-04 13:29:46,612 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-04 13:29:46,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:46,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:46,617 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-04 13:29:46,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-02-04 13:29:46,650 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 16 treesize of output 12 [2018-02-04 13:29:46,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 13:29:46,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:46,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:46,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:46,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-02-04 13:29:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:46,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:46,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 13:29:46,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:29:46,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:29:46,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:29:46,721 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand 14 states. [2018-02-04 13:29:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:47,261 INFO L93 Difference]: Finished difference Result 400 states and 488 transitions. [2018-02-04 13:29:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:29:47,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-02-04 13:29:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:47,263 INFO L225 Difference]: With dead ends: 400 [2018-02-04 13:29:47,263 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 13:29:47,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:29:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 13:29:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 231. [2018-02-04 13:29:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 13:29:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2018-02-04 13:29:47,266 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 59 [2018-02-04 13:29:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:47,266 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2018-02-04 13:29:47,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:29:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2018-02-04 13:29:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:29:47,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:47,267 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:47,267 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 740017122, now seen corresponding path program 2 times [2018-02-04 13:29:47,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:47,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:47,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:47,268 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:47,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:47,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:29:47,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:47,313 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-04 13:29:47,320 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:29:47,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:29:47,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:29:47,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:29:47,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:47,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-02-04 13:29:47,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:29:47,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:29:47,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:29:47,416 INFO L87 Difference]: Start difference. First operand 231 states and 291 transitions. Second operand 8 states. [2018-02-04 13:29:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:47,493 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-02-04 13:29:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:29:47,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-04 13:29:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:47,494 INFO L225 Difference]: With dead ends: 203 [2018-02-04 13:29:47,494 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 13:29:47,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:29:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 13:29:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 196. [2018-02-04 13:29:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 13:29:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2018-02-04 13:29:47,497 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 60 [2018-02-04 13:29:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:47,498 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2018-02-04 13:29:47,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:29:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2018-02-04 13:29:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 13:29:47,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:47,498 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, 1, 1, 1, 1, 1] [2018-02-04 13:29:47,499 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 257738368, now seen corresponding path program 1 times [2018-02-04 13:29:47,499 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:47,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:47,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:47,500 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:29:47,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:47,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:47,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:47,955 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-04 13:29:47,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:47,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:48,049 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-04 13:29:48,051 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-04 13:29:48,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 13:29:48,080 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-04 13:29:48,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,083 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-04 13:29:48,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 13:29:48,130 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 36 treesize of output 29 [2018-02-04 13:29:48,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:29:48,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2018-02-04 13:29:48,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,178 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-04 13:29:48,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2018-02-04 13:29:48,232 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 31 [2018-02-04 13:29:48,233 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-04 13:29:48,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-04 13:29:48,279 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 39 treesize of output 38 [2018-02-04 13:29:48,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:29:48,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-02-04 13:29:48,317 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 46 treesize of output 43 [2018-02-04 13:29:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-04 13:29:48,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2018-02-04 13:29:48,364 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 55 treesize of output 50 [2018-02-04 13:29:48,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 13:29:48,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2018-02-04 13:29:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-02-04 13:29:48,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-02-04 13:29:48,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:67 [2018-02-04 13:29:48,494 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 64 treesize of output 61 [2018-02-04 13:29:48,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-04 13:29:48,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,533 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-04 13:29:48,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:81 [2018-02-04 13:29:48,576 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 122 treesize of output 84 [2018-02-04 13:29:48,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 129 [2018-02-04 13:29:48,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,613 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-04 13:29:48,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:117 [2018-02-04 13:29:48,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,708 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 110 treesize of output 75 [2018-02-04 13:29:48,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,714 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 43 treesize of output 51 [2018-02-04 13:29:48,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:48,724 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 0 case distinctions, treesize of input 26 treesize of output 28 [2018-02-04 13:29:48,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:48,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:124, output treesize:5 [2018-02-04 13:29:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:48,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:48,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 31 [2018-02-04 13:29:48,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:29:48,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:29:48,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:29:48,798 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand 31 states. [2018-02-04 13:29:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:50,384 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2018-02-04 13:29:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 13:29:50,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-02-04 13:29:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:50,385 INFO L225 Difference]: With dead ends: 293 [2018-02-04 13:29:50,385 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 13:29:50,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=2729, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 13:29:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 13:29:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 226. [2018-02-04 13:29:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 13:29:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2018-02-04 13:29:50,389 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 60 [2018-02-04 13:29:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:50,389 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2018-02-04 13:29:50,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:29:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2018-02-04 13:29:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:29:50,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:50,390 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:50,390 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -12975118, now seen corresponding path program 1 times [2018-02-04 13:29:50,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:50,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:50,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:50,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:50,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:50,398 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:50,398 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:50,398 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:50,406 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:50,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:50,454 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-04 13:29:50,455 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-04 13:29:50,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 13:29:50,470 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-04 13:29:50,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,473 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-04 13:29:50,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 13:29:50,495 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 36 treesize of output 29 [2018-02-04 13:29:50,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:29:50,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-02-04 13:29:50,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 13:29:50,550 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 33 treesize of output 32 [2018-02-04 13:29:50,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 13:29:50,609 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:50,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-02-04 13:29:50,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,641 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 4 case distinctions, treesize of input 43 treesize of output 65 [2018-02-04 13:29:50,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 13:29:50,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:29:50,712 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 3 xjuncts. [2018-02-04 13:29:50,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:149 [2018-02-04 13:29:50,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2018-02-04 13:29:50,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,764 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 66 treesize of output 77 [2018-02-04 13:29:50,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:50,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 13:29:50,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,847 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 55 treesize of output 64 [2018-02-04 13:29:50,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:50,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2018-02-04 13:29:50,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:50,931 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 55 treesize of output 64 [2018-02-04 13:29:50,931 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:50,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:50,976 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:188, output treesize:176 [2018-02-04 13:29:51,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2018-02-04 13:29:51,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,035 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 68 treesize of output 78 [2018-02-04 13:29:51,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 86 [2018-02-04 13:29:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,128 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 79 treesize of output 91 [2018-02-04 13:29:51,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,167 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:51,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2018-02-04 13:29:51,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:51,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:51,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2018-02-04 13:29:51,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,264 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 68 treesize of output 78 [2018-02-04 13:29:51,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:51,323 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:233, output treesize:176 [2018-02-04 13:29:51,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 70 [2018-02-04 13:29:51,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-02-04 13:29:51,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 72 [2018-02-04 13:29:51,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-02-04 13:29:51,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,461 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 70 treesize of output 67 [2018-02-04 13:29:51,463 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-04 13:29:51,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,472 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,473 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 70 treesize of output 67 [2018-02-04 13:29:51,475 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-04 13:29:51,475 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:51,502 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:287, output treesize:155 [2018-02-04 13:29:51,590 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 93 treesize of output 81 [2018-02-04 13:29:51,592 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 63 treesize of output 48 [2018-02-04 13:29:51,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,622 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 89 treesize of output 79 [2018-02-04 13:29:51,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-02-04 13:29:51,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:51,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:133 [2018-02-04 13:29:51,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,776 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 78 treesize of output 69 [2018-02-04 13:29:51,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,788 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2018-02-04 13:29:51,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 13:29:51,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,820 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 78 treesize of output 59 [2018-02-04 13:29:51,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,830 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 37 [2018-02-04 13:29:51,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:51,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 13:29:51,840 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:51,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:157, output treesize:5 [2018-02-04 13:29:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:51,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:51,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 13:29:51,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:29:51,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:29:51,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:29:51,919 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand 21 states. [2018-02-04 13:29:52,757 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-02-04 13:29:52,896 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-02-04 13:29:53,058 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 132 DAG size of output 105 [2018-02-04 13:29:53,220 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 137 DAG size of output 110 [2018-02-04 13:29:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:53,454 INFO L93 Difference]: Finished difference Result 381 states and 470 transitions. [2018-02-04 13:29:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:29:53,454 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-04 13:29:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:53,455 INFO L225 Difference]: With dead ends: 381 [2018-02-04 13:29:53,455 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 13:29:53,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 13:29:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 13:29:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 264. [2018-02-04 13:29:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 13:29:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 325 transitions. [2018-02-04 13:29:53,458 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 325 transitions. Word has length 61 [2018-02-04 13:29:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:53,458 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 325 transitions. [2018-02-04 13:29:53,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:29:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 325 transitions. [2018-02-04 13:29:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:29:53,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:53,458 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:53,459 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:29:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash -12975117, now seen corresponding path program 1 times [2018-02-04 13:29:53,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:53,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:53,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:53,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:53,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:53,463 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:29:53,464 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:29:53,464 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:29:53,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:53,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:53,513 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-04 13:29:53,514 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-04 13:29:53,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,522 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-04 13:29:53,524 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-04 13:29:53,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 13:29:53,539 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-04 13:29:53,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,541 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-04 13:29:53,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,555 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-04 13:29:53,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-04 13:29:53,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 13:29:53,579 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 36 treesize of output 29 [2018-02-04 13:29:53,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:29:53,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,601 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 36 treesize of output 29 [2018-02-04 13:29:53,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:29:53,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-02-04 13:29:53,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 13:29:53,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,662 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 13:29:53,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,675 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 29 treesize of output 28 [2018-02-04 13:29:53,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-02-04 13:29:53,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,704 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 13:29:53,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,717 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 29 treesize of output 28 [2018-02-04 13:29:53,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,732 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-02-04 13:29:53,768 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 69 [2018-02-04 13:29:53,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,792 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 4 case distinctions, treesize of input 64 treesize of output 86 [2018-02-04 13:29:53,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 13:29:53,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:29:53,891 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 86 [2018-02-04 13:29:53,900 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 105 [2018-02-04 13:29:53,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 117 [2018-02-04 13:29:53,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,929 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,929 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 96 treesize of output 166 [2018-02-04 13:29:53,929 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:53,974 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:53,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 104 [2018-02-04 13:29:53,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:53,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 117 [2018-02-04 13:29:53,985 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:54,058 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:320 [2018-02-04 13:29:54,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 141 [2018-02-04 13:29:54,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,131 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 152 treesize of output 193 [2018-02-04 13:29:54,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:54,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 119 [2018-02-04 13:29:54,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,296 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:54,297 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 124 treesize of output 206 [2018-02-04 13:29:54,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 103 [2018-02-04 13:29:54,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,419 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 102 treesize of output 115 [2018-02-04 13:29:54,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:54,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 145 [2018-02-04 13:29:54,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 189 [2018-02-04 13:29:54,537 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,587 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:54,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 107 [2018-02-04 13:29:54,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,664 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:54,665 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 106 treesize of output 134 [2018-02-04 13:29:54,665 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,698 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:54,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 183 treesize of output 147 [2018-02-04 13:29:54,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,767 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:54,767 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 176 treesize of output 258 [2018-02-04 13:29:54,767 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:54,811 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:54,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:54,865 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:398, output treesize:472 [2018-02-04 13:29:54,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 137 [2018-02-04 13:29:54,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:54,943 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 134 treesize of output 148 [2018-02-04 13:29:54,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 132 [2018-02-04 13:29:55,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,120 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,121 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 119 treesize of output 177 [2018-02-04 13:29:55,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 197 [2018-02-04 13:29:55,278 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,281 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 226 [2018-02-04 13:29:55,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,343 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 208 treesize of output 238 [2018-02-04 13:29:55,343 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 197 [2018-02-04 13:29:55,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,467 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 218 treesize of output 281 [2018-02-04 13:29:55,468 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,577 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 188 [2018-02-04 13:29:55,586 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:55,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:55,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 184 [2018-02-04 13:29:55,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,735 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 199 treesize of output 231 [2018-02-04 13:29:55,736 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:55,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,818 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,819 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 151 [2018-02-04 13:29:55,827 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:55,891 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:55,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 162 [2018-02-04 13:29:55,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:55,981 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:55,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 289 [2018-02-04 13:29:55,983 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,030 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:56,076 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:586, output treesize:480 [2018-02-04 13:29:56,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 111 [2018-02-04 13:29:56,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 87 [2018-02-04 13:29:56,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,258 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,261 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 195 [2018-02-04 13:29:56,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 254 [2018-02-04 13:29:56,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:56,438 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 110 [2018-02-04 13:29:56,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,448 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 83 [2018-02-04 13:29:56,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 216 [2018-02-04 13:29:56,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,555 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 266 [2018-02-04 13:29:56,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:56,741 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,742 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 201 [2018-02-04 13:29:56,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 237 [2018-02-04 13:29:56,751 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,785 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,787 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,791 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:56,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 211 treesize of output 173 [2018-02-04 13:29:56,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 234 [2018-02-04 13:29:56,806 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,868 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:56,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 140 [2018-02-04 13:29:56,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:56,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 131 [2018-02-04 13:29:56,969 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:56,980 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,027 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-04 13:29:57,027 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:665, output treesize:449 [2018-02-04 13:29:57,150 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 82 DAG size of output 55 [2018-02-04 13:29:57,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,472 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 166 treesize of output 149 [2018-02-04 13:29:57,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,484 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 38 treesize of output 71 [2018-02-04 13:29:57,485 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-04 13:29:57,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,502 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2018-02-04 13:29:57,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:57,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:57,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 135 [2018-02-04 13:29:57,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,547 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:57,548 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:57,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-02-04 13:29:57,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,566 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:57,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 13:29:57,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,594 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 73 treesize of output 54 [2018-02-04 13:29:57,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,602 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 37 [2018-02-04 13:29:57,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 13:29:57,611 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,617 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,633 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 81 treesize of output 61 [2018-02-04 13:29:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2018-02-04 13:29:57,635 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 13:29:57,642 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,650 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:57,660 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:323, output treesize:27 [2018-02-04 13:29:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:57,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:57,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 13:29:57,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:29:57,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:29:57,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:29:57,752 INFO L87 Difference]: Start difference. First operand 264 states and 325 transitions. Second operand 21 states. [2018-02-04 13:30:05,098 WARN L143 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 109 [2018-02-04 13:30:05,383 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-02-04 13:30:05,529 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 109 DAG size of output 109 [2018-02-04 13:30:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:30:07,613 INFO L93 Difference]: Finished difference Result 377 states and 462 transitions. [2018-02-04 13:30:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:30:07,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-04 13:30:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:30:07,614 INFO L225 Difference]: With dead ends: 377 [2018-02-04 13:30:07,614 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 13:30:07,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 13:30:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 13:30:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 266. [2018-02-04 13:30:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 13:30:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 325 transitions. [2018-02-04 13:30:07,617 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 325 transitions. Word has length 61 [2018-02-04 13:30:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:30:07,617 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 325 transitions. [2018-02-04 13:30:07,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:30:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 325 transitions. [2018-02-04 13:30:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 13:30:07,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:30:07,618 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:30:07,618 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:30:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash -406345547, now seen corresponding path program 1 times [2018-02-04 13:30:07,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:30:07,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:30:07,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:07,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:07,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:07,622 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:30:07,623 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:30:07,623 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:30:07,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:07,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:30:07,707 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-04 13:30:07,709 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-04 13:30:07,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,714 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-04 13:30:07,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 13:30:07,741 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 16 treesize of output 12 [2018-02-04 13:30:07,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 13:30:07,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-02-04 13:30:07,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:07,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-04 13:30:07,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:07,780 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-04 13:30:07,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:30:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:07,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:30:07,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 13:30:07,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:30:07,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:30:07,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:30:07,823 INFO L87 Difference]: Start difference. First operand 266 states and 325 transitions. Second operand 16 states. [2018-02-04 13:30:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:30:08,401 INFO L93 Difference]: Finished difference Result 370 states and 452 transitions. [2018-02-04 13:30:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:30:08,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-02-04 13:30:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:30:08,402 INFO L225 Difference]: With dead ends: 370 [2018-02-04 13:30:08,402 INFO L226 Difference]: Without dead ends: 370 [2018-02-04 13:30:08,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 13:30:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-04 13:30:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-02-04 13:30:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 13:30:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 323 transitions. [2018-02-04 13:30:08,406 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 323 transitions. Word has length 62 [2018-02-04 13:30:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:30:08,406 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 323 transitions. [2018-02-04 13:30:08,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:30:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 323 transitions. [2018-02-04 13:30:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 13:30:08,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:30:08,407 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:30:08,407 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:30:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1119002561, now seen corresponding path program 1 times [2018-02-04 13:30:08,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:30:08,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:30:08,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:08,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:08,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:08,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:30:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:08,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:30:08,753 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:30:08,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:08,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:30:08,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:08,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:08,869 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-04 13:30:08,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-02-04 13:30:08,928 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-04 13:30:08,929 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-04 13:30:08,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 13:30:08,960 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-04 13:30:08,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 13:30:08,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:08,970 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-04 13:30:08,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-04 13:30:09,025 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 40 treesize of output 33 [2018-02-04 13:30:09,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2018-02-04 13:30:09,030 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-04 13:30:09,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-04 13:30:09,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:09,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:30:09,056 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 2 xjuncts. [2018-02-04 13:30:09,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-02-04 13:30:09,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:09,131 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-04 13:30:09,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:09,136 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-04 13:30:09,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:30:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:09,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:30:09,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-04 13:30:09,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 13:30:09,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 13:30:09,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:30:09,185 INFO L87 Difference]: Start difference. First operand 264 states and 323 transitions. Second operand 30 states. [2018-02-04 13:30:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:30:10,265 INFO L93 Difference]: Finished difference Result 350 states and 417 transitions. [2018-02-04 13:30:10,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:30:10,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 63 [2018-02-04 13:30:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:30:10,266 INFO L225 Difference]: With dead ends: 350 [2018-02-04 13:30:10,266 INFO L226 Difference]: Without dead ends: 350 [2018-02-04 13:30:10,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1788, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 13:30:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-04 13:30:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 315. [2018-02-04 13:30:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 13:30:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 386 transitions. [2018-02-04 13:30:10,268 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 386 transitions. Word has length 63 [2018-02-04 13:30:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:30:10,269 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 386 transitions. [2018-02-04 13:30:10,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 13:30:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 386 transitions. [2018-02-04 13:30:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 13:30:10,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:30:10,270 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:30:10,270 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:30:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1119002560, now seen corresponding path program 1 times [2018-02-04 13:30:10,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:30:10,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:30:10,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:10,271 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:10,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:10,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:30:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:10,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:30:10,425 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:30:10,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:10,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:30:10,482 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-04 13:30:10,484 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-04 13:30:10,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 13:30:10,500 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 23 treesize of output 18 [2018-02-04 13:30:10,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:30:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 13:30:10,521 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-04 13:30:10,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,523 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,524 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 55 [2018-02-04 13:30:10,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 13:30:10,560 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 39 treesize of output 30 [2018-02-04 13:30:10,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,566 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,567 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 30 treesize of output 92 [2018-02-04 13:30:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 13:30:10,601 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 60 treesize of output 47 [2018-02-04 13:30:10,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,606 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:30:10,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 13:30:10,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,658 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-04 13:30:10,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:60 [2018-02-04 13:30:10,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 13:30:10,716 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-04 13:30:10,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-02-04 13:30:10,765 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 63 treesize of output 62 [2018-02-04 13:30:10,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:30:10,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2018-02-04 13:30:10,830 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 70 treesize of output 67 [2018-02-04 13:30:10,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,833 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,833 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 55 [2018-02-04 13:30:10,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:95 [2018-02-04 13:30:10,897 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 79 treesize of output 74 [2018-02-04 13:30:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,901 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,901 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 30 treesize of output 92 [2018-02-04 13:30:10,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:10,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:108, output treesize:110 [2018-02-04 13:30:10,973 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 100 treesize of output 91 [2018-02-04 13:30:10,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:10,981 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:10,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:30:10,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:129, output treesize:110 [2018-02-04 13:30:11,049 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-04 13:30:11,051 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-04 13:30:11,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,080 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,080 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 94 treesize of output 122 [2018-02-04 13:30:11,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,085 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 89 [2018-02-04 13:30:11,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:143 [2018-02-04 13:30:11,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 198 [2018-02-04 13:30:11,168 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 22 treesize of output 21 [2018-02-04 13:30:11,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,202 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,203 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 227 treesize of output 201 [2018-02-04 13:30:11,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,207 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 272 [2018-02-04 13:30:11,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:30:11,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:256, output treesize:203 [2018-02-04 13:30:11,324 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 160 treesize of output 145 [2018-02-04 13:30:11,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 106 [2018-02-04 13:30:11,330 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-04 13:30:11,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 13:30:11,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:30:11,394 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 146 treesize of output 110 [2018-02-04 13:30:11,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,399 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 98 [2018-02-04 13:30:11,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,421 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,428 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 94 [2018-02-04 13:30:11,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 13:30:11,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:30:11,453 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 154 treesize of output 118 [2018-02-04 13:30:11,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,458 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:11,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 98 [2018-02-04 13:30:11,459 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:11,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:11,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 84 [2018-02-04 13:30:11,484 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 13:30:11,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:30:11,532 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 6 xjuncts. [2018-02-04 13:30:11,532 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:224, output treesize:114 [2018-02-04 13:30:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:11,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:30:11,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 28 [2018-02-04 13:30:11,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 13:30:11,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 13:30:11,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:30:11,691 INFO L87 Difference]: Start difference. First operand 315 states and 386 transitions. Second operand 29 states. [2018-02-04 13:30:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:30:38,688 INFO L93 Difference]: Finished difference Result 452 states and 534 transitions. [2018-02-04 13:30:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 13:30:38,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-02-04 13:30:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:30:38,689 INFO L225 Difference]: With dead ends: 452 [2018-02-04 13:30:38,689 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 13:30:38,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1012, Invalid=4994, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 13:30:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 13:30:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2018-02-04 13:30:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 13:30:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 405 transitions. [2018-02-04 13:30:38,692 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 405 transitions. Word has length 63 [2018-02-04 13:30:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:30:38,692 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 405 transitions. [2018-02-04 13:30:38,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 13:30:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 405 transitions. [2018-02-04 13:30:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 13:30:38,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:30:38,693 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:30:38,693 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:30:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -329341478, now seen corresponding path program 1 times [2018-02-04 13:30:38,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:30:38,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:30:38,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:38,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:38,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:38,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:30:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:38,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:30:38,738 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:30:38,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:38,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:30:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:38,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:30:38,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 13:30:38,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:30:38,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:30:38,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:30:38,804 INFO L87 Difference]: Start difference. First operand 326 states and 405 transitions. Second operand 6 states. [2018-02-04 13:30:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:30:38,820 INFO L93 Difference]: Finished difference Result 334 states and 405 transitions. [2018-02-04 13:30:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:30:38,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-02-04 13:30:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:30:38,821 INFO L225 Difference]: With dead ends: 334 [2018-02-04 13:30:38,821 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 13:30:38,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:30:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 13:30:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 328. [2018-02-04 13:30:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 13:30:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2018-02-04 13:30:38,825 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 64 [2018-02-04 13:30:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:30:38,825 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2018-02-04 13:30:38,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:30:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2018-02-04 13:30:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 13:30:38,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:30:38,826 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:30:38,826 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:30:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1619634143, now seen corresponding path program 1 times [2018-02-04 13:30:38,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:30:38,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:30:38,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:38,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:38,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:30:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:38,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:30:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:39,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:30:39,112 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:30:39,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:30:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:30:39,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:30:39,161 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-04 13:30:39,163 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-04 13:30:39,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 13:30:39,182 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 23 treesize of output 18 [2018-02-04 13:30:39,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:30:39,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 13:30:39,231 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-04 13:30:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,234 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 55 [2018-02-04 13:30:39,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 13:30:39,269 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 39 treesize of output 30 [2018-02-04 13:30:39,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,273 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,273 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 30 treesize of output 92 [2018-02-04 13:30:39,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 13:30:39,315 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 60 treesize of output 47 [2018-02-04 13:30:39,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,350 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:30:39,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 13:30:39,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,424 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-04 13:30:39,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,435 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-04 13:30:39,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 13:30:39,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 13:30:39,488 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-04 13:30:39,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:30:39,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 13:30:39,543 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 63 treesize of output 62 [2018-02-04 13:30:39,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:30:39,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,569 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-04 13:30:39,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-02-04 13:30:39,625 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 70 treesize of output 67 [2018-02-04 13:30:39,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,628 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,629 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 55 [2018-02-04 13:30:39,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,655 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-04 13:30:39,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:88 [2018-02-04 13:30:39,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-02-04 13:30:39,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,706 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,706 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 30 treesize of output 92 [2018-02-04 13:30:39,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,759 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-04 13:30:39,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:103 [2018-02-04 13:30:39,835 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 100 treesize of output 91 [2018-02-04 13:30:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,845 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:30:39,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,890 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-04 13:30:39,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:103 [2018-02-04 13:30:39,937 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 94 treesize of output 85 [2018-02-04 13:30:39,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:39,946 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,946 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:39,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 92 [2018-02-04 13:30:39,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:39,980 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-04 13:30:39,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:103 [2018-02-04 13:30:40,025 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 178 treesize of output 169 [2018-02-04 13:30:40,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,030 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:40,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 225 [2018-02-04 13:30:40,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:30:40,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:30:40,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:30:40,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:191, output treesize:181 [2018-02-04 13:30:40,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 131 [2018-02-04 13:30:40,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,161 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:30:40,164 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 75 treesize of output 109 [2018-02-04 13:30:40,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:30:40,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:30:40,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 114 [2018-02-04 13:30:40,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-02-04 13:30:40,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:30:40,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:30:40,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:25 [2018-02-04 13:30:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:30:40,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:30:40,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2018-02-04 13:30:40,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:30:40,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:30:40,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:30:40,350 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand 34 states. [2018-02-04 13:31:08,228 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 98 DAG size of output 83 [2018-02-04 13:31:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:31:29,193 INFO L93 Difference]: Finished difference Result 532 states and 635 transitions. [2018-02-04 13:31:29,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 13:31:29,193 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-02-04 13:31:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:31:29,194 INFO L225 Difference]: With dead ends: 532 [2018-02-04 13:31:29,194 INFO L226 Difference]: Without dead ends: 532 [2018-02-04 13:31:29,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1509, Invalid=6681, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 13:31:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-02-04 13:31:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2018-02-04 13:31:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 13:31:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 472 transitions. [2018-02-04 13:31:29,198 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 472 transitions. Word has length 65 [2018-02-04 13:31:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:31:29,199 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 472 transitions. [2018-02-04 13:31:29,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:31:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 472 transitions. [2018-02-04 13:31:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 13:31:29,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:31:29,199 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:31:29,199 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:31:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash 127654476, now seen corresponding path program 1 times [2018-02-04 13:31:29,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:31:29,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:31:29,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:29,200 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:29,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:29,204 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:31:29,204 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:31:29,204 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:31:29,209 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:31:29,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:31:29,281 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-04 13:31:29,282 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-04 13:31:29,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,290 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-04 13:31:29,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 13:31:29,307 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-04 13:31:29,309 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-04 13:31:29,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-02-04 13:31:29,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-02-04 13:31:29,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,353 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-04 13:31:29,354 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-04 13:31:29,354 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:29,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:31:29,364 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:67, output treesize:46 [2018-02-04 13:31:29,425 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 27 treesize of output 23 [2018-02-04 13:31:29,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 13:31:29,430 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-04 13:31:29,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:31:29,449 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 41 treesize of output 33 [2018-02-04 13:31:29,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-02-04 13:31:29,451 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-04 13:31:29,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:31:29,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-02-04 13:31:29,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2018-02-04 13:31:29,461 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-04 13:31:29,469 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:31:29,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 13:31:29,491 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:109 [2018-02-04 13:31:31,794 WARN L146 SmtUtils]: Spent 2283ms on a formula simplification. DAG size of input: 60 DAG size of output 42 [2018-02-04 13:31:32,619 WARN L143 SmtUtils]: Spent 804ms on a formula simplification that was a NOOP. DAG size: 42 [2018-02-04 13:31:34,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-02-04 13:31:34,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-02-04 13:31:34,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:34,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-02-04 13:31:34,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 13:31:34,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-02-04 13:31:34,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:34,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:31:34,833 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 39 treesize of output 35 [2018-02-04 13:31:34,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-02-04 13:31:34,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:34,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:34,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 13:31:34,873 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:82, output treesize:40 [2018-02-04 13:31:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:31:34,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:31:34,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 13:31:34,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:31:34,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:31:34,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=369, Unknown=1, NotChecked=0, Total=420 [2018-02-04 13:31:34,945 INFO L87 Difference]: Start difference. First operand 376 states and 472 transitions. Second operand 21 states. [2018-02-04 13:31:39,724 WARN L146 SmtUtils]: Spent 4082ms on a formula simplification. DAG size of input: 76 DAG size of output 58 [2018-02-04 13:31:47,957 WARN L146 SmtUtils]: Spent 8184ms on a formula simplification. DAG size of input: 87 DAG size of output 69 [2018-02-04 13:31:48,594 WARN L146 SmtUtils]: Spent 610ms on a formula simplification. DAG size of input: 97 DAG size of output 69 [2018-02-04 13:31:54,112 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 101 DAG size of output 58 [2018-02-04 13:31:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:31:54,231 INFO L93 Difference]: Finished difference Result 390 states and 484 transitions. [2018-02-04 13:31:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:31:54,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 13:31:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:31:54,232 INFO L225 Difference]: With dead ends: 390 [2018-02-04 13:31:54,232 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 13:31:54,233 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=279, Invalid=1202, Unknown=1, NotChecked=0, Total=1482 [2018-02-04 13:31:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 13:31:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-02-04 13:31:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 13:31:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 471 transitions. [2018-02-04 13:31:54,235 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 471 transitions. Word has length 65 [2018-02-04 13:31:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:31:54,235 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 471 transitions. [2018-02-04 13:31:54,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:31:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 471 transitions. [2018-02-04 13:31:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:31:54,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:31:54,236 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:31:54,236 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:31:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash -171753287, now seen corresponding path program 1 times [2018-02-04 13:31:54,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:31:54,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:31:54,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:54,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:54,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:54,240 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:31:54,240 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:31:54,240 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:31:54,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:31:54,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:31:54,359 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-04 13:31:54,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 13:31:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:54,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:54,369 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-04 13:31:54,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:49 [2018-02-04 13:31:54,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-02-04 13:31:54,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-02-04 13:31:54,428 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-04 13:31:54,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:31:54,453 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-04 13:31:54,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:78 [2018-02-04 13:31:54,839 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int) (v_prenex_69 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~1.base 1))) (and (= 0 (select |c_old(#valid)| main_~x~1.base)) (= 0 (select .cse0 v_prenex_69)) (= |c_#valid| (store (store .cse0 v_prenex_69 0) main_~x~1.base 0)) (not (= 0 main_~x~1.base)) (not (= 0 v_prenex_69))))) is different from true [2018-02-04 13:31:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:31:54,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:31:54,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 13:31:54,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:31:54,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:31:54,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=4, NotChecked=32, Total=342 [2018-02-04 13:31:54,873 INFO L87 Difference]: Start difference. First operand 376 states and 471 transitions. Second operand 19 states. [2018-02-04 13:31:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:31:56,109 INFO L93 Difference]: Finished difference Result 383 states and 477 transitions. [2018-02-04 13:31:56,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:31:56,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-04 13:31:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:31:56,110 INFO L225 Difference]: With dead ends: 383 [2018-02-04 13:31:56,110 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 13:31:56,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=968, Unknown=9, NotChecked=64, Total=1190 [2018-02-04 13:31:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 13:31:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-02-04 13:31:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-04 13:31:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 455 transitions. [2018-02-04 13:31:56,113 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 455 transitions. Word has length 66 [2018-02-04 13:31:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:31:56,113 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 455 transitions. [2018-02-04 13:31:56,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:31:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 455 transitions. [2018-02-04 13:31:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:31:56,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:31:56,113 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:31:56,113 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:31:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -830805894, now seen corresponding path program 1 times [2018-02-04 13:31:56,114 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:31:56,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:31:56,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:56,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:56,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:31:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:31:56,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:31:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:31:56,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:31:56,345 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:31:56,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:31:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:31:56,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:31:56,388 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-04 13:31:56,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 13:31:56,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 13:31:56,409 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 23 treesize of output 18 [2018-02-04 13:31:56,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:31:56,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 13:31:56,432 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-04 13:31:56,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,435 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,436 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 55 [2018-02-04 13:31:56,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 13:31:56,466 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 39 treesize of output 30 [2018-02-04 13:31:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,471 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,471 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 30 treesize of output 92 [2018-02-04 13:31:56,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 13:31:56,509 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 60 treesize of output 47 [2018-02-04 13:31:56,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,514 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:31:56,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 13:31:56,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,570 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-04 13:31:56,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,580 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-04 13:31:56,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 13:31:56,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-02-04 13:31:56,628 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-04 13:31:56,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,644 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-04 13:31:56,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 13:31:56,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-02-04 13:31:56,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:31:56,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,695 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-04 13:31:56,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-02-04 13:31:56,728 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 70 treesize of output 67 [2018-02-04 13:31:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,731 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,731 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 55 [2018-02-04 13:31:56,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,755 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-04 13:31:56,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:88 [2018-02-04 13:31:56,794 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 79 treesize of output 74 [2018-02-04 13:31:56,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,799 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,799 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 30 treesize of output 92 [2018-02-04 13:31:56,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,828 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-04 13:31:56,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:103 [2018-02-04 13:31:56,890 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 100 treesize of output 91 [2018-02-04 13:31:56,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,896 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 128 [2018-02-04 13:31:56,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,930 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-04 13:31:56,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:103 [2018-02-04 13:31:56,970 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 94 treesize of output 85 [2018-02-04 13:31:56,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:56,977 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,977 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:56,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 92 [2018-02-04 13:31:56,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:56,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:57,010 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-04 13:31:57,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:103 [2018-02-04 13:31:57,055 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 184 treesize of output 175 [2018-02-04 13:31:57,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,062 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:31:57,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 227 [2018-02-04 13:31:57,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:57,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:31:57,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:31:57,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:197, output treesize:178 [2018-02-04 13:31:57,196 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 174 treesize of output 130 [2018-02-04 13:31:57,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 102 [2018-02-04 13:31:57,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:31:57,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:31:57,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 114 [2018-02-04 13:31:57,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 15 xjuncts. [2018-02-04 13:31:57,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:31:57,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:31:57,319 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:190, output treesize:28 [2018-02-04 13:31:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:31:57,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:31:57,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2018-02-04 13:31:57,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 13:31:57,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 13:31:57,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:31:57,413 INFO L87 Difference]: Start difference. First operand 361 states and 455 transitions. Second operand 33 states. [2018-02-04 13:32:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:32:04,775 INFO L93 Difference]: Finished difference Result 509 states and 609 transitions. [2018-02-04 13:32:04,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 13:32:04,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2018-02-04 13:32:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:32:04,776 INFO L225 Difference]: With dead ends: 509 [2018-02-04 13:32:04,776 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 13:32:04,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1283, Invalid=5359, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 13:32:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 13:32:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 377. [2018-02-04 13:32:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 13:32:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 483 transitions. [2018-02-04 13:32:04,780 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 483 transitions. Word has length 69 [2018-02-04 13:32:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:32:04,780 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 483 transitions. [2018-02-04 13:32:04,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 13:32:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 483 transitions. [2018-02-04 13:32:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:32:04,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:32:04,781 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:32:04,781 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:32:04,781 INFO L82 PathProgramCache]: Analyzing trace with hash -830805851, now seen corresponding path program 1 times [2018-02-04 13:32:04,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:32:04,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:32:04,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:04,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:04,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:04,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:32:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:05,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:32:05,229 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:32:05,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:05,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:32:05,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,308 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-04 13:32:05,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 13:32:05,344 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-04 13:32:05,345 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-04 13:32:05,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 13:32:05,374 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 21 treesize of output 16 [2018-02-04 13:32:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:32:05,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-02-04 13:32:05,411 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 36 treesize of output 29 [2018-02-04 13:32:05,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:32:05,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-02-04 13:32:05,432 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-04 13:32:05,433 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-04 13:32:05,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,447 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 31 [2018-02-04 13:32:05,448 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-04 13:32:05,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-02-04 13:32:05,492 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 105 treesize of output 106 [2018-02-04 13:32:05,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 13:32:05,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,514 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 91 treesize of output 75 [2018-02-04 13:32:05,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,518 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 47 treesize of output 120 [2018-02-04 13:32:05,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:100 [2018-02-04 13:32:05,587 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 98 treesize of output 86 [2018-02-04 13:32:05,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 69 [2018-02-04 13:32:05,591 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-04 13:32:05,607 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 59 treesize of output 52 [2018-02-04 13:32:05,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,608 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 65 treesize of output 58 [2018-02-04 13:32:05,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:32:05,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 13:32:05,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:157 [2018-02-04 13:32:05,913 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:32:05,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-02-04 13:32:05,916 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:32:05,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 28 [2018-02-04 13:32:05,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:05,922 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 35 treesize of output 30 [2018-02-04 13:32:05,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:05,931 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-04 13:32:05,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:5 [2018-02-04 13:32:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:06,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:32:06,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-04 13:32:06,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:32:06,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:32:06,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:32:06,010 INFO L87 Difference]: Start difference. First operand 377 states and 483 transitions. Second operand 36 states. [2018-02-04 13:32:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:32:08,346 INFO L93 Difference]: Finished difference Result 469 states and 587 transitions. [2018-02-04 13:32:08,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 13:32:08,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-02-04 13:32:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:32:08,347 INFO L225 Difference]: With dead ends: 469 [2018-02-04 13:32:08,347 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 13:32:08,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=578, Invalid=3978, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 13:32:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 13:32:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 422. [2018-02-04 13:32:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 13:32:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 546 transitions. [2018-02-04 13:32:08,351 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 546 transitions. Word has length 69 [2018-02-04 13:32:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:32:08,351 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 546 transitions. [2018-02-04 13:32:08,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:32:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 546 transitions. [2018-02-04 13:32:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 13:32:08,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:32:08,352 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-02-04 13:32:08,352 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:32:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1953441236, now seen corresponding path program 1 times [2018-02-04 13:32:08,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:32:08,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:32:08,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:08,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,361 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:32:08,361 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:32:08,362 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:32:08,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:08,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:32:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 13:32:08,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:32:08,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 13:32:08,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:32:08,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:32:08,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:32:08,439 INFO L87 Difference]: Start difference. First operand 422 states and 546 transitions. Second operand 8 states. [2018-02-04 13:32:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:32:08,573 INFO L93 Difference]: Finished difference Result 423 states and 544 transitions. [2018-02-04 13:32:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:32:08,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-02-04 13:32:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:32:08,574 INFO L225 Difference]: With dead ends: 423 [2018-02-04 13:32:08,574 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 13:32:08,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:32:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 13:32:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 397. [2018-02-04 13:32:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 13:32:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2018-02-04 13:32:08,577 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 71 [2018-02-04 13:32:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:32:08,577 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2018-02-04 13:32:08,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:32:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2018-02-04 13:32:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 13:32:08,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:32:08,577 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:32:08,577 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:32:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1358221306, now seen corresponding path program 2 times [2018-02-04 13:32:08,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:32:08,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:32:08,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:08,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:08,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:32:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:08,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:32:08,627 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:32:08,639 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:32:08,673 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:32:08,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:32:08,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:32:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:08,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:32:08,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-02-04 13:32:08,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:32:08,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:32:08,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:32:08,713 INFO L87 Difference]: Start difference. First operand 397 states and 514 transitions. Second operand 6 states. [2018-02-04 13:32:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:32:08,732 INFO L93 Difference]: Finished difference Result 431 states and 548 transitions. [2018-02-04 13:32:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:32:08,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-02-04 13:32:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:32:08,733 INFO L225 Difference]: With dead ends: 431 [2018-02-04 13:32:08,733 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 13:32:08,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:32:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 13:32:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 400. [2018-02-04 13:32:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 13:32:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 517 transitions. [2018-02-04 13:32:08,737 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 517 transitions. Word has length 72 [2018-02-04 13:32:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:32:08,737 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 517 transitions. [2018-02-04 13:32:08,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:32:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 517 transitions. [2018-02-04 13:32:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 13:32:08,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:32:08,737 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:32:08,737 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:32:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -844812929, now seen corresponding path program 2 times [2018-02-04 13:32:08,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:32:08,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:32:08,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,738 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:32:08,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:08,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:32:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:09,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:32:09,513 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:32:09,520 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:32:09,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:32:09,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:32:09,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:32:09,565 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-04 13:32:09,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:09,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:09,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:32:09,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:09,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:09,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2018-02-04 13:32:09,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 13:32:09,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:32:09,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:90 [2018-02-04 13:32:09,959 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-04 13:32:09,960 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-04 13:32:09,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:09,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:09,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:09,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-02-04 13:32:10,009 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-04 13:32:10,010 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-04 13:32:10,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,027 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-04 13:32:10,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-02-04 13:32:10,113 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 49 treesize of output 40 [2018-02-04 13:32:10,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-02-04 13:32:10,118 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-04 13:32:10,127 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-04 13:32:10,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:32:10,153 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 2 xjuncts. [2018-02-04 13:32:10,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:84 [2018-02-04 13:32:10,275 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:32:10,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,319 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:32:10,319 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 24 treesize of output 47 [2018-02-04 13:32:10,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:32:10,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:39 [2018-02-04 13:32:10,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:10,445 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 45 treesize of output 63 [2018-02-04 13:32:10,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:10,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:32:10,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:49 [2018-02-04 13:32:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:32:10,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:32:10,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 35 [2018-02-04 13:32:10,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 13:32:10,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 13:32:10,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:32:10,547 INFO L87 Difference]: Start difference. First operand 400 states and 517 transitions. Second operand 36 states. [2018-02-04 13:32:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:32:12,886 INFO L93 Difference]: Finished difference Result 486 states and 609 transitions. [2018-02-04 13:32:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:32:12,887 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 73 [2018-02-04 13:32:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:32:12,887 INFO L225 Difference]: With dead ends: 486 [2018-02-04 13:32:12,887 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 13:32:12,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=300, Invalid=2892, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 13:32:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 13:32:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 443. [2018-02-04 13:32:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 13:32:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 572 transitions. [2018-02-04 13:32:12,891 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 572 transitions. Word has length 73 [2018-02-04 13:32:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:32:12,892 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 572 transitions. [2018-02-04 13:32:12,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 13:32:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 572 transitions. [2018-02-04 13:32:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 13:32:12,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:32:12,899 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:32:12,899 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 13:32:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 884883857, now seen corresponding path program 1 times [2018-02-04 13:32:12,900 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:32:12,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:32:12,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:12,900 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:32:12,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:32:12,905 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 13:32:12,905 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 13:32:12,906 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 13:32:12,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:32:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:32:12,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:32:12,968 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-04 13:32:12,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:32:12,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 13:32:12,989 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-04 13:32:12,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:12,991 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-04 13:32:12,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:12,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 13:32:13,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-02-04 13:32:13,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 13:32:13,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2018-02-04 13:32:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,036 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-04 13:32:13,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:43 [2018-02-04 13:32:13,079 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 31 [2018-02-04 13:32:13,080 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-04 13:32:13,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-02-04 13:32:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 13:32:13,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-04 13:32:13,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-02-04 13:32:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2018-02-04 13:32:13,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,169 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 32 treesize of output 54 [2018-02-04 13:32:13,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:71 [2018-02-04 13:32:13,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,223 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 55 treesize of output 67 [2018-02-04 13:32:13,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,243 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-02-04 13:32:13,243 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-04 13:32:13,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-02-04 13:32:13,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,316 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 70 treesize of output 86 [2018-02-04 13:32:13,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,328 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,350 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 136 [2018-02-04 13:32:13,351 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-04 13:32:13,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:80 [2018-02-04 13:32:13,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 13:32:13,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:78 [2018-02-04 13:32:13,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,507 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 66 treesize of output 83 [2018-02-04 13:32:13,509 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-04 13:32:13,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:13,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2018-02-04 13:32:13,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,623 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:32:13,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 106 [2018-02-04 13:32:13,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:13,696 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 63 treesize of output 206 [2018-02-04 13:32:13,696 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-02-04 13:32:13,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 112 xjuncts. [2018-02-04 13:32:14,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 16 xjuncts. [2018-02-04 13:32:14,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 16 xjuncts. [2018-02-04 13:32:14,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:1949 [2018-02-04 13:32:15,305 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 225 DAG size of output 70 [2018-02-04 13:32:15,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,324 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 111 treesize of output 110 [2018-02-04 13:32:15,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,326 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 36 treesize of output 47 [2018-02-04 13:32:15,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,564 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 111 treesize of output 110 [2018-02-04 13:32:15,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,568 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 36 treesize of output 47 [2018-02-04 13:32:15,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 108 [2018-02-04 13:32:15,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,784 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 27 treesize of output 36 [2018-02-04 13:32:15,784 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,971 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 120 treesize of output 119 [2018-02-04 13:32:15,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:15,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-02-04 13:32:15,974 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:15,997 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,152 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 103 treesize of output 108 [2018-02-04 13:32:16,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,154 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 34 [2018-02-04 13:32:16,154 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,177 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-02-04 13:32:16,304 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:561, output treesize:529 [2018-02-04 13:32:16,454 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 13:32:16,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,465 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 126 treesize of output 123 [2018-02-04 13:32:16,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,471 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 49 treesize of output 61 [2018-02-04 13:32:16,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,795 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 118 treesize of output 121 [2018-02-04 13:32:16,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:16,800 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 40 treesize of output 50 [2018-02-04 13:32:16,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:16,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,055 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 126 treesize of output 123 [2018-02-04 13:32:17,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,067 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 49 treesize of output 61 [2018-02-04 13:32:17,067 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,279 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 118 treesize of output 121 [2018-02-04 13:32:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,283 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 38 treesize of output 48 [2018-02-04 13:32:17,284 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,462 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 135 treesize of output 132 [2018-02-04 13:32:17,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,467 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 49 treesize of output 61 [2018-02-04 13:32:17,467 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,491 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:17,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 5 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-02-04 13:32:17,600 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:624, output treesize:529 [2018-02-04 13:32:17,746 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 106 [2018-02-04 13:32:17,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 148 [2018-02-04 13:32:17,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:17,779 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 190 [2018-02-04 13:32:17,780 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-04 13:32:17,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:18,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 148 [2018-02-04 13:32:18,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,056 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 190 [2018-02-04 13:32:18,057 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-04 13:32:18,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:18,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 144 [2018-02-04 13:32:18,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,323 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 180 [2018-02-04 13:32:18,324 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:18,367 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:18,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 155 [2018-02-04 13:32:18,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,565 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 124 treesize of output 213 [2018-02-04 13:32:18,566 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-04 13:32:18,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:32:18,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,740 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 127 treesize of output 115 [2018-02-04 13:32:18,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:18,760 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 130 [2018-02-04 13:32:18,761 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:32:18,787 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:32:18,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 5 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-02-04 13:32:18,898 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:727, output treesize:640 [2018-02-04 13:32:19,103 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 124 DAG size of output 97 [2018-02-04 13:32:19,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,140 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 144 treesize of output 147 [2018-02-04 13:32:19,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,181 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 97 [2018-02-04 13:32:19,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-02-04 13:32:19,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:32:19,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,545 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 134 treesize of output 143 [2018-02-04 13:32:19,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,573 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 97 [2018-02-04 13:32:19,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-02-04 13:32:19,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:32:19,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 153 [2018-02-04 13:32:19,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:19,938 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 97 [2018-02-04 13:32:19,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-02-04 13:32:20,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:32:20,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:20,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:20,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:20,346 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 144 treesize of output 147 [2018-02-04 13:32:20,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:20,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:20,374 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 97 [2018-02-04 13:32:20,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-02-04 13:32:20,446 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 13:32:20,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 12 xjuncts. [2018-02-04 13:32:20,744 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:559, output treesize:1507 [2018-02-04 13:32:21,124 WARN L143 SmtUtils]: Spent 302ms on a formula simplification that was a NOOP. DAG size: 196 [2018-02-04 13:32:21,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,144 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 202 treesize of output 180 [2018-02-04 13:32:21,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:21,174 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 273 [2018-02-04 13:32:21,175 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-04 13:32:21,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:29,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,289 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 211 treesize of output 189 [2018-02-04 13:32:29,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:29,327 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 273 [2018-02-04 13:32:29,329 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-04 13:32:29,419 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-04 13:32:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,968 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 225 treesize of output 193 [2018-02-04 13:32:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:34,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:35,000 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 264 [2018-02-04 13:32:35,002 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:35,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,139 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 216 treesize of output 184 [2018-02-04 13:32:40,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:40,163 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 270 [2018-02-04 13:32:40,164 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-04 13:32:40,257 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-04 13:32:44,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,640 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 188 treesize of output 172 [2018-02-04 13:32:44,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:44,674 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 244 [2018-02-04 13:32:44,676 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:44,773 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 177 [2018-02-04 13:32:48,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:48,502 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 277 [2018-02-04 13:32:48,503 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-04 13:32:48,593 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-04 13:32:51,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 193 [2018-02-04 13:32:51,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:51,632 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 331 [2018-02-04 13:32:51,633 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:51,737 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:54,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 158 [2018-02-04 13:32:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:54,386 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 245 [2018-02-04 13:32:54,387 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:54,468 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 13:32:56,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,897 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 216 treesize of output 184 [2018-02-04 13:32:56,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:32:56,919 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 339 [2018-02-04 13:32:56,920 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-04 13:32:57,019 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. Received shutdown request... [2018-02-04 13:32:57,752 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 13:32:57,752 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:32:57,756 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:32:57,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:32:57 BoogieIcfgContainer [2018-02-04 13:32:57,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:32:57,756 INFO L168 Benchmark]: Toolchain (without parser) took 201129.67 ms. Allocated memory was 402.7 MB in the beginning and 782.8 MB in the end (delta: 380.1 MB). Free memory was 359.3 MB in the beginning and 463.6 MB in the end (delta: -104.3 MB). Peak memory consumption was 391.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:32:57,757 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:32:57,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:32:57,757 INFO L168 Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:32:57,758 INFO L168 Benchmark]: RCFGBuilder took 387.89 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 314.3 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:32:57,758 INFO L168 Benchmark]: TraceAbstraction took 200534.96 ms. Allocated memory was 402.7 MB in the beginning and 782.8 MB in the end (delta: 380.1 MB). Free memory was 314.3 MB in the beginning and 463.6 MB in the end (delta: -149.3 MB). Peak memory consumption was 346.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:32:57,759 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.03 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.48 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 387.89 ms. Allocated memory is still 402.7 MB. Free memory was 346.1 MB in the beginning and 314.3 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 200534.96 ms. Allocated memory was 402.7 MB in the beginning and 782.8 MB in the end (delta: 380.1 MB). Free memory was 314.3 MB in the beginning and 463.6 MB in the end (delta: -149.3 MB). Peak memory consumption was 346.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 557. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 200.4s OverallTime, 49 OverallIterations, 3 TraceHistogramMax, 129.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3711 SDtfs, 14720 SDslu, 20898 SDs, 0 SdLazy, 18639 SolverSat, 1882 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 89.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2604 GetRequests, 1549 SyntacticMatches, 67 SemanticMatches, 988 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10059 ImplicationChecksByTransitivity, 46.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=48, 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, 48 MinimizatonAttempts, 2750 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 3092 NumberOfCodeBlocks, 3092 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3029 ConstructedInterpolants, 275 QuantifiedInterpolants, 3462704 SizeOfPredicates, 291 NumberOfNonLiveVariables, 7832 ConjunctsInSsa, 743 ConjunctsInUnsatCore, 63 InterpolantComputations, 24 PerfectInterpolantSequences, 411/977 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-32-57-765.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-32-57-765.csv Completed graceful shutdown