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-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:28:23,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:28:23,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:28:23,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:28:23,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:28:23,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:28:23,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:28:23,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:28:23,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:28:23,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:28:23,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:28:23,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:28:23,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:28:23,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:28:23,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:28:23,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:28:23,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:28:23,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:28:23,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:28:23,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:28:23,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:28:23,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:28:23,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:28:23,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:28:23,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:28:23,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:28:23,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:28:23,328 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:28:23,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:28:23,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:28:23,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:28:23,328 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:28:23,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:28:23,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:28:23,338 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:28:23,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:28:23,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:28:23,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:28:23,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:28:23,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:28:23,340 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:28:23,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:28:23,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:28:23,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:28:23,374 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:28:23,377 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:28:23,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:28:23,378 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:28:23,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-02-04 13:28:23,493 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:28:23,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:28:23,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:28:23,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:28:23,498 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:28:23,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32928a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23, skipping insertion in model container [2018-02-04 13:28:23,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,511 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:28:23,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:28:23,629 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:28:23,644 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:28:23,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23 WrapperNode [2018-02-04 13:28:23,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:28:23,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:28:23,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:28:23,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:28:23,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... [2018-02-04 13:28:23,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:28:23,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:28:23,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:28:23,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:28:23,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:28:23,728 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:28:23,728 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:28:23,728 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 13:28:23,728 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:28:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:28:23,728 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 13:28:23,729 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:28:23,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:28:23,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:28:24,065 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:28:24,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:28:24 BoogieIcfgContainer [2018-02-04 13:28:24,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:28:24,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:28:24,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:28:24,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:28:24,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:28:23" (1/3) ... [2018-02-04 13:28:24,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7a726c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:28:24, skipping insertion in model container [2018-02-04 13:28:24,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:23" (2/3) ... [2018-02-04 13:28:24,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7a726c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:28:24, skipping insertion in model container [2018-02-04 13:28:24,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:28:24" (3/3) ... [2018-02-04 13:28:24,071 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-02-04 13:28:24,077 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:28:24,082 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 13:28:24,105 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:28:24,105 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:28:24,105 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:28:24,105 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:28:24,105 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:28:24,105 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:28:24,106 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:28:24,106 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:28:24,107 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:28:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-02-04 13:28:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:28:24,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:24,124 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:24,124 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659462, now seen corresponding path program 1 times [2018-02-04 13:28:24,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:24,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:24,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:24,159 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:24,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:24,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:24,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:28:24,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:28:24,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:28:24,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:24,240 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-02-04 13:28:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:24,449 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 13:28:24,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:28:24,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:28:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:24,458 INFO L225 Difference]: With dead ends: 109 [2018-02-04 13:28:24,458 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 13:28:24,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 13:28:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-02-04 13:28:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 13:28:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-04 13:28:24,491 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 7 [2018-02-04 13:28:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:24,492 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-04 13:28:24,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:28:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-04 13:28:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 13:28:24,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:24,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:24,492 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659463, now seen corresponding path program 1 times [2018-02-04 13:28:24,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:24,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:24,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:24,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:24,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:24,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:24,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:28:24,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:28:24,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:28:24,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:24,540 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 3 states. [2018-02-04 13:28:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:24,605 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-02-04 13:28:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:28:24,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 13:28:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:24,607 INFO L225 Difference]: With dead ends: 102 [2018-02-04 13:28:24,607 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 13:28:24,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 13:28:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 13:28:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 13:28:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-02-04 13:28:24,615 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 7 [2018-02-04 13:28:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:24,615 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-02-04 13:28:24,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:28:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-02-04 13:28:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:28:24,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:24,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:24,616 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash -190938367, now seen corresponding path program 1 times [2018-02-04 13:28:24,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:24,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:24,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:24,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:24,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:24,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:24,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:28:24,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:28:24,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:28:24,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:24,694 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2018-02-04 13:28:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:24,793 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-04 13:28:24,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:28:24,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:28:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:24,794 INFO L225 Difference]: With dead ends: 96 [2018-02-04 13:28:24,794 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 13:28:24,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:28:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 13:28:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-04 13:28:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 13:28:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 13:28:24,800 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 14 [2018-02-04 13:28:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:24,800 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 13:28:24,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:28:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 13:28:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:28:24,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:24,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:24,801 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash -190938366, now seen corresponding path program 1 times [2018-02-04 13:28:24,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:24,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:24,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:24,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:24,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:24,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:24,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:28:24,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:28:24,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:28:24,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:28:24,901 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-02-04 13:28:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,103 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-02-04 13:28:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:28:25,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 13:28:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,105 INFO L225 Difference]: With dead ends: 123 [2018-02-04 13:28:25,105 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 13:28:25,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:28:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 13:28:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-02-04 13:28:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 13:28:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 13:28:25,111 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 14 [2018-02-04 13:28:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,111 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 13:28:25,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:28:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 13:28:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:28:25,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,112 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:25,112 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122010, now seen corresponding path program 1 times [2018-02-04 13:28:25,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,113 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:25,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:25,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:28:25,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:28:25,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:28:25,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:28:25,145 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 4 states. [2018-02-04 13:28:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,193 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-02-04 13:28:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:28:25,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:28:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,194 INFO L225 Difference]: With dead ends: 109 [2018-02-04 13:28:25,194 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 13:28:25,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 13:28:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 13:28:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 13:28:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-02-04 13:28:25,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 15 [2018-02-04 13:28:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,199 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-02-04 13:28:25,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:28:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-02-04 13:28:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 13:28:25,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,200 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:25,200 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122009, now seen corresponding path program 1 times [2018-02-04 13:28:25,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,201 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,201 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:25,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:25,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:28:25,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:28:25,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:28:25,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:28:25,244 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 4 states. [2018-02-04 13:28:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,291 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-04 13:28:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:28:25,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 13:28:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,292 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:28:25,292 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:28:25,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:28:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 13:28:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:28:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-04 13:28:25,295 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 15 [2018-02-04 13:28:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,295 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-04 13:28:25,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:28:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-04 13:28:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:28:25,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,296 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] [2018-02-04 13:28:25,296 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 146058220, now seen corresponding path program 1 times [2018-02-04 13:28:25,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:25,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:25,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:28:25,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:28:25,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:28:25,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:28:25,380 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 8 states. [2018-02-04 13:28:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,604 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-04 13:28:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:28:25,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 13:28:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,605 INFO L225 Difference]: With dead ends: 102 [2018-02-04 13:28:25,605 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 13:28:25,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:28:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 13:28:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-04 13:28:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 13:28:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-02-04 13:28:25,607 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 20 [2018-02-04 13:28:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,608 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-02-04 13:28:25,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:28:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-02-04 13:28:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:28:25,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,608 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] [2018-02-04 13:28:25,608 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1968454587, now seen corresponding path program 1 times [2018-02-04 13:28:25,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:25,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:25,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:28:25,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:28:25,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:28:25,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:28:25,702 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 6 states. [2018-02-04 13:28:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,787 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-02-04 13:28:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:28:25,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 13:28:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,788 INFO L225 Difference]: With dead ends: 115 [2018-02-04 13:28:25,788 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:28:25,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:28:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:28:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2018-02-04 13:28:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:28:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-04 13:28:25,792 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 30 [2018-02-04 13:28:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,792 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-04 13:28:25,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:28:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-04 13:28:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:28:25,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,793 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:25,793 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -892550082, now seen corresponding path program 1 times [2018-02-04 13:28:25,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,794 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:25,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:25,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:28:25,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:28:25,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:28:25,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:28:25,845 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 7 states. [2018-02-04 13:28:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:25,946 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-04 13:28:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:28:25,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 13:28:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:25,947 INFO L225 Difference]: With dead ends: 117 [2018-02-04 13:28:25,947 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 13:28:25,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:28:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 13:28:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2018-02-04 13:28:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 13:28:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-02-04 13:28:25,950 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 31 [2018-02-04 13:28:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:25,951 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-02-04 13:28:25,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:28:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-02-04 13:28:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:28:25,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:25,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:25,952 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash -892550081, now seen corresponding path program 1 times [2018-02-04 13:28:25,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:25,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:25,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:25,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:25,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:26,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:26,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:28:26,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:28:26,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:28:26,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:28:26,062 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 9 states. [2018-02-04 13:28:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:26,223 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-04 13:28:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:28:26,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 13:28:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:26,228 INFO L225 Difference]: With dead ends: 120 [2018-02-04 13:28:26,228 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 13:28:26,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:28:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 13:28:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2018-02-04 13:28:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 13:28:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-02-04 13:28:26,230 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 31 [2018-02-04 13:28:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:26,230 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-02-04 13:28:26,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:28:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-02-04 13:28:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:28:26,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:26,231 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, 1, 1] [2018-02-04 13:28:26,231 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1281554978, now seen corresponding path program 1 times [2018-02-04 13:28:26,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:26,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:26,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:26,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:26,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:26,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:26,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:28:26,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 13:28:26,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 13:28:26,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:26,273 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 3 states. [2018-02-04 13:28:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:26,282 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-02-04 13:28:26,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 13:28:26,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-04 13:28:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:26,284 INFO L225 Difference]: With dead ends: 103 [2018-02-04 13:28:26,285 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 13:28:26,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 13:28:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 13:28:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-04 13:28:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 13:28:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-04 13:28:26,288 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 33 [2018-02-04 13:28:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:26,289 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-04 13:28:26,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 13:28:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-04 13:28:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:28:26,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:26,290 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] [2018-02-04 13:28:26,290 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1628442402, now seen corresponding path program 1 times [2018-02-04 13:28:26,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:26,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:26,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:26,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:26,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:26,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:26,451 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:26,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:26,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:26,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:28:26,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:26,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 13:28:26,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:26,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:26,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 13:28:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:26,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:26,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-02-04 13:28:26,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:28:26,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:28:26,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:28:26,660 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 14 states. [2018-02-04 13:28:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:26,869 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-02-04 13:28:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 13:28:26,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 13:28:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:26,870 INFO L225 Difference]: With dead ends: 98 [2018-02-04 13:28:26,870 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 13:28:26,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:28:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 13:28:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-02-04 13:28:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 13:28:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 13:28:26,873 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 34 [2018-02-04 13:28:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:26,873 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 13:28:26,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:28:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 13:28:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:28:26,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:26,875 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, 1, 1, 1] [2018-02-04 13:28:26,875 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash 183041674, now seen corresponding path program 1 times [2018-02-04 13:28:26,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:26,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:26,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:26,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:26,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:26,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:26,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:28:26,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:28:26,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:28:26,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:26,910 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 5 states. [2018-02-04 13:28:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:26,986 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-04 13:28:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:28:26,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 13:28:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:26,987 INFO L225 Difference]: With dead ends: 92 [2018-02-04 13:28:26,987 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 13:28:26,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:28:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 13:28:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 13:28:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 13:28:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-04 13:28:26,990 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 34 [2018-02-04 13:28:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:26,990 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-04 13:28:26,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:28:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-04 13:28:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:28:26,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:26,991 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, 1, 1, 1] [2018-02-04 13:28:26,991 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:26,992 INFO L82 PathProgramCache]: Analyzing trace with hash 183041675, now seen corresponding path program 1 times [2018-02-04 13:28:26,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:26,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:26,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:26,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:26,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:27,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:27,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:27,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 13:28:27,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:28:27,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:28:27,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:28:27,138 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 11 states. [2018-02-04 13:28:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:27,367 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-04 13:28:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 13:28:27,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-04 13:28:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:27,368 INFO L225 Difference]: With dead ends: 94 [2018-02-04 13:28:27,368 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 13:28:27,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:28:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 13:28:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-04 13:28:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 13:28:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-04 13:28:27,370 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 34 [2018-02-04 13:28:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:27,371 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-04 13:28:27,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:28:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-04 13:28:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:28:27,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:27,372 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, 1, 1, 1, 1] [2018-02-04 13:28:27,372 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1082481281, now seen corresponding path program 1 times [2018-02-04 13:28:27,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:27,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:27,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:27,373 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:27,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:27,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:27,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:27,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:28:27,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:28:27,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:28:27,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:28:27,395 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 4 states. [2018-02-04 13:28:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:27,409 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-04 13:28:27,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:28:27,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 13:28:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:27,410 INFO L225 Difference]: With dead ends: 90 [2018-02-04 13:28:27,410 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 13:28:27,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:28:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 13:28:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-02-04 13:28:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 13:28:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-04 13:28:27,412 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 35 [2018-02-04 13:28:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:27,412 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-04 13:28:27,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:28:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-04 13:28:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:28:27,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:27,413 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, 1, 1, 1, 1] [2018-02-04 13:28:27,413 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324610, now seen corresponding path program 1 times [2018-02-04 13:28:27,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:27,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:27,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:27,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:27,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:27,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:27,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:27,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 13:28:27,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:28:27,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:28:27,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:28:27,703 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 15 states. [2018-02-04 13:28:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:28,220 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-04 13:28:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:28:28,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-04 13:28:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:28,221 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:28:28,222 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 13:28:28,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:28:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 13:28:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-02-04 13:28:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:28:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-02-04 13:28:28,233 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 35 [2018-02-04 13:28:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:28,233 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-02-04 13:28:28,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:28:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-02-04 13:28:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:28:28,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:28,236 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, 1, 1, 1, 1] [2018-02-04 13:28:28,236 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324611, now seen corresponding path program 1 times [2018-02-04 13:28:28,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:28,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:28,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:28,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:28,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:28,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:28,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:28,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 13:28:28,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:28:28,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:28:28,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:28:28,527 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 15 states. [2018-02-04 13:28:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:28,876 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-04 13:28:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:28:28,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-04 13:28:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:28,876 INFO L225 Difference]: With dead ends: 111 [2018-02-04 13:28:28,877 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 13:28:28,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:28:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 13:28:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-02-04 13:28:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:28:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-02-04 13:28:28,879 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 35 [2018-02-04 13:28:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:28,880 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-02-04 13:28:28,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:28:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-02-04 13:28:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 13:28:28,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:28,880 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, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:28,881 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1613943773, now seen corresponding path program 1 times [2018-02-04 13:28:28,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:28,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:28,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:28,882 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:28,882 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:28,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:29,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:29,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 13:28:29,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:28:29,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:28:29,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:28:29,188 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 15 states. [2018-02-04 13:28:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:29,754 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-04 13:28:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 13:28:29,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 13:28:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:29,755 INFO L225 Difference]: With dead ends: 128 [2018-02-04 13:28:29,755 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 13:28:29,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:28:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 13:28:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-02-04 13:28:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 13:28:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-04 13:28:29,757 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 37 [2018-02-04 13:28:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:29,757 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-04 13:28:29,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:28:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-04 13:28:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:28:29,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:29,757 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:29,757 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350608, now seen corresponding path program 1 times [2018-02-04 13:28:29,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:29,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:29,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:29,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:29,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:29,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:29,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:29,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:28:29,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:28:29,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:28:29,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:28:29,813 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 8 states. [2018-02-04 13:28:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:29,891 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 13:28:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:28:29,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 13:28:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:29,892 INFO L225 Difference]: With dead ends: 115 [2018-02-04 13:28:29,893 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:28:29,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:28:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:28:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 13:28:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:28:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 13:28:29,895 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 38 [2018-02-04 13:28:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:29,896 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 13:28:29,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:28:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 13:28:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 13:28:29,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:29,896 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:29,896 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350609, now seen corresponding path program 1 times [2018-02-04 13:28:29,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:29,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:29,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:29,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:29,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:29,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:30,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:30,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 13:28:30,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:28:30,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:28:30,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:28:30,160 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 15 states. [2018-02-04 13:28:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:30,660 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 13:28:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:28:30,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-04 13:28:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:30,702 INFO L225 Difference]: With dead ends: 125 [2018-02-04 13:28:30,702 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 13:28:30,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:28:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 13:28:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-02-04 13:28:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 13:28:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-04 13:28:30,705 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 38 [2018-02-04 13:28:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:30,705 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-04 13:28:30,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:28:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-04 13:28:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:28:30,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:30,705 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:30,705 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash 563388428, now seen corresponding path program 1 times [2018-02-04 13:28:30,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:30,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:30,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:30,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:30,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:30,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:30,809 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:30,809 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:30,813 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:30,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:30,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:30,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:30,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 13:28:30,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 13:28:30,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 13:28:30,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 13:28:30,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 13:28:30,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:30,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 13:28:30,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 13:28:30,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 13:28:30,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:30,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:30,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-04 13:28:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:31,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:31,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-02-04 13:28:31,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:28:31,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:28:31,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:31,004 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 20 states. [2018-02-04 13:28:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:31,399 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 13:28:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:28:31,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-02-04 13:28:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:31,399 INFO L225 Difference]: With dead ends: 115 [2018-02-04 13:28:31,400 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:28:31,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:28:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:28:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 13:28:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:28:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 13:28:31,403 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 40 [2018-02-04 13:28:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:31,403 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 13:28:31,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:28:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 13:28:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:28:31,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:31,404 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:31,404 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 563388429, now seen corresponding path program 1 times [2018-02-04 13:28:31,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:31,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:31,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:31,405 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:31,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:31,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:31,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:31,599 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:31,606 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:31,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:31,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:31,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:31,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:31,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:31,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 13:28:31,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:31,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:31,753 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 15 treesize of output 8 [2018-02-04 13:28:31,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 13:28:31,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-04 13:28:31,866 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-04 13:28:31,870 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 34 treesize of output 33 [2018-02-04 13:28:31,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 13:28:31,914 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 24 treesize of output 23 [2018-02-04 13:28:31,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:31,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-04 13:28:31,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 13:28:31,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-04 13:28:31,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:31,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-02-04 13:28:31,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,004 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 26 treesize of output 10 [2018-02-04 13:28:32,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 13:28:32,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-02-04 13:28:32,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:28:32,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,051 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 18 treesize of output 3 [2018-02-04 13:28:32,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,055 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:32,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:32,073 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-04 13:28:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:32,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:32,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-04 13:28:32,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 13:28:32,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 13:28:32,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-02-04 13:28:32,121 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 22 states. [2018-02-04 13:28:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:32,693 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-04 13:28:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:28:32,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-02-04 13:28:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:32,694 INFO L225 Difference]: With dead ends: 114 [2018-02-04 13:28:32,694 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 13:28:32,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-02-04 13:28:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 13:28:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 13:28:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 13:28:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-04 13:28:32,695 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 40 [2018-02-04 13:28:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:32,696 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-04 13:28:32,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 13:28:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-04 13:28:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 13:28:32,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:32,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:32,696 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1159956241, now seen corresponding path program 1 times [2018-02-04 13:28:32,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:32,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:32,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:32,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:32,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:32,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:32,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 13:28:32,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 13:28:32,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 13:28:32,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 13:28:32,782 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 10 states. [2018-02-04 13:28:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:32,925 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 13:28:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:28:32,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 13:28:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:32,926 INFO L225 Difference]: With dead ends: 121 [2018-02-04 13:28:32,926 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 13:28:32,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:28:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 13:28:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 13:28:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 13:28:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-02-04 13:28:32,928 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 40 [2018-02-04 13:28:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:32,929 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-02-04 13:28:32,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 13:28:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-02-04 13:28:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:28:32,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:32,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:32,929 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash -176636398, now seen corresponding path program 1 times [2018-02-04 13:28:32,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:32,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:32,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:32,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:32,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:32,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:32,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:28:32,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:28:32,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:28:32,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:32,959 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 5 states. [2018-02-04 13:28:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:32,976 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-04 13:28:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:28:32,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-04 13:28:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:32,976 INFO L225 Difference]: With dead ends: 126 [2018-02-04 13:28:32,977 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 13:28:32,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 13:28:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-02-04 13:28:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:28:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-02-04 13:28:32,979 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 45 [2018-02-04 13:28:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:32,980 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-02-04 13:28:32,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:28:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-02-04 13:28:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 13:28:32,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:32,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:32,980 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2049912175, now seen corresponding path program 1 times [2018-02-04 13:28:32,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:32,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:32,981 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,981 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:32,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:32,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:33,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:33,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 13:28:33,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:28:33,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:28:33,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:33,909 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 20 states. [2018-02-04 13:28:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:35,019 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-04 13:28:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:28:35,020 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-02-04 13:28:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:35,020 INFO L225 Difference]: With dead ends: 128 [2018-02-04 13:28:35,020 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 13:28:35,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 13:28:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 13:28:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-04 13:28:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 13:28:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 13:28:35,023 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 47 [2018-02-04 13:28:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:35,024 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 13:28:35,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:28:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 13:28:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 13:28:35,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:35,024 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 13:28:35,024 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1188291934, now seen corresponding path program 1 times [2018-02-04 13:28:35,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:35,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:35,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:35,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:35,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:35,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:35,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:35,120 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:35,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:35,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:35,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:35,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:35,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:35,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:35,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:35,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-04 13:28:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:35,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:35,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-02-04 13:28:35,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:28:35,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:28:35,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:28:35,255 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 19 states. [2018-02-04 13:28:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:35,580 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-02-04 13:28:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:28:35,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-04 13:28:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:35,581 INFO L225 Difference]: With dead ends: 87 [2018-02-04 13:28:35,581 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 13:28:35,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:28:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 13:28:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-04 13:28:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 13:28:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-02-04 13:28:35,583 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 55 [2018-02-04 13:28:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:35,583 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-02-04 13:28:35,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:28:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-02-04 13:28:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:28:35,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:35,584 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:35,584 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 579137738, now seen corresponding path program 1 times [2018-02-04 13:28:35,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:35,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:35,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:35,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:35,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:35,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:36,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:36,314 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:36,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:36,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:36,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:36,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:28:36,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:28:36,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:28:36,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-04 13:28:36,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:36,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:36,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-02-04 13:28:36,583 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 27 [2018-02-04 13:28:36,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-02-04 13:28:36,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:36,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:36,623 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 15 treesize of output 8 [2018-02-04 13:28:36,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-02-04 13:28:36,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:36,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-02-04 13:28:36,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:36,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:36,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:36,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:36,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:154 [2018-02-04 13:28:37,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:37,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:37,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:37,129 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 24 treesize of output 29 [2018-02-04 13:28:37,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,149 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 82 treesize of output 74 [2018-02-04 13:28:37,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2018-02-04 13:28:37,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:37,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:37,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 77 [2018-02-04 13:28:37,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-02-04 13:28:37,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:37,192 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:37,192 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 34 treesize of output 66 [2018-02-04 13:28:37,192 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,213 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:37,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-02-04 13:28:37,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, 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 50 [2018-02-04 13:28:37,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:37,244 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:197, output treesize:98 [2018-02-04 13:28:37,407 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 73 treesize of output 61 [2018-02-04 13:28:37,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-02-04 13:28:37,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:37,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:78 [2018-02-04 13:28:37,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-02-04 13:28:37,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-02-04 13:28:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:37,524 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:37,525 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 28 treesize of output 25 [2018-02-04 13:28:37,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 13:28:37,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,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 15 treesize of output 3 [2018-02-04 13:28:37,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:37,547 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:94, output treesize:3 [2018-02-04 13:28:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:37,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:37,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 45 [2018-02-04 13:28:37,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 13:28:37,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 13:28:37,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1926, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 13:28:37,604 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 46 states. [2018-02-04 13:28:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:40,099 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-02-04 13:28:40,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 13:28:40,100 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-02-04 13:28:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:40,100 INFO L225 Difference]: With dead ends: 135 [2018-02-04 13:28:40,100 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 13:28:40,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=627, Invalid=7205, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 13:28:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 13:28:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 86. [2018-02-04 13:28:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 13:28:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-02-04 13:28:40,104 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 56 [2018-02-04 13:28:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:40,104 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-02-04 13:28:40,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 13:28:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-02-04 13:28:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 13:28:40,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:40,105 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:40,105 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 579137739, now seen corresponding path program 1 times [2018-02-04 13:28:40,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:40,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:40,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:40,106 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:40,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:40,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:41,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:41,173 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:41,177 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:41,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:41,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:41,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:28:41,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:41,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-04 13:28:41,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:28:41,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:28:41,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-04 13:28:41,408 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 21 treesize of output 33 [2018-02-04 13:28:41,415 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 13:28:41,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:28:41,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 13:28:41,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:41,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:41,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-02-04 13:28:41,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:41,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:41,483 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 15 treesize of output 8 [2018-02-04 13:28:41,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-02-04 13:28:41,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:41,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:41,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-02-04 13:28:42,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-02-04 13:28:42,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,075 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 50 treesize of output 46 [2018-02-04 13:28:42,077 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 46 treesize of output 42 [2018-02-04 13:28:42,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-02-04 13:28:42,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-02-04 13:28:42,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-02-04 13:28:42,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,119 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 89 [2018-02-04 13:28:42,146 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 46 treesize of output 41 [2018-02-04 13:28:42,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,173 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:165, output treesize:138 [2018-02-04 13:28:42,358 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 15 treesize of output 11 [2018-02-04 13:28:42,359 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 11 treesize of output 7 [2018-02-04 13:28:42,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:143 [2018-02-04 13:28:42,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-02-04 13:28:42,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 80 [2018-02-04 13:28:42,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-04 13:28:42,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:42,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-02-04 13:28:42,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,473 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:42,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:42,475 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 44 treesize of output 36 [2018-02-04 13:28:42,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:42,501 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:160, output treesize:37 [2018-02-04 13:28:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:42,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:42,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2018-02-04 13:28:42,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 13:28:42,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 13:28:42,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2179, Unknown=17, NotChecked=0, Total=2352 [2018-02-04 13:28:42,578 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 49 states. [2018-02-04 13:28:44,240 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 113 DAG size of output 80 [2018-02-04 13:28:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:45,051 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-02-04 13:28:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 13:28:45,051 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-02-04 13:28:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:45,052 INFO L225 Difference]: With dead ends: 87 [2018-02-04 13:28:45,052 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 13:28:45,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=441, Invalid=4922, Unknown=39, NotChecked=0, Total=5402 [2018-02-04 13:28:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 13:28:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-02-04 13:28:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 13:28:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 13:28:45,054 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 56 [2018-02-04 13:28:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:45,055 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 13:28:45,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 13:28:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 13:28:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 13:28:45,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:45,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:45,055 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1794381781, now seen corresponding path program 1 times [2018-02-04 13:28:45,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:45,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:45,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:45,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:45,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:45,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:45,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:45,840 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:45,845 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:45,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:45,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:45,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:45,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:45,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:28:45,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:45,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:45,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:28:45,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:45,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:45,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-02-04 13:28:46,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:28:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:28:46,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-02-04 13:28:46,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:46,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:46,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,071 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 3 case distinctions, treesize of input 28 treesize of output 38 [2018-02-04 13:28:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 13:28:46,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,089 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-02-04 13:28:46,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 13:28:46,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:28:46,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:28:46,108 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:54, output treesize:84 [2018-02-04 13:28:46,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,153 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 63 treesize of output 57 [2018-02-04 13:28:46,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:100, output treesize:57 [2018-02-04 13:28:46,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 13:28:46,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:46,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:46,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134 [2018-02-04 13:28:46,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 13:28:46,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,801 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 58 treesize of output 54 [2018-02-04 13:28:46,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 13:28:46,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-02-04 13:28:46,826 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-02-04 13:28:46,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 13:28:46,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:46,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-02-04 13:28:46,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 13:28:46,847 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,854 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:46,869 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:190, output treesize:130 [2018-02-04 13:28:47,024 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 131 treesize of output 113 [2018-02-04 13:28:47,025 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 113 treesize of output 92 [2018-02-04 13:28:47,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:143, output treesize:104 [2018-02-04 13:28:47,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:47,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:47,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 63 [2018-02-04 13:28:47,094 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 13:28:47,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-04 13:28:47,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:47,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-02-04 13:28:47,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:14 [2018-02-04 13:28:47,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:47,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:28:47,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:47,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:47,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:28:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:47,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:47,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 49 [2018-02-04 13:28:47,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 13:28:47,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 13:28:47,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2289, Unknown=2, NotChecked=0, Total=2450 [2018-02-04 13:28:47,215 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 50 states. [2018-02-04 13:28:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:54,721 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-02-04 13:28:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 13:28:54,721 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 58 [2018-02-04 13:28:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:54,722 INFO L225 Difference]: With dead ends: 131 [2018-02-04 13:28:54,722 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 13:28:54,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=631, Invalid=6834, Unknown=17, NotChecked=0, Total=7482 [2018-02-04 13:28:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 13:28:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 84. [2018-02-04 13:28:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 13:28:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-02-04 13:28:54,725 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 58 [2018-02-04 13:28:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:54,725 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-02-04 13:28:54,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 13:28:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-02-04 13:28:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 13:28:54,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:54,725 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:54,725 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:28:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 208739657, now seen corresponding path program 1 times [2018-02-04 13:28:54,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:54,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:54,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:54,726 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:54,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:54,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:55,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:28:55,513 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:28:55,518 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:55,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:28:55,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:55,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:28:55,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:55,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-04 13:28:55,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:28:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:28:55,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-04 13:28:55,724 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 21 treesize of output 33 [2018-02-04 13:28:55,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 13:28:55,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:28:55,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:28:55,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-02-04 13:28:55,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:55,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:55,798 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 15 treesize of output 8 [2018-02-04 13:28:55,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-02-04 13:28:55,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:28:55,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:55,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-02-04 13:28:56,351 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-02-04 13:28:56,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,360 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 28 treesize of output 21 [2018-02-04 13:28:56,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,411 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:56,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2018-02-04 13:28:56,421 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-02-04 13:28:56,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,436 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 77 treesize of output 64 [2018-02-04 13:28:56,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,440 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 53 treesize of output 51 [2018-02-04 13:28:56,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,449 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:56,450 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 24 treesize of output 20 [2018-02-04 13:28:56,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,463 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 30 treesize of output 23 [2018-02-04 13:28:56,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,466 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-02-04 13:28:56,467 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,470 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-02-04 13:28:56,486 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-02-04 13:28:56,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-02-04 13:28:56,489 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,494 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:56,510 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 74 treesize of output 77 [2018-02-04 13:28:56,513 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 39 treesize of output 32 [2018-02-04 13:28:56,513 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,521 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,528 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,551 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 66 treesize of output 62 [2018-02-04 13:28:56,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-04 13:28:56,554 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,576 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 13:28:56,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-02-04 13:28:56,578 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,582 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:28:56,598 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:154, output treesize:127 [2018-02-04 13:28:56,846 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 62 treesize of output 58 [2018-02-04 13:28:56,847 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 11 treesize of output 7 [2018-02-04 13:28:56,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,888 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 124 treesize of output 120 [2018-02-04 13:28:56,890 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 11 treesize of output 7 [2018-02-04 13:28:56,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:56,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 13:28:56,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:165 [2018-02-04 13:28:57,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 113 [2018-02-04 13:28:57,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,059 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 68 treesize of output 55 [2018-02-04 13:28:57,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 13:28:57,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:199, output treesize:169 [2018-02-04 13:28:57,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,176 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 130 treesize of output 157 [2018-02-04 13:28:57,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,276 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 72 treesize of output 99 [2018-02-04 13:28:57,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-02-04 13:28:57,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:543, output treesize:469 [2018-02-04 13:28:57,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 83 [2018-02-04 13:28:57,548 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 18 treesize of output 10 [2018-02-04 13:28:57,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,570 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:57,573 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 32 treesize of output 30 [2018-02-04 13:28:57,573 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 13:28:57,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,653 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-02-04 13:28:57,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-02-04 13:28:57,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:57,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:57,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-02-04 13:28:57,727 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:28:57,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-02-04 13:28:57,728 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 77 [2018-02-04 13:28:57,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 13:28:57,781 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:28:57,795 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 13:28:57,795 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:57,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 13:28:57,806 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:28:57,813 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:28:57,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 13:28:57,843 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:351, output treesize:65 [2018-02-04 13:28:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:58,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:28:58,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 50 [2018-02-04 13:28:58,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 13:28:58,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 13:28:58,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2385, Unknown=14, NotChecked=0, Total=2550 [2018-02-04 13:28:58,007 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 51 states. [2018-02-04 13:29:00,396 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 94 DAG size of output 76 [2018-02-04 13:29:00,588 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 170 DAG size of output 89 [2018-02-04 13:29:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:01,463 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-04 13:29:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 13:29:01,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 59 [2018-02-04 13:29:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:01,464 INFO L225 Difference]: With dead ends: 130 [2018-02-04 13:29:01,464 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 13:29:01,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=517, Invalid=6406, Unknown=49, NotChecked=0, Total=6972 [2018-02-04 13:29:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 13:29:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 99. [2018-02-04 13:29:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 13:29:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-02-04 13:29:01,468 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 59 [2018-02-04 13:29:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:01,468 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-02-04 13:29:01,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 13:29:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-02-04 13:29:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 13:29:01,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:01,470 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:01,470 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1264652791, now seen corresponding path program 1 times [2018-02-04 13:29:01,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:01,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:01,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:01,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:01,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:01,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:01,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:01,616 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:01,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:01,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:01,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:29:01,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:01,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-02-04 13:29:01,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:01,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:01,705 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 15 treesize of output 8 [2018-02-04 13:29:01,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-04 13:29:01,727 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 24 treesize of output 18 [2018-02-04 13:29:01,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-04 13:29:01,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-02-04 13:29:01,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:01,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:29:01,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:01,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:01,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:29:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:01,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:01,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15 [2018-02-04 13:29:01,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:29:01,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:29:01,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:29:01,804 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 16 states. [2018-02-04 13:29:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:02,186 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 13:29:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:29:02,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-04 13:29:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:02,187 INFO L225 Difference]: With dead ends: 111 [2018-02-04 13:29:02,187 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 13:29:02,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-02-04 13:29:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 13:29:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-02-04 13:29:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 13:29:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-02-04 13:29:02,189 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 61 [2018-02-04 13:29:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:02,190 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-02-04 13:29:02,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:29:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-02-04 13:29:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:29:02,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:02,190 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:02,190 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1335954918, now seen corresponding path program 1 times [2018-02-04 13:29:02,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:02,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:02,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:02,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:02,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:02,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:03,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:03,500 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:03,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:03,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:03,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:29:03,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:29:03,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:03,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:03,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:29:03,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-04 13:29:03,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 13:29:03,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 13:29:03,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-04 13:29:03,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:29:03,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:03,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,778 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 20 treesize of output 32 [2018-02-04 13:29:03,780 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 21 treesize of output 20 [2018-02-04 13:29:03,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-02-04 13:29:03,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:03,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:03,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 13:29:03,812 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71 [2018-02-04 13:29:03,852 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:29:03,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:03,859 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 15 treesize of output 8 [2018-02-04 13:29:03,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:03,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44 [2018-02-04 13:29:04,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 13:29:04,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,427 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:04,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-02-04 13:29:04,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-02-04 13:29:04,434 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,446 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 69 treesize of output 100 [2018-02-04 13:29:04,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,457 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 98 treesize of output 83 [2018-02-04 13:29:04,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 93 [2018-02-04 13:29:04,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2018-02-04 13:29:04,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:04,476 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2018-02-04 13:29:04,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,483 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:04,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-02-04 13:29:04,489 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,493 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:04,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:04,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-02-04 13:29:04,504 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-04 13:29:04,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55 [2018-02-04 13:29:04,507 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,510 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:04,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-02-04 13:29:04,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-02-04 13:29:04,533 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,539 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,545 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-02-04 13:29:04,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-02-04 13:29:04,561 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,566 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,567 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 77 treesize of output 73 [2018-02-04 13:29:04,568 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 21 [2018-02-04 13:29:04,568 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,573 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:04,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:04,587 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:155, output treesize:137 [2018-02-04 13:29:05,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:05,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 187 [2018-02-04 13:29:05,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:05,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:05,194 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 2 case distinctions, treesize of input 94 treesize of output 111 [2018-02-04 13:29:05,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 13:29:05,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-02-04 13:29:05,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:689, output treesize:829 [2018-02-04 13:29:05,553 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-02-04 13:29:05,558 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 187 treesize of output 175 [2018-02-04 13:29:05,560 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 80 treesize of output 65 [2018-02-04 13:29:05,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2018-02-04 13:29:05,675 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 41 treesize of output 30 [2018-02-04 13:29:05,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,792 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 144 treesize of output 128 [2018-02-04 13:29:05,794 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 107 treesize of output 88 [2018-02-04 13:29:05,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2018-02-04 13:29:05,901 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 39 treesize of output 28 [2018-02-04 13:29:05,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,911 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:05,998 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 155 treesize of output 147 [2018-02-04 13:29:06,000 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 39 treesize of output 28 [2018-02-04 13:29:06,000 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,011 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,097 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 157 treesize of output 149 [2018-02-04 13:29:06,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-02-04 13:29:06,099 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,110 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,190 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 6 xjuncts. [2018-02-04 13:29:06,190 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:820, output treesize:682 [2018-02-04 13:29:06,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,363 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 93 [2018-02-04 13:29:06,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,444 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 112 treesize of output 145 [2018-02-04 13:29:06,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147 [2018-02-04 13:29:06,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,738 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 87 treesize of output 102 [2018-02-04 13:29:06,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:06,856 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 79 [2018-02-04 13:29:06,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:06,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 9 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-02-04 13:29:06,910 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:882, output treesize:423 [2018-02-04 13:29:07,051 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:29:07,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:07,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,100 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 130 treesize of output 117 [2018-02-04 13:29:07,109 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 117 [2018-02-04 13:29:07,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:07,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:07,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:07,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-02-04 13:29:07,275 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2018-02-04 13:29:07,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:07,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 13:29:07,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2018-02-04 13:29:07,474 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:488, output treesize:603 [2018-02-04 13:29:11,809 WARN L146 SmtUtils]: Spent 4180ms on a formula simplification. DAG size of input: 164 DAG size of output 58 [2018-02-04 13:29:11,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:11,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:11,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-02-04 13:29:11,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 13:29:11,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 13:29:11,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:11,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-04 13:29:11,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:11,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:11,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:11,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:11,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2018-02-04 13:29:11,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-02-04 13:29:11,864 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,882 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 14 treesize of output 6 [2018-02-04 13:29:11,883 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 13:29:11,889 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:11,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:11,906 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:163, output treesize:58 [2018-02-04 13:29:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:12,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:12,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 59 [2018-02-04 13:29:12,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 13:29:12,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 13:29:12,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3344, Unknown=6, NotChecked=0, Total=3540 [2018-02-04 13:29:12,020 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 60 states. [2018-02-04 13:29:15,049 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 106 DAG size of output 69 [2018-02-04 13:29:15,406 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 101 DAG size of output 79 [2018-02-04 13:29:15,749 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 93 DAG size of output 64 [2018-02-04 13:29:16,158 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 100 DAG size of output 68 [2018-02-04 13:29:16,364 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 116 DAG size of output 94 [2018-02-04 13:29:16,534 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-02-04 13:29:16,932 WARN L146 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 132 DAG size of output 101 [2018-02-04 13:29:17,456 WARN L146 SmtUtils]: Spent 462ms on a formula simplification. DAG size of input: 158 DAG size of output 126 [2018-02-04 13:29:17,789 WARN L146 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-02-04 13:29:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:18,636 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-04 13:29:18,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 13:29:18,637 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 66 [2018-02-04 13:29:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:18,637 INFO L225 Difference]: With dead ends: 128 [2018-02-04 13:29:18,637 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 13:29:18,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=606, Invalid=8689, Unknown=17, NotChecked=0, Total=9312 [2018-02-04 13:29:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 13:29:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-02-04 13:29:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:29:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 13:29:18,641 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 66 [2018-02-04 13:29:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:18,641 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 13:29:18,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 13:29:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 13:29:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:29:18,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:18,642 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:18,642 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1335954917, now seen corresponding path program 1 times [2018-02-04 13:29:18,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:18,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:18,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:18,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:18,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:18,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:19,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:19,182 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:19,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:19,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:19,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:29:19,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 8 treesize of output 7 [2018-02-04 13:29:19,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 13:29:19,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:29:19,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:19,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2018-02-04 13:29:19,492 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 23 treesize of output 18 [2018-02-04 13:29:19,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:19,495 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 25 [2018-02-04 13:29:19,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:19,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:43 [2018-02-04 13:29:19,552 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 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 13:29:19,554 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 22 treesize of output 21 [2018-02-04 13:29:19,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 13:29:19,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:19,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:19,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:19,599 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:121 [2018-02-04 13:29:19,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-02-04 13:29:19,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-02-04 13:29:19,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:19,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-02-04 13:29:19,703 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 19 treesize of output 19 [2018-02-04 13:29:19,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 71 [2018-02-04 13:29:19,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-02-04 13:29:19,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2018-02-04 13:29:19,756 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,760 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,768 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:19,769 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 38 treesize of output 35 [2018-02-04 13:29:19,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:19,772 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 28 treesize of output 30 [2018-02-04 13:29:19,772 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,776 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,781 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,785 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 74 treesize of output 70 [2018-02-04 13:29:19,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-04 13:29:19,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:19,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 13:29:19,790 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,793 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,804 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:19,805 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 49 treesize of output 48 [2018-02-04 13:29:19,806 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 29 treesize of output 22 [2018-02-04 13:29:19,807 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,811 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,817 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:19,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:19,836 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:71 [2018-02-04 13:29:20,099 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 83 treesize of output 82 [2018-02-04 13:29:20,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-02-04 13:29:20,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 13:29:20,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:215, output treesize:149 [2018-02-04 13:29:20,200 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 13:29:20,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:20,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:20,203 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 103 treesize of output 97 [2018-02-04 13:29:20,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,240 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:20,241 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 65 treesize of output 79 [2018-02-04 13:29:20,244 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 60 treesize of output 49 [2018-02-04 13:29:20,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,270 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 75 treesize of output 61 [2018-02-04 13:29:20,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2018-02-04 13:29:20,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:20,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:20,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:20,288 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:191, output treesize:50 [2018-02-04 13:29:20,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-04 13:29:20,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-02-04 13:29:20,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 13:29:20,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-02-04 13:29:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 13:29:20,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 13:29:20,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,346 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:20,350 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:9 [2018-02-04 13:29:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:20,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:20,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [23] total 41 [2018-02-04 13:29:20,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:29:20,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:29:20,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1558, Unknown=3, NotChecked=0, Total=1722 [2018-02-04 13:29:20,402 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 42 states. [2018-02-04 13:29:25,172 WARN L146 SmtUtils]: Spent 4122ms on a formula simplification. DAG size of input: 89 DAG size of output 84 [2018-02-04 13:29:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:26,392 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-02-04 13:29:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:29:26,392 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-02-04 13:29:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:26,392 INFO L225 Difference]: With dead ends: 126 [2018-02-04 13:29:26,393 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 13:29:26,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=495, Invalid=4466, Unknown=9, NotChecked=0, Total=4970 [2018-02-04 13:29:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 13:29:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-02-04 13:29:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 13:29:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-04 13:29:26,395 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 66 [2018-02-04 13:29:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:26,395 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-04 13:29:26,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:29:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-04 13:29:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 13:29:26,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:26,396 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:26,396 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash 341344119, now seen corresponding path program 1 times [2018-02-04 13:29:26,396 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:26,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:26,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:26,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:26,397 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:26,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:29:26,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:26,450 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:26,455 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:26,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:29:26,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:29:26,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 13:29:26,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:26,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:26,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:26,518 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 6 states. [2018-02-04 13:29:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:26,534 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-04 13:29:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:29:26,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-04 13:29:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:26,535 INFO L225 Difference]: With dead ends: 109 [2018-02-04 13:29:26,535 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 13:29:26,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 13:29:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 13:29:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 13:29:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-02-04 13:29:26,536 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 68 [2018-02-04 13:29:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:26,536 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-02-04 13:29:26,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-02-04 13:29:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:29:26,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:26,537 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:26,537 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:26,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2029014614, now seen corresponding path program 1 times [2018-02-04 13:29:26,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:26,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:26,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:26,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:26,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:26,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:27,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:27,006 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:27,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:27,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:27,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 13:29:27,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:27,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 13:29:27,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 13:29:27,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:27,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:27,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:66 [2018-02-04 13:29:27,232 WARN L1033 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) 0)) (exists ((|append_#t~ite8.offset| Int)) (= (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (store (select |c_old(#memory_$Pointer$.offset)| .cse1) 0 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.offset|))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| 0))) |c_#memory_$Pointer$.offset|))) is different from true [2018-02-04 13:29:27,255 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 63 treesize of output 47 [2018-02-04 13:29:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-02-04 13:29:27,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:27,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2018-02-04 13:29:27,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,271 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:27,271 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 38 treesize of output 35 [2018-02-04 13:29:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:27,274 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 28 treesize of output 30 [2018-02-04 13:29:27,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,286 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 50 treesize of output 46 [2018-02-04 13:29:27,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-04 13:29:27,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:27,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 13:29:27,291 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,294 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,301 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:27,301 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 49 treesize of output 48 [2018-02-04 13:29:27,302 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 29 treesize of output 22 [2018-02-04 13:29:27,303 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,306 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,317 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:76, output treesize:30 [2018-02-04 13:29:27,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 42 treesize of output 34 [2018-02-04 13:29:27,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-02-04 13:29:27,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40 [2018-02-04 13:29:27,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:29:27,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:27,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2018-02-04 13:29:27,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:27,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:27,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:29:27,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,494 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:27,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-02-04 13:29:27,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-02-04 13:29:27,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:27,503 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2018-02-04 13:29:27,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-02-04 13:29:27,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 13:29:27,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,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 11 treesize of output 3 [2018-02-04 13:29:27,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:27,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2018-02-04 13:29:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:29:27,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:27,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 36 [2018-02-04 13:29:27,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 13:29:27,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 13:29:27,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1104, Unknown=5, NotChecked=68, Total=1332 [2018-02-04 13:29:27,570 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 37 states. [2018-02-04 13:29:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:28,315 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2018-02-04 13:29:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:29:28,316 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2018-02-04 13:29:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:28,316 INFO L225 Difference]: With dead ends: 117 [2018-02-04 13:29:28,316 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 13:29:28,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=409, Invalid=2894, Unknown=7, NotChecked=112, Total=3422 [2018-02-04 13:29:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 13:29:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2018-02-04 13:29:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 13:29:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-02-04 13:29:28,318 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 69 [2018-02-04 13:29:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:28,318 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-02-04 13:29:28,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 13:29:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-02-04 13:29:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:29:28,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:28,319 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:28,319 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2029014615, now seen corresponding path program 1 times [2018-02-04 13:29:28,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:28,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:28,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:28,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:28,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:28,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:29:28,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:29:28,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:29:28,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:29:28,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:29:28,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:29:28,350 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 5 states. [2018-02-04 13:29:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:28,401 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 13:29:28,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:29:28,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-02-04 13:29:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:28,401 INFO L225 Difference]: With dead ends: 111 [2018-02-04 13:29:28,402 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 13:29:28,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:29:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 13:29:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 13:29:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 13:29:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-02-04 13:29:28,403 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 69 [2018-02-04 13:29:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:28,403 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-02-04 13:29:28,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:29:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-02-04 13:29:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 13:29:28,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:28,404 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:28,404 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash -32106665, now seen corresponding path program 1 times [2018-02-04 13:29:28,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:28,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:28,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:28,405 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:28,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:28,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:28,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:28,926 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:28,931 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:28,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:28,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 13:29:28,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:28,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:28,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:29:28,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 11 treesize of output 8 [2018-02-04 13:29:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:29:28,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:28,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:28,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:28,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 13:29:29,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,010 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 15 treesize of output 8 [2018-02-04 13:29:29,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-02-04 13:29:29,201 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base Int) (|append_#t~ite8.base| Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite8.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base)))) (= (select |c_old(#valid)| append_~item~0.base) 0))) is different from true [2018-02-04 13:29:29,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 13:29:29,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-02-04 13:29:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 13:29:29,237 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 19 [2018-02-04 13:29:29,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,248 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 41 [2018-02-04 13:29:29,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 13:29:29,250 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:28 [2018-02-04 13:29:29,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 13:29:29,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-04 13:29:29,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39 [2018-02-04 13:29:29,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-02-04 13:29:29,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-02-04 13:29:29,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:29,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:29,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:29,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:40 [2018-02-04 13:29:29,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 13:29:29,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-02-04 13:29:29,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-04 13:29:29,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-02-04 13:29:29,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:29,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 13:29:29,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:29:29,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:29:29,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 13:29:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 13:29:29,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:29,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2018-02-04 13:29:29,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 13:29:29,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 13:29:29,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1672, Unknown=5, NotChecked=82, Total=1892 [2018-02-04 13:29:29,570 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 44 states. [2018-02-04 13:29:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:30,713 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-02-04 13:29:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:29:30,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2018-02-04 13:29:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:30,714 INFO L225 Difference]: With dead ends: 127 [2018-02-04 13:29:30,714 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 13:29:30,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=386, Invalid=3768, Unknown=10, NotChecked=126, Total=4290 [2018-02-04 13:29:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 13:29:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2018-02-04 13:29:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 13:29:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-02-04 13:29:30,717 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 71 [2018-02-04 13:29:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:30,717 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-02-04 13:29:30,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 13:29:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-02-04 13:29:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 13:29:30,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:30,718 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:30,718 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash 918170282, now seen corresponding path program 1 times [2018-02-04 13:29:30,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:30,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:30,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:30,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:30,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:30,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:29:30,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:30,748 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:30,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:30,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:29:30,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:29:30,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-02-04 13:29:30,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:29:30,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:29:30,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:30,796 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 6 states. [2018-02-04 13:29:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:29:30,811 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-02-04 13:29:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:29:30,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-02-04 13:29:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:29:30,812 INFO L225 Difference]: With dead ends: 124 [2018-02-04 13:29:30,812 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 13:29:30,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:29:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 13:29:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-02-04 13:29:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 13:29:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-02-04 13:29:30,813 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 76 [2018-02-04 13:29:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:29:30,813 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-02-04 13:29:30,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:29:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-02-04 13:29:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 13:29:30,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:29:30,814 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:29:30,814 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 13:29:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1892144135, now seen corresponding path program 1 times [2018-02-04 13:29:30,814 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:29:30,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:29:30,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:30,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:30,815 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:29:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:30,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:29:32,360 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 80 DAG size of output 53 [2018-02-04 13:29:32,862 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 72 DAG size of output 61 [2018-02-04 13:29:33,243 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 100 DAG size of output 52 [2018-02-04 13:29:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:29:34,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:29:34,662 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:29:34,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:29:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:29:34,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:29:34,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:34,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:34,799 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:34,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:29:34,800 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:29:34,800 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#valid_100| term size 26 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 13:29:34,804 INFO L168 Benchmark]: Toolchain (without parser) took 71309.87 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 617.6 MB). Free memory was 360.2 MB in the beginning and 421.9 MB in the end (delta: -61.8 MB). Peak memory consumption was 555.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:29:34,805 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:29:34,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.49 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 349.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:29:34,805 INFO L168 Benchmark]: Boogie Preprocessor took 28.42 ms. Allocated memory is still 403.7 MB. Free memory was 349.6 MB in the beginning and 348.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:29:34,805 INFO L168 Benchmark]: RCFGBuilder took 385.44 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 317.8 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:29:34,805 INFO L168 Benchmark]: TraceAbstraction took 70736.95 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 617.6 MB). Free memory was 317.8 MB in the beginning and 421.9 MB in the end (delta: -104.2 MB). Peak memory consumption was 513.4 MB. Max. memory is 5.3 GB. [2018-02-04 13:29:34,807 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.49 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 349.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.42 ms. Allocated memory is still 403.7 MB. Free memory was 349.6 MB in the beginning and 348.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 385.44 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 317.8 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70736.95 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 617.6 MB). Free memory was 317.8 MB in the beginning and 421.9 MB in the end (delta: -104.2 MB). Peak memory consumption was 513.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#valid_100| term size 26 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#valid_100| term size 26: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-29-34-813.csv Received shutdown request...