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-ccafca9-m [2018-02-04 00:13:59,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:13:59,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:13:59,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:13:59,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:13:59,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:13:59,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:13:59,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:13:59,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:13:59,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:13:59,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:13:59,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:13:59,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:13:59,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:13:59,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:13:59,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:13:59,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:13:59,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:13:59,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:13:59,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:13:59,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:13:59,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:13:59,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:13:59,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:13:59,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:13:59,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:13:59,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:13:59,141 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:13:59,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:13:59,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:13:59,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:13:59,142 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 00:13:59,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:13:59,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:13:59,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:13:59,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:13:59,152 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:13:59,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:13:59,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:13:59,152 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:13:59,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:13:59,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:13:59,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:13:59,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:13:59,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:13:59,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:13:59,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:13:59,193 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:13:59,196 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:13:59,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:13:59,197 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:13:59,198 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 00:13:59,345 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:13:59,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:13:59,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:13:59,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:13:59,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:13:59,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59, skipping insertion in model container [2018-02-04 00:13:59,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,364 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:13:59,390 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:13:59,479 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:13:59,495 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:13:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59 WrapperNode [2018-02-04 00:13:59,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:13:59,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:13:59,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:13:59,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:13:59,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (1/1) ... [2018-02-04 00:13:59,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:13:59,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:13:59,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:13:59,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:13:59,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (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 00:13:59,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:13:59,566 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:13:59,566 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:13:59,566 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:13:59,566 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:13:59,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:13:59,877 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:13:59,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:13:59 BoogieIcfgContainer [2018-02-04 00:13:59,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:13:59,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:13:59,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:13:59,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:13:59,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:13:59" (1/3) ... [2018-02-04 00:13:59,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d83ce79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:13:59, skipping insertion in model container [2018-02-04 00:13:59,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:13:59" (2/3) ... [2018-02-04 00:13:59,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d83ce79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:13:59, skipping insertion in model container [2018-02-04 00:13:59,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:13:59" (3/3) ... [2018-02-04 00:13:59,881 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-02-04 00:13:59,887 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:13:59,891 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 00:13:59,914 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:13:59,914 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:13:59,914 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:13:59,914 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:13:59,914 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:13:59,914 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:13:59,914 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:13:59,914 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:13:59,915 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:13:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-02-04 00:13:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 00:13:59,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:13:59,930 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:13:59,930 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 00:13:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-02-04 00:13:59,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:13:59,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:13:59,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:13:59,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:13:59,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:13:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:13:59,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,012 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 00:14:00,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:14:00,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 00:14:00,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 00:14:00,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 00:14:00,025 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-02-04 00:14:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,040 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-04 00:14:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 00:14:00,041 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 00:14:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,048 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:14:00,048 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 00:14:00,050 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 00:14:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 00:14:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 00:14:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 00:14:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-02-04 00:14:00,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-02-04 00:14:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,132 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-02-04 00:14:00,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 00:14:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-02-04 00:14:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 00:14:00,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:14:00,132 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 00:14:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-02-04 00:14:00,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,134 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,134 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,196 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 00:14:00,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:00,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:14:00,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:14:00,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:14:00,198 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-02-04 00:14:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,236 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 00:14:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:14:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 00:14:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,238 INFO L225 Difference]: With dead ends: 107 [2018-02-04 00:14:00,238 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 00:14:00,238 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 00:14:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 00:14:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-02-04 00:14:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 00:14:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-04 00:14:00,245 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-02-04 00:14:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,245 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-04 00:14:00,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:14:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-04 00:14:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:14:00,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,246 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:14:00,246 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 00:14:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-02-04 00:14:00,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,248 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,282 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 00:14:00,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:00,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:00,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:00,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:00,283 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-02-04 00:14:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,416 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-02-04 00:14:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:14:00,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 00:14:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,418 INFO L225 Difference]: With dead ends: 127 [2018-02-04 00:14:00,418 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 00:14:00,418 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 00:14:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 00:14:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 00:14:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:14:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 00:14:00,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-02-04 00:14:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,425 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 00:14:00,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 00:14:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:14:00,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:14:00,426 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 00:14:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-02-04 00:14:00,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,485 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 00:14:00,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:00,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:00,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:00,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:00,486 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-02-04 00:14:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,605 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-02-04 00:14:00,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:14:00,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 00:14:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,606 INFO L225 Difference]: With dead ends: 138 [2018-02-04 00:14:00,607 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 00:14:00,607 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 00:14:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 00:14:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-02-04 00:14:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 00:14:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-04 00:14:00,612 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-02-04 00:14:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,612 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-04 00:14:00,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-04 00:14:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:14:00,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:14:00,613 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 00:14:00,613 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-02-04 00:14:00,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,637 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 00:14:00,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:14:00,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:14:00,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:14:00,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:14:00,638 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-02-04 00:14:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,677 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 00:14:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:14:00,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 00:14:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,678 INFO L225 Difference]: With dead ends: 102 [2018-02-04 00:14:00,679 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 00:14:00,679 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 00:14:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 00:14:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-02-04 00:14:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 00:14:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-02-04 00:14:00,683 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-02-04 00:14:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,683 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-02-04 00:14:00,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:14:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-02-04 00:14:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:14:00,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,684 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 00:14:00,684 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 00:14:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-02-04 00:14:00,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,747 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 00:14:00,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:00,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:14:00,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:14:00,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:14:00,748 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-02-04 00:14:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,758 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-02-04 00:14:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:14:00,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 00:14:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,760 INFO L225 Difference]: With dead ends: 143 [2018-02-04 00:14:00,760 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 00:14:00,760 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 00:14:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 00:14:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-02-04 00:14:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 00:14:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-02-04 00:14:00,766 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-02-04 00:14:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:00,766 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-02-04 00:14:00,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:14:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-02-04 00:14:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 00:14:00,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:00,767 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 00:14:00,767 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 00:14:00,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-02-04 00:14:00,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:00,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:00,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:00,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:00,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:00,867 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 00:14:00,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:00,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:14:00,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:14:00,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:14:00,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:14:00,868 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-02-04 00:14:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:00,995 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2018-02-04 00:14:00,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:14:00,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 00:14:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:00,997 INFO L225 Difference]: With dead ends: 225 [2018-02-04 00:14:00,997 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 00:14:00,997 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 00:14:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 00:14:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-02-04 00:14:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 00:14:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-04 00:14:01,001 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-02-04 00:14:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:01,001 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-04 00:14:01,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:14:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-04 00:14:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:14:01,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:01,002 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 00:14:01,002 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 00:14:01,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-02-04 00:14:01,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:01,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:01,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:01,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:01,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:01,052 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 00:14:01,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:01,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:01,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:01,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:01,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:01,053 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-02-04 00:14:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:01,164 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-02-04 00:14:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:14:01,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 00:14:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:01,166 INFO L225 Difference]: With dead ends: 171 [2018-02-04 00:14:01,166 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 00:14:01,166 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 00:14:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 00:14:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-02-04 00:14:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 00:14:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-02-04 00:14:01,170 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-02-04 00:14:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:01,170 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-02-04 00:14:01,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-02-04 00:14:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:14:01,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:01,171 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 00:14:01,171 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 00:14:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-02-04 00:14:01,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:01,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:01,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,172 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:01,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:01,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:01,242 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 00:14:01,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:01,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:01,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:01,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:01,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:01,243 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-02-04 00:14:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:01,300 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-02-04 00:14:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:14:01,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 00:14:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:01,301 INFO L225 Difference]: With dead ends: 159 [2018-02-04 00:14:01,301 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 00:14:01,301 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 00:14:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 00:14:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-02-04 00:14:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 00:14:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-02-04 00:14:01,303 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-02-04 00:14:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:01,304 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-02-04 00:14:01,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-02-04 00:14:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:14:01,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:01,305 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 00:14:01,305 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 00:14:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-02-04 00:14:01,305 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:01,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:01,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,306 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:01,306 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:01,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:01,354 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 00:14:01,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:01,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:14:01,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:14:01,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:14:01,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:14:01,354 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-02-04 00:14:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:01,482 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-02-04 00:14:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:14:01,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 00:14:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:01,483 INFO L225 Difference]: With dead ends: 185 [2018-02-04 00:14:01,483 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 00:14:01,483 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 00:14:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 00:14:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-02-04 00:14:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 00:14:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-02-04 00:14:01,487 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-02-04 00:14:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:01,487 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-02-04 00:14:01,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:14:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-02-04 00:14:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:14:01,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:01,488 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 00:14:01,488 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 00:14:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-02-04 00:14:01,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:01,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:01,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:01,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:01,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:01,743 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-02-04 00:14:01,927 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 00:14:01,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:01,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:14:01,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:14:01,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:14:01,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:14:01,928 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 11 states. [2018-02-04 00:14:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:02,376 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2018-02-04 00:14:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:14:02,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 00:14:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:02,377 INFO L225 Difference]: With dead ends: 234 [2018-02-04 00:14:02,377 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 00:14:02,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:14:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 00:14:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-02-04 00:14:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 00:14:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-02-04 00:14:02,379 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-02-04 00:14:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:02,379 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-02-04 00:14:02,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:14:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-02-04 00:14:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:14:02,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:02,380 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 00:14:02,382 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 00:14:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-02-04 00:14:02,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:02,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:02,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:02,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:02,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:02,410 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 00:14:02,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:02,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:02,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:02,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:02,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:02,411 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-02-04 00:14:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:02,483 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-02-04 00:14:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:02,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-04 00:14:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:02,485 INFO L225 Difference]: With dead ends: 160 [2018-02-04 00:14:02,485 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 00:14:02,485 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 00:14:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 00:14:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-02-04 00:14:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 00:14:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-02-04 00:14:02,488 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-02-04 00:14:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:02,488 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-02-04 00:14:02,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-02-04 00:14:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:14:02,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:02,489 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 00:14:02,489 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 00:14:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-02-04 00:14:02,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:02,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:02,490 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:02,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:02,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:02,529 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 00:14:02,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:02,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:14:02,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:14:02,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:14:02,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:14:02,530 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-02-04 00:14:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:02,662 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-02-04 00:14:02,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:02,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 00:14:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:02,663 INFO L225 Difference]: With dead ends: 212 [2018-02-04 00:14:02,664 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 00:14:02,664 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 00:14:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 00:14:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-02-04 00:14:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 00:14:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-02-04 00:14:02,668 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-02-04 00:14:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:02,668 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-02-04 00:14:02,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:14:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-02-04 00:14:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:14:02,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:02,669 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 00:14:02,669 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 00:14:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-02-04 00:14:02,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:02,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:02,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:02,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:02,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:02,712 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 00:14:02,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:02,713 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 00:14:02,731 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:02,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:02,810 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 00:14:02,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:02,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-02-04 00:14:02,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:14:02,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:14:02,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:14:02,845 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 5 states. [2018-02-04 00:14:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:02,885 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 00:14:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:02,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 00:14:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:02,886 INFO L225 Difference]: With dead ends: 162 [2018-02-04 00:14:02,886 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 00:14:02,887 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 00:14:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 00:14:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-04 00:14:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 00:14:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-02-04 00:14:02,890 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-02-04 00:14:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:02,891 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-02-04 00:14:02,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:14:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-02-04 00:14:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:14:02,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:02,891 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 00:14:02,891 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 00:14:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-02-04 00:14:02,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:02,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:02,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,893 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:02,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:02,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:02,921 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 00:14:02,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:02,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:02,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:02,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:02,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:02,922 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-02-04 00:14:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:03,003 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-04 00:14:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:03,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 00:14:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:03,006 INFO L225 Difference]: With dead ends: 176 [2018-02-04 00:14:03,006 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 00:14:03,007 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 00:14:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 00:14:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-02-04 00:14:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 00:14:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-02-04 00:14:03,010 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-02-04 00:14:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:03,010 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-02-04 00:14:03,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-02-04 00:14:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:14:03,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:03,011 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 00:14:03,011 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 00:14:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-02-04 00:14:03,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:03,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:03,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:03,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:03,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:03,117 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 00:14:03,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:03,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:14:03,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:14:03,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:14:03,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:14:03,118 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-02-04 00:14:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:03,355 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2018-02-04 00:14:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:14:03,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 00:14:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:03,357 INFO L225 Difference]: With dead ends: 250 [2018-02-04 00:14:03,357 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 00:14:03,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:14:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 00:14:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-02-04 00:14:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 00:14:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-02-04 00:14:03,361 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-02-04 00:14:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:03,361 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-02-04 00:14:03,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:14:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-02-04 00:14:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:14:03,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:03,362 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 00:14:03,362 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 00:14:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-02-04 00:14:03,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:03,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:03,363 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,363 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:03,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:03,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:03,445 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 00:14:03,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:03,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:14:03,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:14:03,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:14:03,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:14:03,447 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 8 states. [2018-02-04 00:14:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:03,679 INFO L93 Difference]: Finished difference Result 268 states and 332 transitions. [2018-02-04 00:14:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:14:03,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 00:14:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:03,681 INFO L225 Difference]: With dead ends: 268 [2018-02-04 00:14:03,681 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 00:14:03,681 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 00:14:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 00:14:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 199. [2018-02-04 00:14:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 00:14:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2018-02-04 00:14:03,685 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2018-02-04 00:14:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:03,686 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2018-02-04 00:14:03,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:14:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2018-02-04 00:14:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:14:03,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:03,687 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 00:14:03,687 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 00:14:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash -521175963, now seen corresponding path program 1 times [2018-02-04 00:14:03,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:03,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:03,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:03,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:03,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:03,771 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 00:14:03,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:03,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:14:03,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:14:03,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:14:03,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:14:03,772 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand 7 states. [2018-02-04 00:14:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:03,913 INFO L93 Difference]: Finished difference Result 257 states and 318 transitions. [2018-02-04 00:14:03,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:14:03,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 00:14:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:03,914 INFO L225 Difference]: With dead ends: 257 [2018-02-04 00:14:03,914 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 00:14:03,914 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 00:14:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 00:14:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-02-04 00:14:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 00:14:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-02-04 00:14:03,916 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-02-04 00:14:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:03,917 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-02-04 00:14:03,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:14:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-02-04 00:14:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:14:03,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:03,918 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 00:14:03,918 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 00:14:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-02-04 00:14:03,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:03,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:03,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:03,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:03,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:03,946 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 00:14:03,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:03,947 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 00:14:03,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:03,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:03,977 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 00:14:03,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:03,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-02-04 00:14:03,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:14:03,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:14:03,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:14:03,997 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-02-04 00:14:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:04,029 INFO L93 Difference]: Finished difference Result 253 states and 312 transitions. [2018-02-04 00:14:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:04,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 00:14:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:04,030 INFO L225 Difference]: With dead ends: 253 [2018-02-04 00:14:04,030 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 00:14:04,031 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 00:14:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 00:14:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-02-04 00:14:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 00:14:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-02-04 00:14:04,036 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-02-04 00:14:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:04,036 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-02-04 00:14:04,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:14:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-02-04 00:14:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:14:04,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:04,037 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 00:14:04,037 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 00:14:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-02-04 00:14:04,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:04,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:04,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:04,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:04,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:04,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:04,133 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 00:14:04,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:04,133 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 00:14:04,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:04,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:04,281 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 00:14:04,295 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 00:14:04,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:04,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-02-04 00:14:04,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:14:04,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:14:04,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-02-04 00:14:04,329 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 14 states. [2018-02-04 00:14:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:04,772 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2018-02-04 00:14:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:14:04,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 00:14:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:04,774 INFO L225 Difference]: With dead ends: 243 [2018-02-04 00:14:04,774 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 00:14:04,774 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 00:14:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 00:14:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-02-04 00:14:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 00:14:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-02-04 00:14:04,778 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-02-04 00:14:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:04,778 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-02-04 00:14:04,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:14:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-02-04 00:14:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 00:14:04,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:04,779 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 00:14:04,779 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 00:14:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-02-04 00:14:04,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:04,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:04,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:04,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:04,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:04,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:04,841 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 00:14:04,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:04,841 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 00:14:04,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:04,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:04,898 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 00:14:04,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:04,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:04,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 00:14:04,925 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 00:14:04,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:04,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-02-04 00:14:04,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:14:04,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:14:04,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:14:04,953 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 8 states. [2018-02-04 00:14:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:05,104 INFO L93 Difference]: Finished difference Result 263 states and 327 transitions. [2018-02-04 00:14:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:05,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-04 00:14:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:05,105 INFO L225 Difference]: With dead ends: 263 [2018-02-04 00:14:05,105 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 00:14:05,106 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 00:14:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 00:14:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 228. [2018-02-04 00:14:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 00:14:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-02-04 00:14:05,110 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-02-04 00:14:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:05,110 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-02-04 00:14:05,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:14:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-02-04 00:14:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 00:14:05,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:05,112 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 00:14:05,112 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 00:14:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-02-04 00:14:05,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:05,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:05,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:05,113 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:05,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:05,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:05,217 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 00:14:05,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:05,217 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 00:14:05,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:05,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:05,258 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 00:14:05,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:14:05,295 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 00:14:05,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-02-04 00:14:05,327 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 00:14:05,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:05,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-04 00:14:05,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:14:05,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:14:05,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:14:05,345 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 12 states. [2018-02-04 00:14:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:05,596 INFO L93 Difference]: Finished difference Result 317 states and 402 transitions. [2018-02-04 00:14:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:14:05,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 00:14:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:05,597 INFO L225 Difference]: With dead ends: 317 [2018-02-04 00:14:05,597 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 00:14:05,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:14:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 00:14:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-02-04 00:14:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 00:14:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-02-04 00:14:05,602 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-02-04 00:14:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:05,602 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-02-04 00:14:05,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:14:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-02-04 00:14:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:14:05,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:05,603 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 00:14:05,603 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 00:14:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-02-04 00:14:05,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:05,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:05,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:05,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:05,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:05,614 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:05,614 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:05,614 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 00:14:05,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:05,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:05,656 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 00:14:05,660 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 00:14:05,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,663 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 00:14:05,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:14:05,668 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 00:14:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 00:14:05,712 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 00:14:05,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 26 treesize of output 25 [2018-02-04 00:14:05,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,740 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 00:14:05,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-04 00:14:05,764 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 00:14:05,767 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 00:14:05,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,783 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 00:14:05,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,813 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 00:14:05,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:05,819 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 00:14:05,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-02-04 00:14:05,828 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 00:14:05,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:05,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 00:14:05,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:14:05,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:14:05,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:14:05,859 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand 9 states. [2018-02-04 00:14:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:06,005 INFO L93 Difference]: Finished difference Result 248 states and 321 transitions. [2018-02-04 00:14:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:14:06,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-02-04 00:14:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:06,005 INFO L225 Difference]: With dead ends: 248 [2018-02-04 00:14:06,006 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 00:14:06,006 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 00:14:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 00:14:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2018-02-04 00:14:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 00:14:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-02-04 00:14:06,010 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 48 [2018-02-04 00:14:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:06,010 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-02-04 00:14:06,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:14:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-02-04 00:14:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:14:06,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:06,011 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 00:14:06,011 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 00:14:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623146, now seen corresponding path program 1 times [2018-02-04 00:14:06,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:06,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:06,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,012 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:06,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,020 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:06,020 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:06,020 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 00:14:06,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:06,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:06,073 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 00:14:06,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:14:06,099 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 00:14:06,102 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 00:14:06,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,113 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 00:14:06,115 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 00:14:06,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,124 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 00:14:06,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-02-04 00:14:06,136 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 00:14:06,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-02-04 00:14:06,192 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 00:14:06,197 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 00:14:06,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,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, 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 00:14:06,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-04 00:14:06,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,267 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 00:14:06,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-02-04 00:14:06,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:06,299 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 00:14:06,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,308 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 00:14:06,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,316 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 00:14:06,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,328 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 00:14:06,330 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 00:14:06,330 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,340 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 00:14:06,340 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-02-04 00:14:06,352 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 00:14:06,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:06,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 00:14:06,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:14:06,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:14:06,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:14:06,370 INFO L87 Difference]: Start difference. First operand 226 states and 294 transitions. Second operand 11 states. [2018-02-04 00:14:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:06,669 INFO L93 Difference]: Finished difference Result 316 states and 407 transitions. [2018-02-04 00:14:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:14:06,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 00:14:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:06,670 INFO L225 Difference]: With dead ends: 316 [2018-02-04 00:14:06,670 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 00:14:06,670 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 00:14:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 00:14:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 209. [2018-02-04 00:14:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 00:14:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2018-02-04 00:14:06,672 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 48 [2018-02-04 00:14:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:06,673 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2018-02-04 00:14:06,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:14:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2018-02-04 00:14:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:14:06,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:06,673 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 00:14:06,673 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 00:14:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1869223904, now seen corresponding path program 1 times [2018-02-04 00:14:06,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:06,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:06,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:06,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,679 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:06,679 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:06,679 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 00:14:06,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:06,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:06,720 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 00:14:06,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,727 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 00:14:06,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:06,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 00:14:06,796 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 00:14:06,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:06,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 00:14:06,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:14:06,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:14:06,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:14:06,829 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand 6 states. [2018-02-04 00:14:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:06,964 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2018-02-04 00:14:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:14:06,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-04 00:14:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:06,965 INFO L225 Difference]: With dead ends: 308 [2018-02-04 00:14:06,965 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 00:14:06,965 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 00:14:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 00:14:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2018-02-04 00:14:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 00:14:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2018-02-04 00:14:06,968 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 49 [2018-02-04 00:14:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:06,968 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2018-02-04 00:14:06,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:14:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2018-02-04 00:14:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:14:06,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:06,968 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 00:14:06,968 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 00:14:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1027839999, now seen corresponding path program 1 times [2018-02-04 00:14:06,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:06,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:06,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:06,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:06,974 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:06,975 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:06,975 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 00:14:06,981 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:07,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:07,031 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 00:14:07,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:07,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:14:07,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:14:07,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:14:07,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:14:07,049 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand 6 states. [2018-02-04 00:14:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:07,112 INFO L93 Difference]: Finished difference Result 248 states and 323 transitions. [2018-02-04 00:14:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:14:07,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-02-04 00:14:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:07,113 INFO L225 Difference]: With dead ends: 248 [2018-02-04 00:14:07,113 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 00:14:07,113 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 00:14:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 00:14:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2018-02-04 00:14:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 00:14:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2018-02-04 00:14:07,116 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 51 [2018-02-04 00:14:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:07,116 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2018-02-04 00:14:07,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:14:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2018-02-04 00:14:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:14:07,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:07,116 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 00:14:07,116 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 00:14:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560870, now seen corresponding path program 1 times [2018-02-04 00:14:07,117 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:07,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:07,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,122 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:07,122 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:07,122 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 00:14:07,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:07,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:07,174 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 00:14:07,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:07,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:14:07,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:14:07,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:14:07,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:14:07,191 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand 7 states. [2018-02-04 00:14:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:07,250 INFO L93 Difference]: Finished difference Result 242 states and 314 transitions. [2018-02-04 00:14:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:14:07,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-02-04 00:14:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:07,251 INFO L225 Difference]: With dead ends: 242 [2018-02-04 00:14:07,251 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 00:14:07,252 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 00:14:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 00:14:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2018-02-04 00:14:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 00:14:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2018-02-04 00:14:07,255 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 55 [2018-02-04 00:14:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:07,256 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2018-02-04 00:14:07,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:14:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2018-02-04 00:14:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:14:07,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:07,256 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 00:14:07,257 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 00:14:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560827, now seen corresponding path program 1 times [2018-02-04 00:14:07,257 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:07,257 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:07,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,258 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,258 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,265 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:07,265 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:07,265 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 00:14:07,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:07,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:07,324 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 00:14:07,325 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 00:14:07,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,330 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 00:14:07,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:14:07,345 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 00:14:07,346 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 00:14:07,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,348 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 00:14:07,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 00:14:07,357 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 00:14:07,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:07,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:14:07,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:14:07,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:14:07,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:14:07,376 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand 8 states. [2018-02-04 00:14:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:07,509 INFO L93 Difference]: Finished difference Result 259 states and 326 transitions. [2018-02-04 00:14:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:14:07,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-02-04 00:14:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:07,510 INFO L225 Difference]: With dead ends: 259 [2018-02-04 00:14:07,510 INFO L226 Difference]: Without dead ends: 259 [2018-02-04 00:14:07,511 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 00:14:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-04 00:14:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 225. [2018-02-04 00:14:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 00:14:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2018-02-04 00:14:07,513 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 55 [2018-02-04 00:14:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:07,513 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2018-02-04 00:14:07,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:14:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2018-02-04 00:14:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 00:14:07,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:07,514 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 00:14:07,514 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 00:14:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1099560826, now seen corresponding path program 1 times [2018-02-04 00:14:07,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:07,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:07,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:07,523 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:07,523 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:07,523 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 00:14:07,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:07,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:07,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:14:07,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:14:07,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,627 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 00:14:07,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 8 treesize of output 7 [2018-02-04 00:14:07,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,637 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 00:14:07,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-02-04 00:14:07,689 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 00:14:07,690 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 00:14:07,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,698 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 00:14:07,699 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 00:14:07,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:07,706 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 00:14:07,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 00:14:07,726 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 00:14:07,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:07,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 00:14:07,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:14:07,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:14:07,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:14:07,744 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand 14 states. [2018-02-04 00:14:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:08,188 INFO L93 Difference]: Finished difference Result 384 states and 495 transitions. [2018-02-04 00:14:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:14:08,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 00:14:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:08,189 INFO L225 Difference]: With dead ends: 384 [2018-02-04 00:14:08,189 INFO L226 Difference]: Without dead ends: 384 [2018-02-04 00:14:08,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:14:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-04 00:14:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2018-02-04 00:14:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 00:14:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2018-02-04 00:14:08,192 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 55 [2018-02-04 00:14:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:08,192 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2018-02-04 00:14:08,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:14:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2018-02-04 00:14:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 00:14:08,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:08,193 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 00:14:08,193 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 00:14:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash -115996377, now seen corresponding path program 1 times [2018-02-04 00:14:08,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:08,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:08,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:08,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:08,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:08,198 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:08,198 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:08,199 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 00:14:08,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:08,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:08,277 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 00:14:08,278 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 00:14:08,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,287 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 00:14:08,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:14:08,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,296 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 00:14:08,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-02-04 00:14:08,329 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 00:14:08,331 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 00:14:08,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,338 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 00:14:08,340 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 00:14:08,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:08,349 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 00:14:08,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 00:14:08,387 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 00:14:08,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:08,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 00:14:08,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:14:08,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:14:08,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:14:08,405 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand 16 states. [2018-02-04 00:14:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:09,069 INFO L93 Difference]: Finished difference Result 435 states and 556 transitions. [2018-02-04 00:14:09,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:14:09,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-02-04 00:14:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:09,070 INFO L225 Difference]: With dead ends: 435 [2018-02-04 00:14:09,070 INFO L226 Difference]: Without dead ends: 435 [2018-02-04 00:14:09,071 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 00:14:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-04 00:14:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 233. [2018-02-04 00:14:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 00:14:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2018-02-04 00:14:09,073 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 57 [2018-02-04 00:14:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:09,073 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2018-02-04 00:14:09,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:14:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2018-02-04 00:14:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 00:14:09,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:09,074 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 00:14:09,074 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 00:14:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -115996378, now seen corresponding path program 1 times [2018-02-04 00:14:09,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:09,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:09,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:09,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,079 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:09,079 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:09,079 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 00:14:09,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:09,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:09,128 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 00:14:09,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:14:09,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:14:09,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:14:09,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:14:09,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:14:09,164 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand 4 states. [2018-02-04 00:14:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:09,215 INFO L93 Difference]: Finished difference Result 249 states and 319 transitions. [2018-02-04 00:14:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:09,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-02-04 00:14:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:09,216 INFO L225 Difference]: With dead ends: 249 [2018-02-04 00:14:09,216 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 00:14:09,216 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 00:14:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 00:14:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2018-02-04 00:14:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 00:14:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2018-02-04 00:14:09,218 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 57 [2018-02-04 00:14:09,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:09,219 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2018-02-04 00:14:09,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:14:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2018-02-04 00:14:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 00:14:09,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:09,219 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 00:14:09,220 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 00:14:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash 156065119, now seen corresponding path program 1 times [2018-02-04 00:14:09,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:09,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:09,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,221 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:09,221 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,227 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:09,227 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:09,227 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:14:09,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:09,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:09,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:09,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:09,281 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 00:14:09,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:09,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:09,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 00:14:09,298 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 00:14:09,299 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 00:14:09,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:09,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:09,304 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 00:14:09,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-02-04 00:14:09,334 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 00:14:09,338 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 00:14:09,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:09,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:09,344 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 00:14:09,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-02-04 00:14:09,377 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 00:14:09,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:09,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 00:14:09,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:14:09,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:14:09,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:14:09,395 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand 14 states. [2018-02-04 00:14:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:09,952 INFO L93 Difference]: Finished difference Result 400 states and 488 transitions. [2018-02-04 00:14:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:14:09,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-02-04 00:14:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:09,953 INFO L225 Difference]: With dead ends: 400 [2018-02-04 00:14:09,953 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 00:14:09,953 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 00:14:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 00:14:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 231. [2018-02-04 00:14:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 00:14:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 291 transitions. [2018-02-04 00:14:09,957 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 291 transitions. Word has length 59 [2018-02-04 00:14:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:09,957 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 291 transitions. [2018-02-04 00:14:09,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:14:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 291 transitions. [2018-02-04 00:14:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:14:09,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:09,957 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 00:14:09,957 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 00:14:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 740017122, now seen corresponding path program 2 times [2018-02-04 00:14:09,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:09,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:09,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:09,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:09,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:09,982 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 00:14:09,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:09,983 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 00:14:09,988 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:14:10,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:14:10,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:14:10,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:10,043 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 00:14:10,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:10,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-02-04 00:14:10,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:14:10,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:14:10,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:14:10,075 INFO L87 Difference]: Start difference. First operand 231 states and 291 transitions. Second operand 8 states. [2018-02-04 00:14:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:10,154 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-02-04 00:14:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:14:10,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-04 00:14:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:10,155 INFO L225 Difference]: With dead ends: 203 [2018-02-04 00:14:10,155 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 00:14:10,155 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 00:14:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 00:14:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 196. [2018-02-04 00:14:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 00:14:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2018-02-04 00:14:10,156 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 60 [2018-02-04 00:14:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:10,157 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2018-02-04 00:14:10,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:14:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2018-02-04 00:14:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:14:10,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:10,157 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 00:14:10,157 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 00:14:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 257738368, now seen corresponding path program 1 times [2018-02-04 00:14:10,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:10,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:10,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:10,158 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:14:10,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:10,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:10,471 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 00:14:10,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:10,472 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 00:14:10,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:10,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:10,535 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 00:14:10,545 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 00:14:10,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 00:14:10,567 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 00:14:10,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,569 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 00:14:10,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 00:14:10,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 36 treesize of output 29 [2018-02-04 00:14:10,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,602 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 00:14:10,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2018-02-04 00:14:10,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,640 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 00:14:10,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2018-02-04 00:14:10,689 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 00:14:10,690 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 00:14:10,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-04 00:14:10,734 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 00:14:10,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,736 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 00:14:10,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-02-04 00:14:10,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:10,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:10,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2018-02-04 00:14:10,827 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 00:14:10,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,834 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 00:14:10,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2018-02-04 00:14:10,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-02-04 00:14:10,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,911 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 00:14:10,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:67 [2018-02-04 00:14:10,943 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 00:14:10,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:10,947 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 00:14:10,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:10,975 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 00:14:10,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:81 [2018-02-04 00:14:11,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 84 [2018-02-04 00:14:11,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,027 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 00:14:11,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:11,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:11,056 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 00:14:11,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:117 [2018-02-04 00:14:11,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,137 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 00:14:11,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,227 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 00:14:11,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:11,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:11,238 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 00:14:11,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:11,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:11,247 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 00:14:11,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:124, output treesize:5 [2018-02-04 00:14:11,293 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 00:14:11,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:11,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 31 [2018-02-04 00:14:11,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 00:14:11,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 00:14:11,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2018-02-04 00:14:11,311 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand 31 states. [2018-02-04 00:14:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:13,039 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2018-02-04 00:14:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 00:14:13,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-02-04 00:14:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:13,040 INFO L225 Difference]: With dead ends: 293 [2018-02-04 00:14:13,040 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 00:14:13,041 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 00:14:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 00:14:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 226. [2018-02-04 00:14:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 00:14:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2018-02-04 00:14:13,043 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 60 [2018-02-04 00:14:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:13,043 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2018-02-04 00:14:13,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 00:14:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2018-02-04 00:14:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:14:13,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:13,044 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 00:14:13,044 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 00:14:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash -12975118, now seen corresponding path program 1 times [2018-02-04 00:14:13,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:13,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:13,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:13,045 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:13,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:13,052 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:13,052 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:13,052 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 00:14:13,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:13,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:13,092 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 00:14:13,093 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 00:14:13,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 00:14:13,104 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 00:14:13,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,106 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 00:14:13,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 00:14:13,122 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 00:14:13,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,127 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 00:14:13,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-02-04 00:14:13,175 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 00:14:13,177 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 00:14:13,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 00:14:13,234 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:13,246 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 00:14:13,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,260 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 00:14:13,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 00:14:13,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:14:13,331 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 00:14:13,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:149 [2018-02-04 00:14:13,385 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 00:14:13,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,388 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 00:14:13,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:13,479 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 00:14:13,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:14:13,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:13,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,547 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 00:14:13,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,593 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 00:14:13,593 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:188, output treesize:176 [2018-02-04 00:14:13,648 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 00:14:13,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,653 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 00:14:13,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,743 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 00:14:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,759 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 00:14:13,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,796 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:13,803 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 00:14:13,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:13,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:13,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,902 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 00:14:13,902 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,938 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,970 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 00:14:13,970 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:233, output treesize:176 [2018-02-04 00:14:13,979 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 00:14:13,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:13,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, 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 00:14:13,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:13,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,032 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 00:14:14,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,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, 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 00:14:14,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,089 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 00:14:14,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:14:14,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,107 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 00:14:14,112 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 00:14:14,112 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,139 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 00:14:14,140 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:287, output treesize:155 [2018-02-04 00:14:14,232 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 00:14:14,234 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 00:14:14,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,267 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 00:14:14,268 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 00:14:14,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:14,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:133 [2018-02-04 00:14:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 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 00:14:14,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,443 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 00:14:14,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,455 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 00:14:14,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,477 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 00:14:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,483 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 00:14:14,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:14,491 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 00:14:14,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:14,506 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 00:14:14,506 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:157, output treesize:5 [2018-02-04 00:14:14,543 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 00:14:14,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:14,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 00:14:14,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:14:14,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:14:14,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:14:14,560 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand 21 states. [2018-02-04 00:14:15,427 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-02-04 00:14:15,705 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 132 DAG size of output 105 [2018-02-04 00:14:15,888 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 137 DAG size of output 110 [2018-02-04 00:14:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:16,132 INFO L93 Difference]: Finished difference Result 381 states and 470 transitions. [2018-02-04 00:14:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:14:16,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-04 00:14:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:16,133 INFO L225 Difference]: With dead ends: 381 [2018-02-04 00:14:16,133 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 00:14:16,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 00:14:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 00:14:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 264. [2018-02-04 00:14:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 00:14:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 325 transitions. [2018-02-04 00:14:16,158 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 325 transitions. Word has length 61 [2018-02-04 00:14:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:16,158 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 325 transitions. [2018-02-04 00:14:16,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:14:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 325 transitions. [2018-02-04 00:14:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:14:16,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:16,159 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 00:14:16,159 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 00:14:16,159 INFO L82 PathProgramCache]: Analyzing trace with hash -12975117, now seen corresponding path program 1 times [2018-02-04 00:14:16,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:16,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:16,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:16,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:16,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:16,164 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:16,164 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:16,164 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 00:14:16,170 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:16,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:16,222 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 00:14:16,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:14:16,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,230 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 00:14:16,232 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 00:14:16,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 00:14:16,246 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 00:14:16,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,256 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 00:14:16,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,268 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 00:14:16,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,269 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 00:14:16,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 00:14:16,287 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 00:14:16,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,291 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 00:14:16,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,305 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 00:14:16,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,309 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 00:14:16,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-02-04 00:14:16,361 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 00:14:16,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,364 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,364 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 00:14:16,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,378 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 00:14:16,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,402 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 00:14:16,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,408 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,409 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 00:14:16,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,422 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 00:14:16,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,436 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-02-04 00:14:16,474 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:14:16,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,497 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 00:14:16,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 00:14:16,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:14:16,590 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,597 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 00:14:16,599 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,599 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 00:14:16,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,621 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 00:14:16,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,625 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,625 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 00:14:16,626 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,669 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:14:16,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,680 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 00:14:16,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,728 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 00:14:16,728 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:320 [2018-02-04 00:14:16,800 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 00:14:16,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,805 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 00:14:16,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:16,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:16,977 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 00:14:16,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:16,979 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:16,979 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 00:14:16,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 103 [2018-02-04 00:14:17,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,088 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 00:14:17,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:17,212 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 00:14:17,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,214 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 00:14:17,214 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,248 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:17,322 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 00:14:17,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,325 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:17,325 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 00:14:17,325 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,358 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:17,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:14:17,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,426 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:17,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:14:17,427 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,472 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:17,528 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 00:14:17,528 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:398, output treesize:472 [2018-02-04 00:14:17,601 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 00:14:17,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,606 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 00:14:17,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,803 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 00:14:17,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,808 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:17,810 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 00:14:17,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:17,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, 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 00:14:17,973 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:17,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,975 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:17,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:17,978 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 00:14:17,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,033 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 00:14:18,033 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,159 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 00:14:18,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,166 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 00:14:18,166 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,241 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,249 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 00:14:18,250 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:18,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:18,402 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 00:14:18,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,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, 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 00:14:18,409 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,485 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,486 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,493 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 00:14:18,494 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:18,550 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:18,625 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 00:14:18,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,631 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,633 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 00:14:18,633 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,675 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,716 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 00:14:18,716 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:586, output treesize:480 [2018-02-04 00:14:18,751 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 00:14:18,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,756 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 00:14:18,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,890 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,893 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:18,900 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 00:14:18,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:18,903 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 00:14:18,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:18,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:19,025 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,030 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 00:14:19,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,032 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,033 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 00:14:19,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,125 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,126 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 00:14:19,126 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,187 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 00:14:19,293 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,294 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,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, 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 00:14:19,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,299 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 00:14:19,300 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,318 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,321 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:19,328 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 00:14:19,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,332 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 00:14:19,332 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,375 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:19,466 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 00:14:19,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,469 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 00:14:19,469 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,479 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:19,525 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 00:14:19,525 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:665, output treesize:449 [2018-02-04 00:14:19,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,938 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 00:14:19,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,948 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 00:14:19,949 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 00:14:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:19,965 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 00:14:19,965 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 00:14:19,974 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 00:14:20,002 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 00:14:20,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,004 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:20,005 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:20,005 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 00:14:20,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,021 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:20,021 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 00:14:20,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,052 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 00:14:20,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,058 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 00:14:20,058 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,065 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 00:14:20,065 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,084 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 00:14:20,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,086 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 00:14:20,086 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:20,093 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 00:14:20,093 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,097 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:20,106 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 00:14:20,106 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:323, output treesize:27 [2018-02-04 00:14:20,164 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 00:14:20,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:20,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 00:14:20,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:14:20,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:14:20,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:14:20,181 INFO L87 Difference]: Start difference. First operand 264 states and 325 transitions. Second operand 21 states. [2018-02-04 00:14:25,123 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 152 [2018-02-04 00:14:25,613 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-02-04 00:14:25,759 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 109 DAG size of output 109 [2018-02-04 00:14:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:27,836 INFO L93 Difference]: Finished difference Result 377 states and 462 transitions. [2018-02-04 00:14:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:14:27,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-04 00:14:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:27,837 INFO L225 Difference]: With dead ends: 377 [2018-02-04 00:14:27,838 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 00:14:27,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=317, Invalid=1487, Unknown=2, NotChecked=0, Total=1806 [2018-02-04 00:14:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 00:14:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 266. [2018-02-04 00:14:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 00:14:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 325 transitions. [2018-02-04 00:14:27,840 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 325 transitions. Word has length 61 [2018-02-04 00:14:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:27,840 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 325 transitions. [2018-02-04 00:14:27,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:14:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 325 transitions. [2018-02-04 00:14:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 00:14:27,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:27,840 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 00:14:27,840 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 00:14:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -406345547, now seen corresponding path program 1 times [2018-02-04 00:14:27,841 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:27,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:27,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:27,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:27,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:27,844 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:14:27,844 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:14:27,845 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 00:14:27,851 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:27,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:27,986 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 00:14:27,987 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 00:14:27,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:27,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:27,993 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 00:14:27,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-04 00:14:28,019 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 00:14:28,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, 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 00:14:28,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-02-04 00:14:28,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:28,055 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 00:14:28,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,059 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 00:14:28,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:14:28,074 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 00:14:28,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:14:28,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 00:14:28,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:14:28,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:14:28,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:14:28,091 INFO L87 Difference]: Start difference. First operand 266 states and 325 transitions. Second operand 16 states. [2018-02-04 00:14:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:28,605 INFO L93 Difference]: Finished difference Result 370 states and 452 transitions. [2018-02-04 00:14:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:14:28,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-02-04 00:14:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:28,606 INFO L225 Difference]: With dead ends: 370 [2018-02-04 00:14:28,606 INFO L226 Difference]: Without dead ends: 370 [2018-02-04 00:14:28,607 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 00:14:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-04 00:14:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-02-04 00:14:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 00:14:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 323 transitions. [2018-02-04 00:14:28,609 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 323 transitions. Word has length 62 [2018-02-04 00:14:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:28,609 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 323 transitions. [2018-02-04 00:14:28,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:14:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 323 transitions. [2018-02-04 00:14:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 00:14:28,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:28,609 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 00:14:28,609 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 00:14:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1119002561, now seen corresponding path program 1 times [2018-02-04 00:14:28,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:28,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:28,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:28,610 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:28,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:28,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:28,902 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 00:14:28,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:28,902 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 00:14:28,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:28,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:28,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:28,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:28,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:28,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:28,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-02-04 00:14:29,033 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 00:14:29,034 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 00:14:29,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 00:14:29,058 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 00:14:29,059 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 00:14:29,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,066 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 00:14:29,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-02-04 00:14:29,110 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 00:14:29,113 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 00:14:29,114 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 00:14:29,121 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 00:14:29,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,126 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 00:14:29,134 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 00:14:29,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-02-04 00:14:29,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:29,198 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 00:14:29,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:29,201 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 00:14:29,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:14:29,227 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 00:14:29,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:29,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-02-04 00:14:29,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 00:14:29,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 00:14:29,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:14:29,244 INFO L87 Difference]: Start difference. First operand 264 states and 323 transitions. Second operand 30 states. [2018-02-04 00:14:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:14:30,346 INFO L93 Difference]: Finished difference Result 350 states and 417 transitions. [2018-02-04 00:14:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:14:30,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 63 [2018-02-04 00:14:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:14:30,347 INFO L225 Difference]: With dead ends: 350 [2018-02-04 00:14:30,347 INFO L226 Difference]: Without dead ends: 350 [2018-02-04 00:14:30,348 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 00:14:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-04 00:14:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 315. [2018-02-04 00:14:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-04 00:14:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 386 transitions. [2018-02-04 00:14:30,351 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 386 transitions. Word has length 63 [2018-02-04 00:14:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:14:30,351 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 386 transitions. [2018-02-04 00:14:30,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 00:14:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 386 transitions. [2018-02-04 00:14:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 00:14:30,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:14:30,351 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 00:14:30,351 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 00:14:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1119002560, now seen corresponding path program 1 times [2018-02-04 00:14:30,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:14:30,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:14:30,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:30,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:30,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:14:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:30,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:14:30,511 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 00:14:30,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:14:30,511 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 00:14:30,516 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:14:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:14:30,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:14:30,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 13 treesize of output 10 [2018-02-04 00:14:30,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 00:14:30,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 00:14:30,573 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 00:14:30,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,575 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 00:14:30,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 00:14:30,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 30 treesize of output 23 [2018-02-04 00:14:30,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,600 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:30,600 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 00:14:30,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 00:14:30,628 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 00:14:30,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,632 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:30,633 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 00:14:30,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 00:14:30,668 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 00:14:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,674 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:30,677 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 00:14:30,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 00:14:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,756 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 00:14:30,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:60 [2018-02-04 00:14:30,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, 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 00:14:30,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:14:30,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-02-04 00:14:30,915 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 00:14:30,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,924 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 00:14:30,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:30,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2018-02-04 00:14:30,994 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 00:14:30,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:30,998 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:30,999 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 00:14:30,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:95 [2018-02-04 00:14:31,070 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 00:14:31,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,075 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,075 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 00:14:31,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:108, output treesize:110 [2018-02-04 00:14:31,145 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 00:14:31,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,153 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,156 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 00:14:31,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:129, output treesize:110 [2018-02-04 00:14:31,220 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 00:14:31,222 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 00:14:31,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,253 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,254 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 00:14:31,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,259 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,259 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 00:14:31,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:143 [2018-02-04 00:14:31,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:14:31,348 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 00:14:31,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,385 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,387 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 00:14:31,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,392 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,392 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 00:14:31,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,433 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 00:14:31,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:256, output treesize:203 [2018-02-04 00:14:31,508 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 00:14:31,515 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 00:14:31,516 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 00:14:31,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 00:14:31,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,555 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 00:14:31,582 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 00:14:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,586 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,587 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 00:14:31,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,615 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,619 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 52 treesize of output 90 [2018-02-04 00:14:31,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:31,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:31,655 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 00:14:31,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,660 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:14:31,660 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 00:14:31,660 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:14:31,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:14:31,688 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 45 treesize of output 88 [2018-02-04 00:14:31,689 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 00:14:31,710 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:14:31,735 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 00:14:31,735 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:224, output treesize:114 [2018-02-04 00:14:31,859 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 00:14:31,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:14:31,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 28 [2018-02-04 00:14:31,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 00:14:31,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 00:14:31,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-02-04 00:14:31,876 INFO L87 Difference]: Start difference. First operand 315 states and 386 transitions. Second operand 29 states. [2018-02-04 00:15:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:15:03,490 INFO L93 Difference]: Finished difference Result 452 states and 534 transitions. [2018-02-04 00:15:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 00:15:03,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-02-04 00:15:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:15:03,491 INFO L225 Difference]: With dead ends: 452 [2018-02-04 00:15:03,491 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 00:15:03,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1012, Invalid=4994, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 00:15:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 00:15:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2018-02-04 00:15:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-04 00:15:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 405 transitions. [2018-02-04 00:15:03,495 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 405 transitions. Word has length 63 [2018-02-04 00:15:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:15:03,495 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 405 transitions. [2018-02-04 00:15:03,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 00:15:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 405 transitions. [2018-02-04 00:15:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 00:15:03,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:15:03,495 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 00:15:03,495 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 00:15:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -329341478, now seen corresponding path program 1 times [2018-02-04 00:15:03,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:15:03,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:15:03,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:03,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:03,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:15:03,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:15:03,535 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 00:15:03,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:15:03,535 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 00:15:03,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:15:03,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:15:03,565 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 00:15:03,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:15:03,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 00:15:03,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:15:03,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:15:03,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:15:03,582 INFO L87 Difference]: Start difference. First operand 326 states and 405 transitions. Second operand 6 states. [2018-02-04 00:15:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:15:03,600 INFO L93 Difference]: Finished difference Result 334 states and 405 transitions. [2018-02-04 00:15:03,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:15:03,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-02-04 00:15:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:15:03,601 INFO L225 Difference]: With dead ends: 334 [2018-02-04 00:15:03,601 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 00:15:03,601 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 00:15:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 00:15:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 328. [2018-02-04 00:15:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 00:15:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2018-02-04 00:15:03,603 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 64 [2018-02-04 00:15:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:15:03,603 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2018-02-04 00:15:03,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:15:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2018-02-04 00:15:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 00:15:03,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:15:03,604 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 00:15:03,604 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 00:15:03,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1619634143, now seen corresponding path program 1 times [2018-02-04 00:15:03,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:15:03,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:15:03,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:03,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:03,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:15:03,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:15:03,902 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 00:15:03,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:15:03,902 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 00:15:03,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:15:03,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:15:03,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:15:03,985 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 00:15:03,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:03,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:03,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:03,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 00:15:04,007 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 00:15:04,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,008 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 00:15:04,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 00:15:04,035 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 00:15:04,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,038 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,039 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 00:15:04,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 00:15:04,074 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 00:15:04,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,080 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,080 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 00:15:04,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 00:15:04,124 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 00:15:04,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,131 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,134 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 00:15:04,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 00:15:04,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,198 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 00:15:04,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,210 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 00:15:04,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 00:15:04,263 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 00:15:04,265 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 00:15:04,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,285 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 00:15:04,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 00:15:04,318 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 00:15:04,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,321 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 00:15:04,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,345 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 00:15:04,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-02-04 00:15:04,383 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 00:15:04,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,386 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,387 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 00:15:04,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,441 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 00:15:04,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:88 [2018-02-04 00:15:04,511 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 00:15:04,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,517 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,518 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 00:15:04,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,565 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 00:15:04,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:103 [2018-02-04 00:15:04,631 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 00:15:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,642 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,646 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 00:15:04,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,700 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 00:15:04,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:103 [2018-02-04 00:15:04,753 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 00:15:04,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,762 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,763 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,763 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 00:15:04,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,798 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 00:15:04,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:103 [2018-02-04 00:15:04,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, 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 00:15:04,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,848 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 00:15:04,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:04,885 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 00:15:04,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:191, output treesize:181 [2018-02-04 00:15:04,969 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 00:15:04,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,974 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:15:04,977 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 00:15:04,977 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 00:15:04,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:04,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:05,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:05,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:15:05,013 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 00:15:05,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-02-04 00:15:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:15:05,049 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 00:15:05,050 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:25 [2018-02-04 00:15:05,139 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 00:15:05,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:15:05,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 33 [2018-02-04 00:15:05,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:15:05,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:15:05,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:15:05,157 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand 34 states. [2018-02-04 00:15:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:15:58,667 INFO L93 Difference]: Finished difference Result 532 states and 635 transitions. [2018-02-04 00:15:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 00:15:58,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-02-04 00:15:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:15:58,668 INFO L225 Difference]: With dead ends: 532 [2018-02-04 00:15:58,668 INFO L226 Difference]: Without dead ends: 532 [2018-02-04 00:15:58,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1509, Invalid=6681, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 00:15:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-02-04 00:15:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2018-02-04 00:15:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 00:15:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 472 transitions. [2018-02-04 00:15:58,672 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 472 transitions. Word has length 65 [2018-02-04 00:15:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:15:58,672 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 472 transitions. [2018-02-04 00:15:58,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:15:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 472 transitions. [2018-02-04 00:15:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 00:15:58,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:15:58,672 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 00:15:58,672 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 00:15:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 127654476, now seen corresponding path program 1 times [2018-02-04 00:15:58,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:15:58,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:15:58,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:58,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:58,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:15:58,677 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:15:58,677 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:15:58,677 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 00:15:58,681 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:15:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:15:58,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:15:58,751 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 00:15:58,752 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 00:15:58,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,781 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 00:15:58,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 00:15:58,799 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 00:15:58,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:15:58,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,826 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 00:15:58,828 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 00:15:58,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:15:58,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:15:58,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,851 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:15:58,861 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 00:15:58,861 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:67, output treesize:46 [2018-02-04 00:15:58,928 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 00:15:58,933 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 00:15:58,934 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 00:15:58,939 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 00:15:58,955 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 00:15:58,957 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 00:15:58,958 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 00:15:58,962 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 00:15:58,963 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 00:15:58,967 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 00:15:58,967 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 00:15:58,976 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 00:15:58,996 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 00:15:58,996 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:109 [2018-02-04 00:15:59,594 WARN L146 SmtUtils]: Spent 576ms on a formula simplification. DAG size of input: 60 DAG size of output 42 [2018-02-04 00:16:00,202 WARN L143 SmtUtils]: Spent 471ms on a formula simplification that was a NOOP. DAG size: 44 [2018-02-04 00:16:00,286 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 00:16:00,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 00:16:00,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:00,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:16:00,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 00:16:00,341 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 00:16:00,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:00,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:16:00,403 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 00:16:00,404 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 00:16:00,405 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:00,410 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:00,445 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 00:16:00,445 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:82, output treesize:40 [2018-02-04 00:16:00,609 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 00:16:00,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:16:00,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 00:16:00,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:16:00,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:16:00,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:16:00,629 INFO L87 Difference]: Start difference. First operand 376 states and 472 transitions. Second operand 21 states. [2018-02-04 00:16:03,467 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 76 DAG size of output 58 [2018-02-04 00:16:03,743 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 87 DAG size of output 68 [2018-02-04 00:16:10,571 WARN L146 SmtUtils]: Spent 6757ms on a formula simplification. DAG size of input: 97 DAG size of output 69 [2018-02-04 00:16:14,663 WARN L146 SmtUtils]: Spent 4058ms on a formula simplification. DAG size of input: 76 DAG size of output 75 [2018-02-04 00:16:16,761 WARN L146 SmtUtils]: Spent 2072ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-04 00:16:19,033 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 89 DAG size of output 41 [2018-02-04 00:16:23,207 WARN L146 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 101 DAG size of output 41 [2018-02-04 00:16:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:24,393 INFO L93 Difference]: Finished difference Result 390 states and 484 transitions. [2018-02-04 00:16:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:16:24,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 00:16:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:24,394 INFO L225 Difference]: With dead ends: 390 [2018-02-04 00:16:24,394 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 00:16:24,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=303, Invalid=1256, Unknown=1, NotChecked=0, Total=1560 [2018-02-04 00:16:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 00:16:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-02-04 00:16:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 00:16:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 471 transitions. [2018-02-04 00:16:24,397 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 471 transitions. Word has length 65 [2018-02-04 00:16:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:24,397 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 471 transitions. [2018-02-04 00:16:24,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:16:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 471 transitions. [2018-02-04 00:16:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 00:16:24,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:24,398 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 00:16:24,398 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 00:16:24,398 INFO L82 PathProgramCache]: Analyzing trace with hash -171753287, now seen corresponding path program 1 times [2018-02-04 00:16:24,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:24,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:24,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:24,398 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:24,398 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:24,402 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:16:24,402 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:16:24,402 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 00:16:24,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:24,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:24,531 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 00:16:24,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 00:16:24,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:24,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:24,542 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 00:16:24,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:49 [2018-02-04 00:16:24,601 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 00:16:24,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 00:16:24,606 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 00:16:24,616 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 00:16:24,635 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 00:16:24,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:78 [2018-02-04 00:16:25,031 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 00:16:25,047 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 00:16:25,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:16:25,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 00:16:25,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:16:25,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:16:25,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=4, NotChecked=32, Total=342 [2018-02-04 00:16:25,065 INFO L87 Difference]: Start difference. First operand 376 states and 471 transitions. Second operand 19 states. [2018-02-04 00:16:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:26,296 INFO L93 Difference]: Finished difference Result 383 states and 477 transitions. [2018-02-04 00:16:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:16:26,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-04 00:16:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:26,297 INFO L225 Difference]: With dead ends: 383 [2018-02-04 00:16:26,297 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 00:16:26,297 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 00:16:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 00:16:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-02-04 00:16:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-04 00:16:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 455 transitions. [2018-02-04 00:16:26,300 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 455 transitions. Word has length 66 [2018-02-04 00:16:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:26,300 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 455 transitions. [2018-02-04 00:16:26,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:16:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 455 transitions. [2018-02-04 00:16:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 00:16:26,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:26,300 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 00:16:26,300 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 00:16:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash -830805894, now seen corresponding path program 1 times [2018-02-04 00:16:26,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:26,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:26,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:26,301 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:26,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:26,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:16:26,550 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 00:16:26,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:16:26,550 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 00:16:26,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:26,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:26,615 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 00:16:26,618 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 00:16:26,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 00:16:26,650 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 00:16:26,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,651 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 00:16:26,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 00:16:26,692 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 00:16:26,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,695 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:26,696 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 00:16:26,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 00:16:26,729 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 00:16:26,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,735 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:26,735 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 00:16:26,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-02-04 00:16:26,778 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 00:16:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,785 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:26,789 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 00:16:26,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:52 [2018-02-04 00:16:26,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,856 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 00:16:26,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,866 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 00:16:26,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 00:16:26,916 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 00:16:26,917 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 00:16:26,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,934 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 00:16:26,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 00:16:26,966 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 00:16:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:26,968 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 00:16:26,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:26,989 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 00:16:26,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-02-04 00:16:27,022 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 00:16:27,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,025 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,025 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 00:16:27,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,050 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 00:16:27,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:88 [2018-02-04 00:16:27,091 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 00:16:27,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,095 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,096 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 00:16:27,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,127 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 00:16:27,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:103 [2018-02-04 00:16:27,170 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 00:16:27,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,177 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,181 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 00:16:27,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,216 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 00:16:27,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:103 [2018-02-04 00:16:27,257 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 00:16:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,264 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,264 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,265 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 00:16:27,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,301 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 00:16:27,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:103 [2018-02-04 00:16:27,350 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 00:16:27,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,358 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:27,361 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 00:16:27,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,411 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 00:16:27,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:197, output treesize:178 [2018-02-04 00:16:27,497 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 00:16:27,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,504 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 00:16:27,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:27,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:27,543 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 00:16:27,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 15 xjuncts. [2018-02-04 00:16:27,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:16:27,640 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 00:16:27,640 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:190, output treesize:28 [2018-02-04 00:16:27,729 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 00:16:27,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:16:27,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2018-02-04 00:16:27,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 00:16:27,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 00:16:27,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 00:16:27,748 INFO L87 Difference]: Start difference. First operand 361 states and 455 transitions. Second operand 33 states. [2018-02-04 00:16:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:33,747 INFO L93 Difference]: Finished difference Result 509 states and 609 transitions. [2018-02-04 00:16:33,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 00:16:33,747 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2018-02-04 00:16:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:33,748 INFO L225 Difference]: With dead ends: 509 [2018-02-04 00:16:33,748 INFO L226 Difference]: Without dead ends: 509 [2018-02-04 00:16:33,749 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 00:16:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-04 00:16:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 377. [2018-02-04 00:16:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 00:16:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 483 transitions. [2018-02-04 00:16:33,752 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 483 transitions. Word has length 69 [2018-02-04 00:16:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:33,752 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 483 transitions. [2018-02-04 00:16:33,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 00:16:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 483 transitions. [2018-02-04 00:16:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 00:16:33,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:33,752 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 00:16:33,752 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 00:16:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash -830805851, now seen corresponding path program 1 times [2018-02-04 00:16:33,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:33,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:33,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:33,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:33,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:33,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:16:34,213 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 00:16:34,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:16:34,214 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 00:16:34,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:34,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:34,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,293 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 00:16:34,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-02-04 00:16:34,331 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 00:16:34,332 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 00:16:34,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 00:16:34,363 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 00:16:34,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:16:34,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-02-04 00:16:34,402 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 00:16:34,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,406 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 00:16:34,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-02-04 00:16:34,421 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 00:16:34,423 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 00:16:34,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 00:16:34,442 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 00:16:34,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-02-04 00:16:34,497 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 00:16:34,498 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 00:16:34,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,522 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 00:16:34,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,525 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 00:16:34,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:100 [2018-02-04 00:16:34,609 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 00:16:34,613 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 00:16:34,614 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 00:16:34,632 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 00:16:34,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,634 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 00:16:34,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,648 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 00:16:34,666 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 00:16:34,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:157 [2018-02-04 00:16:34,950 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:34,952 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 00:16:34,953 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:34,954 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 00:16:34,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:34,961 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 00:16:34,961 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:34,970 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 00:16:34,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:5 [2018-02-04 00:16:35,027 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 00:16:35,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:16:35,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-04 00:16:35,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:16:35,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:16:35,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:16:35,044 INFO L87 Difference]: Start difference. First operand 377 states and 483 transitions. Second operand 36 states. [2018-02-04 00:16:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:37,506 INFO L93 Difference]: Finished difference Result 469 states and 587 transitions. [2018-02-04 00:16:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 00:16:37,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-02-04 00:16:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:37,507 INFO L225 Difference]: With dead ends: 469 [2018-02-04 00:16:37,507 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 00:16:37,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=578, Invalid=3978, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 00:16:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 00:16:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 422. [2018-02-04 00:16:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-04 00:16:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 546 transitions. [2018-02-04 00:16:37,510 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 546 transitions. Word has length 69 [2018-02-04 00:16:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:37,510 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 546 transitions. [2018-02-04 00:16:37,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:16:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 546 transitions. [2018-02-04 00:16:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 00:16:37,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:37,511 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 00:16:37,511 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 00:16:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1953441236, now seen corresponding path program 1 times [2018-02-04 00:16:37,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:37,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:37,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:37,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,518 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:16:37,518 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:16:37,518 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) [2018-02-04 00:16:37,527 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 00:16:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:37,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:37,581 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 00:16:37,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:16:37,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 00:16:37,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:16:37,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:16:37,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:16:37,599 INFO L87 Difference]: Start difference. First operand 422 states and 546 transitions. Second operand 8 states. [2018-02-04 00:16:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:37,731 INFO L93 Difference]: Finished difference Result 423 states and 544 transitions. [2018-02-04 00:16:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:16:37,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-02-04 00:16:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:37,732 INFO L225 Difference]: With dead ends: 423 [2018-02-04 00:16:37,732 INFO L226 Difference]: Without dead ends: 423 [2018-02-04 00:16:37,733 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 00:16:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-04 00:16:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 397. [2018-02-04 00:16:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-04 00:16:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2018-02-04 00:16:37,735 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 71 [2018-02-04 00:16:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:37,735 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2018-02-04 00:16:37,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:16:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2018-02-04 00:16:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 00:16:37,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:37,736 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 00:16:37,736 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 00:16:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1358221306, now seen corresponding path program 2 times [2018-02-04 00:16:37,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:37,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:37,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,737 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:37,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:37,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:16:37,785 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 00:16:37,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:16:37,786 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 00:16:37,791 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:16:37,818 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:16:37,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:16:37,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:37,823 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 00:16:37,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:16:37,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-02-04 00:16:37,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:16:37,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:16:37,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:16:37,842 INFO L87 Difference]: Start difference. First operand 397 states and 514 transitions. Second operand 6 states. [2018-02-04 00:16:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:37,864 INFO L93 Difference]: Finished difference Result 431 states and 548 transitions. [2018-02-04 00:16:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:16:37,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-02-04 00:16:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:37,865 INFO L225 Difference]: With dead ends: 431 [2018-02-04 00:16:37,865 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 00:16:37,865 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 00:16:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 00:16:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 400. [2018-02-04 00:16:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 00:16:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 517 transitions. [2018-02-04 00:16:37,868 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 517 transitions. Word has length 72 [2018-02-04 00:16:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:37,868 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 517 transitions. [2018-02-04 00:16:37,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:16:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 517 transitions. [2018-02-04 00:16:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:16:37,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:37,869 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 00:16:37,869 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 00:16:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -844812929, now seen corresponding path program 2 times [2018-02-04 00:16:37,869 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:37,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:37,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,870 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:16:37,870 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:37,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:16:38,509 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 00:16:38,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:16:38,510 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 00:16:38,524 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:16:38,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:16:38,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:16:38,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:38,552 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 00:16:38,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:16:38,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:38,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:38,657 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 00:16:38,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:16:38,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:16:38,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:90 [2018-02-04 00:16:38,883 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 00:16:38,885 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 00:16:38,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-02-04 00:16:38,948 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 00:16:38,949 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 00:16:38,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:38,965 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 00:16:38,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-02-04 00:16:39,052 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 00:16:39,062 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 00:16:39,062 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 00:16:39,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 00:16:39,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:39,080 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 00:16:39,095 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 00:16:39,095 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:84 [2018-02-04 00:16:39,214 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:16:39,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,225 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:39,225 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 00:16:39,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:39,234 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 00:16:39,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:39 [2018-02-04 00:16:39,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:39,353 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 00:16:39,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:39,373 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 00:16:39,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:49 [2018-02-04 00:16:39,440 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 00:16:39,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:16:39,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 35 [2018-02-04 00:16:39,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:16:39,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:16:39,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:16:39,459 INFO L87 Difference]: Start difference. First operand 400 states and 517 transitions. Second operand 36 states. [2018-02-04 00:16:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:16:41,893 INFO L93 Difference]: Finished difference Result 486 states and 609 transitions. [2018-02-04 00:16:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 00:16:41,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 73 [2018-02-04 00:16:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:16:41,894 INFO L225 Difference]: With dead ends: 486 [2018-02-04 00:16:41,894 INFO L226 Difference]: Without dead ends: 459 [2018-02-04 00:16:41,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=300, Invalid=2892, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 00:16:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-04 00:16:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 443. [2018-02-04 00:16:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 00:16:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 572 transitions. [2018-02-04 00:16:41,897 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 572 transitions. Word has length 73 [2018-02-04 00:16:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:16:41,897 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 572 transitions. [2018-02-04 00:16:41,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:16:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 572 transitions. [2018-02-04 00:16:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 00:16:41,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:16:41,898 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 00:16:41,898 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 00:16:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 884883857, now seen corresponding path program 1 times [2018-02-04 00:16:41,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:16:41,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:16:41,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:41,899 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:16:41,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:16:41,904 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 00:16:41,904 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 00:16:41,904 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 00:16:41,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:16:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:16:41,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:16:41,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:16:41,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 00:16:41,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:41,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:41,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:41,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 00:16:41,992 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 00:16:41,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:41,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:16:41,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:41,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 00:16:42,025 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 00:16:42,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,031 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 00:16:42,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:28 [2018-02-04 00:16:42,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,068 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 00:16:42,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:43 [2018-02-04 00:16:42,136 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 00:16:42,138 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 00:16:42,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-02-04 00:16:42,213 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 00:16:42,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,216 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 00:16:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-02-04 00:16:42,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,282 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 00:16:42,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,289 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 00:16:42,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:71 [2018-02-04 00:16:42,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,372 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 00:16:42,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,402 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 00:16:42,403 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 00:16:42,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-02-04 00:16:42,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,488 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 00:16:42,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,523 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 00:16:42,524 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 00:16:42,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:80 [2018-02-04 00:16:42,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,585 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 00:16:42,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:78 [2018-02-04 00:16:42,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,707 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 00:16:42,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, 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 00:16:42,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:42,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2018-02-04 00:16:42,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,819 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:16:42,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,826 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 00:16:42,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:42,890 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 00:16:42,890 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-02-04 00:16:42,916 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 00:16:43,835 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 00:16:44,135 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 00:16:44,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:1949 [2018-02-04 00:16:44,519 WARN L146 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 225 DAG size of output 70 [2018-02-04 00:16:44,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,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, 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 00:16:44,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,534 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 00:16:44,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:44,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,776 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 00:16:44,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,779 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 00:16:44,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:44,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:44,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,993 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 00:16:44,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:44,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:16:44,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,181 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 00:16:45,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,183 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 00:16:45,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,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, 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 00:16:45,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,348 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 00:16:45,349 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,370 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,484 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 00:16:45,484 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:561, output treesize:529 [2018-02-04 00:16:45,643 WARN L143 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 00:16:45,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,654 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 00:16:45,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:45,664 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 00:16:45,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:45,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,010 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 00:16:46,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,016 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 00:16:46,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,290 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 00:16:46,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,295 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 00:16:46,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,506 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 00:16:46,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 48 [2018-02-04 00:16:46,511 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,532 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,692 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 00:16:46,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:46,698 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 00:16:46,698 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,726 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:46,841 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 00:16:46,841 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:624, output treesize:529 [2018-02-04 00:16:46,995 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 106 [2018-02-04 00:16:47,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,006 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 00:16:47,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,028 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 00:16:47,029 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 00:16:47,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:47,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,266 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 00:16:47,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,292 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 00:16:47,294 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 00:16:47,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:47,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,525 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 00:16:47,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,550 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 00:16:47,551 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 00:16:47,595 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:47,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,753 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 00:16:47,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,785 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 00:16:47,786 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 00:16:47,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:16:47,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:16:47,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:47,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,008 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 00:16:48,008 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 00:16:48,046 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 00:16:48,162 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 00:16:48,163 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:727, output treesize:640 [2018-02-04 00:16:48,406 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 124 DAG size of output 97 [2018-02-04 00:16:48,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,432 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 00:16:48,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,474 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 00:16:48,476 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 00:16:48,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:16:48,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,845 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 00:16:48,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:48,877 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 00:16:48,879 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 00:16:48,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:16:49,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,248 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 00:16:49,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,279 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 00:16:49,281 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 00:16:49,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:16:49,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,653 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 00:16:49,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:49,682 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 00:16:49,684 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 00:16:49,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:16:50,095 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 00:16:50,096 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:559, output treesize:1507 [2018-02-04 00:16:50,462 WARN L143 SmtUtils]: Spent 282ms on a formula simplification that was a NOOP. DAG size: 196 [2018-02-04 00:16:50,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,483 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 00:16:50,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:50,512 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 00:16:50,513 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 00:16:50,603 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 00:16:58,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:58,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:58,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:58,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:58,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:58,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:16:59,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:16:59,027 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 00:16:59,028 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 00:16:59,154 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 00:17:05,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,377 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 00:17:05,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:05,412 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 00:17:05,413 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 00:17:05,507 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 00:17:10,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,877 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 00:17:10,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:10,901 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 00:17:10,903 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 00:17:11,000 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 00:17:15,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 00:17:15,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:15,189 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 00:17:15,191 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 00:17:15,287 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 00:17:19,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,020 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 00:17:19,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:19,058 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 00:17:19,060 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 00:17:19,147 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 00:17:22,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,243 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 00:17:22,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:17:22,273 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 00:17:22,274 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. Received shutdown request... [2018-02-04 00:17:22,352 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 00:17:22,352 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:17:22,356 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:17:22,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:17:22 BoogieIcfgContainer [2018-02-04 00:17:22,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:17:22,357 INFO L168 Benchmark]: Toolchain (without parser) took 203011.30 ms. Allocated memory was 393.2 MB in the beginning and 768.1 MB in the end (delta: 374.9 MB). Free memory was 347.3 MB in the beginning and 602.6 MB in the end (delta: -255.4 MB). Peak memory consumption was 384.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:22,358 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 393.2 MB. Free memory is still 353.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:17:22,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.39 ms. Allocated memory is still 393.2 MB. Free memory was 347.3 MB in the beginning and 336.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:22,358 INFO L168 Benchmark]: Boogie Preprocessor took 26.74 ms. Allocated memory is still 393.2 MB. Free memory was 336.7 MB in the beginning and 334.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:22,358 INFO L168 Benchmark]: RCFGBuilder took 350.27 ms. Allocated memory is still 393.2 MB. Free memory was 334.0 MB in the beginning and 302.2 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:22,358 INFO L168 Benchmark]: TraceAbstraction took 202478.43 ms. Allocated memory was 393.2 MB in the beginning and 768.1 MB in the end (delta: 374.9 MB). Free memory was 302.2 MB in the beginning and 602.6 MB in the end (delta: -300.4 MB). Peak memory consumption was 339.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:22,359 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 393.2 MB. Free memory is still 353.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.39 ms. Allocated memory is still 393.2 MB. Free memory was 347.3 MB in the beginning and 336.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.74 ms. Allocated memory is still 393.2 MB. Free memory was 336.7 MB in the beginning and 334.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 350.27 ms. Allocated memory is still 393.2 MB. Free memory was 334.0 MB in the beginning and 302.2 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 202478.43 ms. Allocated memory was 393.2 MB in the beginning and 768.1 MB in the end (delta: 374.9 MB). Free memory was 302.2 MB in the beginning and 602.6 MB in the end (delta: -300.4 MB). Peak memory consumption was 339.4 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - 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 94. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 202.4s OverallTime, 49 OverallIterations, 3 TraceHistogramMax, 139.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3711 SDtfs, 14729 SDslu, 20888 SDs, 0 SdLazy, 18647 SolverSat, 1877 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 100.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2605 GetRequests, 1549 SyntacticMatches, 67 SemanticMatches, 989 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10070 ImplicationChecksByTransitivity, 42.4s 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.8s SatisfiabilityAnalysisTime, 19.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_00-17-22-364.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_00-17-22-364.csv Completed graceful shutdown