java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:59:53,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:59:53,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:59:53,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:59:53,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:59:53,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:59:53,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:59:53,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:59:53,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:59:53,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:59:53,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:59:53,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:59:53,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:59:53,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:59:53,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:59:53,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:59:53,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:59:53,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:59:53,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:59:53,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:59:53,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:59:53,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:59:53,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:59:53,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:59:53,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:59:53,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:59:53,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:59:53,481 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:59:53,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:59:53,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:59:53,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:59:53,482 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-02 18:59:53,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:59:53,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:59:53,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:59:53,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:59:53,493 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:59:53,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:59:53,493 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:59:53,494 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:59:53,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:59:53,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:59:53,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:59:53,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:59:53,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:59:53,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:59:53,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:59:53,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:59:53,496 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:59:53,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:59:53,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:59:53,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:59:53,534 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:59:53,537 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:59:53,538 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:59:53,538 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:59:53,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-02-02 18:59:53,677 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:59:53,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:59:53,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:59:53,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:59:53,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:59:53,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd3f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53, skipping insertion in model container [2018-02-02 18:59:53,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,694 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:59:53,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:59:53,814 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:59:53,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:59:53,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53 WrapperNode [2018-02-02 18:59:53,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:59:53,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:59:53,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:59:53,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:59:53,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (1/1) ... [2018-02-02 18:59:53,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:59:53,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:59:53,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:59:53,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:59:53,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (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-02 18:59:53,909 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:59:53,909 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:59:53,909 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 18:59:53,909 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:59:53,909 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:59:53,909 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:59:53,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:59:54,242 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:59:54,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:59:54 BoogieIcfgContainer [2018-02-02 18:59:54,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:59:54,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:59:54,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:59:54,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:59:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:59:53" (1/3) ... [2018-02-02 18:59:54,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64952e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:59:54, skipping insertion in model container [2018-02-02 18:59:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:59:53" (2/3) ... [2018-02-02 18:59:54,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64952e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:59:54, skipping insertion in model container [2018-02-02 18:59:54,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:59:54" (3/3) ... [2018-02-02 18:59:54,246 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-02-02 18:59:54,251 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:59:54,256 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 18:59:54,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:59:54,285 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:59:54,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:59:54,285 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:59:54,285 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:59:54,285 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:59:54,286 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:59:54,286 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:59:54,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:59:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-02-02 18:59:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:59:54,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:54,305 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:54,305 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-02-02 18:59:54,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:54,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:54,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:54,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:54,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:54,430 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-02 18:59:54,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:54,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:54,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:54,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:54,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:54,448 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-02-02 18:59:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:54,697 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-02-02 18:59:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:59:54,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:59:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:54,708 INFO L225 Difference]: With dead ends: 161 [2018-02-02 18:59:54,708 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 18:59:54,710 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-02 18:59:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 18:59:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 18:59:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 18:59:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 18:59:54,753 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-02-02 18:59:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:54,753 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 18:59:54,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 18:59:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:59:54,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:54,754 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:54,754 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-02-02 18:59:54,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:54,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:54,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:54,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:54,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:54,804 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-02 18:59:54,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:54,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:54,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:54,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:54,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:54,807 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-02-02 18:59:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:54,910 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 18:59:54,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:59:54,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:59:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:54,912 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:59:54,912 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:59:54,913 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-02 18:59:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:59:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 18:59:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:59:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 18:59:54,920 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-02-02 18:59:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:54,920 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 18:59:54,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 18:59:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:59:54,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:54,921 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:54,921 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-02-02 18:59:54,922 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:54,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:54,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,923 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:54,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:54,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:54,961 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-02 18:59:54,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:54,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:54,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:54,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:54,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:54,962 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-02-02 18:59:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:55,060 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-02-02 18:59:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:59:55,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 18:59:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:55,062 INFO L225 Difference]: With dead ends: 136 [2018-02-02 18:59:55,062 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 18:59:55,062 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-02 18:59:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 18:59:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-02 18:59:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 18:59:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-02 18:59:55,069 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-02-02 18:59:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:55,070 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-02 18:59:55,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-02 18:59:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:59:55,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:55,071 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:55,071 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-02-02 18:59:55,071 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:55,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:55,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:55,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:55,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:55,122 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-02 18:59:55,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:55,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:55,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:55,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:55,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:55,123 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-02-02 18:59:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:55,245 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 18:59:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:59:55,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 18:59:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:55,246 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:59:55,246 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:59:55,247 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-02 18:59:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:59:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 18:59:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:59:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 18:59:55,252 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-02-02 18:59:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:55,253 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 18:59:55,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 18:59:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:59:55,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:55,253 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-02 18:59:55,254 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-02-02 18:59:55,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:55,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:55,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:55,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:55,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:55,304 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-02 18:59:55,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:55,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:55,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:55,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:55,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:55,305 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-02-02 18:59:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:55,385 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 18:59:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:59:55,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:59:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:55,386 INFO L225 Difference]: With dead ends: 119 [2018-02-02 18:59:55,386 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 18:59:55,386 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-02 18:59:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 18:59:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 18:59:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 18:59:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 18:59:55,391 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-02-02 18:59:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:55,391 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 18:59:55,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 18:59:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:59:55,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:55,392 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-02 18:59:55,392 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-02-02 18:59:55,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:55,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:55,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:55,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:55,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:55,442 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-02 18:59:55,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:55,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:55,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:59:55,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:59:55,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:59:55,443 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 18:59:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:55,493 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 18:59:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:59:55,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:59:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:55,494 INFO L225 Difference]: With dead ends: 114 [2018-02-02 18:59:55,495 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 18:59:55,495 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-02 18:59:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 18:59:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 18:59:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:59:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 18:59:55,499 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-02-02 18:59:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:55,499 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 18:59:55,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:59:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 18:59:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:59:55,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:55,500 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] [2018-02-02 18:59:55,500 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-02-02 18:59:55,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:55,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:55,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:55,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:55,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:55,607 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-02 18:59:55,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:55,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:59:55,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:59:55,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:59:55,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:59:55,608 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-02-02 18:59:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:55,830 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2018-02-02 18:59:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:59:55,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 18:59:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:55,831 INFO L225 Difference]: With dead ends: 177 [2018-02-02 18:59:55,831 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 18:59:55,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:59:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 18:59:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-02-02 18:59:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:59:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-02-02 18:59:55,837 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-02-02 18:59:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:55,837 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-02-02 18:59:55,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:59:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-02-02 18:59:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:59:55,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:55,838 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] [2018-02-02 18:59:55,838 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-02-02 18:59:55,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:55,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:55,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:55,840 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:55,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:55,984 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-02 18:59:55,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:55,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:59:55,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:59:55,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:59:55,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:59:55,986 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-02-02 18:59:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:56,181 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-02-02 18:59:56,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:59:56,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 18:59:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:56,183 INFO L225 Difference]: With dead ends: 187 [2018-02-02 18:59:56,183 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 18:59:56,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:59:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 18:59:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-02-02 18:59:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 18:59:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-02-02 18:59:56,186 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-02-02 18:59:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:56,186 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-02-02 18:59:56,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:59:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-02-02 18:59:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:59:56,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:56,186 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-02 18:59:56,186 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-02-02 18:59:56,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:56,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:56,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:56,187 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:56,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:56,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:56,405 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-02 18:59:56,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:56,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:59:56,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:59:56,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:59:56,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:59:56,407 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 13 states. [2018-02-02 18:59:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:56,748 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2018-02-02 18:59:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:59:56,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 18:59:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:56,749 INFO L225 Difference]: With dead ends: 228 [2018-02-02 18:59:56,749 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 18:59:56,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:59:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 18:59:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-02-02 18:59:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 18:59:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-02-02 18:59:56,754 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-02-02 18:59:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:56,754 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-02-02 18:59:56,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:59:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-02-02 18:59:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:59:56,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:56,755 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] [2018-02-02 18:59:56,755 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-02-02 18:59:56,755 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:56,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:56,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:56,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:56,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:56,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:57,088 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-02 18:59:57,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:57,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:59:57,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:59:57,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:59:57,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:59:57,091 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 13 states. [2018-02-02 18:59:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:57,509 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2018-02-02 18:59:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:59:57,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 18:59:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:57,510 INFO L225 Difference]: With dead ends: 176 [2018-02-02 18:59:57,510 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 18:59:57,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:59:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 18:59:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-02-02 18:59:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 18:59:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-02-02 18:59:57,514 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-02-02 18:59:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:57,515 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-02-02 18:59:57,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:59:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-02-02 18:59:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 18:59:57,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:57,516 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-02 18:59:57,516 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-02-02 18:59:57,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:57,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:57,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:57,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:57,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:57,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:57,561 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-02 18:59:57,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:59:57,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:59:57,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:59:57,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:59:57,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:59:57,562 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-02-02 18:59:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:57,575 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-02-02 18:59:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:59:57,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-02-02 18:59:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:57,577 INFO L225 Difference]: With dead ends: 155 [2018-02-02 18:59:57,577 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 18:59:57,577 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-02 18:59:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 18:59:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-02-02 18:59:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 18:59:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-02 18:59:57,581 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-02-02 18:59:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:57,581 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-02 18:59:57,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:59:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-02 18:59:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:59:57,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:57,582 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:57,582 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-02-02 18:59:57,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:57,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:57,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:57,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:57,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:57,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:59:57,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:59:57,724 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-02 18:59:57,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:57,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:59:57,838 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|))) is different from true [2018-02-02 18:59:57,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:57,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:57,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:59:57,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:57,886 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-02 18:59:57,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 18:59:57,952 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 17 treesize of output 20 [2018-02-02 18:59:57,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:57,961 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-02 18:59:57,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-02-02 18:59:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 18:59:58,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:59:58,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 18:59:58,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:59:58,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:59:58,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2018-02-02 18:59:58,066 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 18 states. [2018-02-02 18:59:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:59:58,706 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-02-02 18:59:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:59:58,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-02-02 18:59:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:59:58,707 INFO L225 Difference]: With dead ends: 177 [2018-02-02 18:59:58,707 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 18:59:58,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=440, Unknown=1, NotChecked=44, Total=600 [2018-02-02 18:59:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 18:59:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2018-02-02 18:59:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 18:59:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-02-02 18:59:58,712 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 43 [2018-02-02 18:59:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:59:58,712 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-02-02 18:59:58,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:59:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-02-02 18:59:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:59:58,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:59:58,713 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:59:58,713 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:59:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244566, now seen corresponding path program 1 times [2018-02-02 18:59:58,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:59:58,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:59:58,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:58,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:58,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:59:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:58,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:59:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:59:58,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:59:58,891 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-02 18:59:58,896 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:59:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:59:58,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:59:59,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-02 18:59:59,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:59,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:59:59,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:59,031 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-02 18:59:59,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-02-02 18:59:59,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:59:59,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:59:59,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:59,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-02-02 18:59:59,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:59:59,143 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-02 18:59:59,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-02-02 18:59:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:59:59,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:59:59,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-02 18:59:59,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:59:59,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:59:59,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=293, Unknown=3, NotChecked=0, Total=342 [2018-02-02 18:59:59,244 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 19 states. [2018-02-02 19:00:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:00,585 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 19:00:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:00:00,585 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-02-02 19:00:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:00,586 INFO L225 Difference]: With dead ends: 167 [2018-02-02 19:00:00,586 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 19:00:00,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=504, Unknown=4, NotChecked=0, Total=600 [2018-02-02 19:00:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 19:00:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-02-02 19:00:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 19:00:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-02-02 19:00:00,590 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 43 [2018-02-02 19:00:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:00,590 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-02-02 19:00:00,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:00:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-02-02 19:00:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:00:00,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:00,591 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:00,591 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 570613669, now seen corresponding path program 1 times [2018-02-02 19:00:00,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:00,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:00,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:00,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:00,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:00,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:01,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:01,233 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-02 19:00:01,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:01,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:01,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 19:00:01,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 19:00:01,595 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-02 19:00:01,597 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-02 19:00:01,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-02 19:00:01,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-02 19:00:01,636 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-02 19:00:01,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 19:00:01,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:01,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:01,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:01,681 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-02-02 19:00:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-02-02 19:00:01,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 76 [2018-02-02 19:00:01,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:01,765 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 3 case distinctions, treesize of input 39 treesize of output 54 [2018-02-02 19:00:01,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:01,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:01,821 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 33 treesize of output 28 [2018-02-02 19:00:01,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:01,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-02 19:00:01,828 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:01,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-02 19:00:01,850 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-02-02 19:00:01,943 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:01,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-02 19:00:02,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:02,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-02-02 19:00:02,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 19:00:02,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:02,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-02-02 19:00:02,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-02-02 19:00:02,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:02,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,454 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-02 19:00:02,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82 [2018-02-02 19:00:02,567 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 75 treesize of output 73 [2018-02-02 19:00:02,569 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-02 19:00:02,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:02,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-02-02 19:00:02,685 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 75 treesize of output 73 [2018-02-02 19:00:02,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, 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-02 19:00:02,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:02,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-02-02 19:00:02,844 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 19:00:02,846 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-02 19:00:02,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:02,855 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 15 treesize of output 8 [2018-02-02 19:00:02,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,862 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:02,863 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 33 treesize of output 21 [2018-02-02 19:00:02,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:02,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:02,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-02-02 19:00:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:02,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:02,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-02-02 19:00:02,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:00:02,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:00:02,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:00:02,934 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 42 states. [2018-02-02 19:00:05,370 WARN L146 SmtUtils]: Spent 329ms on a formula simplification. DAG size of input: 97 DAG size of output 69 [2018-02-02 19:00:05,620 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 106 DAG size of output 72 [2018-02-02 19:00:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:06,561 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-02-02 19:00:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:00:06,561 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-02-02 19:00:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:06,562 INFO L225 Difference]: With dead ends: 198 [2018-02-02 19:00:06,562 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 19:00:06,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=663, Invalid=4739, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 19:00:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 19:00:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143. [2018-02-02 19:00:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:00:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 19:00:06,568 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 50 [2018-02-02 19:00:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:06,568 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 19:00:06,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:00:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 19:00:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:00:06,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:06,569 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:06,569 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 570613670, now seen corresponding path program 1 times [2018-02-02 19:00:06,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:06,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:06,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:06,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:06,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:06,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:07,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:07,195 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 19:00:07,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:07,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 19:00:07,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 19:00:07,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 6 treesize of output 5 [2018-02-02 19:00:07,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-02 19:00:07,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:00:07,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:00:07,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,433 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-02 19:00:07,434 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-02 19:00:07,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,441 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-02 19:00:07,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-02-02 19:00:07,477 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 23 treesize of output 53 [2018-02-02 19:00:07,479 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 36 treesize of output 35 [2018-02-02 19:00:07,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2018-02-02 19:00:07,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,533 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 47 treesize of output 57 [2018-02-02 19:00:07,535 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 48 treesize of output 47 [2018-02-02 19:00:07,535 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,559 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:07,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 19:00:07,562 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:07,563 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 38 treesize of output 29 [2018-02-02 19:00:07,564 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,568 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:00:07,586 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:66, output treesize:110 [2018-02-02 19:00:07,644 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:07,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 135 [2018-02-02 19:00:07,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,679 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 139 treesize of output 166 [2018-02-02 19:00:07,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 144 [2018-02-02 19:00:07,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,831 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 147 treesize of output 147 [2018-02-02 19:00:07,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,845 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 140 treesize of output 167 [2018-02-02 19:00:07,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 153 [2018-02-02 19:00:07,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:07,921 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 112 treesize of output 93 [2018-02-02 19:00:07,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:07,924 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:07,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 54 [2018-02-02 19:00:07,927 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,935 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:07,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 19:00:07,986 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:249, output treesize:210 [2018-02-02 19:00:08,049 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:08,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,071 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 17 treesize of output 10 [2018-02-02 19:00:08,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,085 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 1 xjuncts. [2018-02-02 19:00:08,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:226, output treesize:150 [2018-02-02 19:00:08,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-02-02 19:00:08,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,245 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-02 19:00:08,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,259 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-02 19:00:08,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:144 [2018-02-02 19:00:08,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 150 [2018-02-02 19:00:08,371 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 141 treesize of output 129 [2018-02-02 19:00:08,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,419 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 4 case distinctions, treesize of input 110 treesize of output 146 [2018-02-02 19:00:08,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:08,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:08,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2018-02-02 19:00:08,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,557 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 39 treesize of output 78 [2018-02-02 19:00:08,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 152 [2018-02-02 19:00:08,611 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 152 treesize of output 140 [2018-02-02 19:00:08,612 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,662 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 4 case distinctions, treesize of input 110 treesize of output 146 [2018-02-02 19:00:08,662 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:08,701 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:08,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2018-02-02 19:00:08,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 78 [2018-02-02 19:00:08,709 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 19:00:08,756 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:174, output treesize:323 [2018-02-02 19:00:08,882 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 115 treesize of output 116 [2018-02-02 19:00:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:08,887 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 51 [2018-02-02 19:00:08,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:08,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,082 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 123 treesize of output 118 [2018-02-02 19:00:09,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,087 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 24 treesize of output 39 [2018-02-02 19:00:09,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,267 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 115 treesize of output 116 [2018-02-02 19:00:09,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,271 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 51 [2018-02-02 19:00:09,271 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 196 [2018-02-02 19:00:09,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 221 [2018-02-02 19:00:09,467 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:09,607 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 167 treesize of output 166 [2018-02-02 19:00:09,607 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,694 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:09,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-02-02 19:00:09,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,834 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:09,836 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 37 treesize of output 78 [2018-02-02 19:00:09,836 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,853 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:09,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-02-02 19:00:09,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:09,881 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 4 case distinctions, treesize of input 156 treesize of output 207 [2018-02-02 19:00:09,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:09,991 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 163 treesize of output 162 [2018-02-02 19:00:09,991 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,078 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:10,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-02-02 19:00:10,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:10,086 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:10,088 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 37 treesize of output 78 [2018-02-02 19:00:10,088 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,104 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,231 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 123 treesize of output 118 [2018-02-02 19:00:10,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:10,234 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 24 treesize of output 39 [2018-02-02 19:00:10,234 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,249 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-02-02 19:00:10,347 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:401, output treesize:529 [2018-02-02 19:00:10,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2018-02-02 19:00:10,537 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 177 treesize of output 176 [2018-02-02 19:00:10,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:10,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 138 [2018-02-02 19:00:11,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:11,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 36 treesize of output 63 [2018-02-02 19:00:11,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:11,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:11,693 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:11,694 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 155 treesize of output 138 [2018-02-02 19:00:11,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-02-02 19:00:11,696 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:11,708 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,045 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 155 treesize of output 141 [2018-02-02 19:00:12,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:12,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:12,048 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,338 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 155 treesize of output 141 [2018-02-02 19:00:12,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:12,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:12,341 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,354 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2018-02-02 19:00:12,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:12,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:12,584 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,597 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 128 [2018-02-02 19:00:12,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:12,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:12,767 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,780 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,919 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:12,921 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 124 treesize of output 110 [2018-02-02 19:00:12,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-02-02 19:00:12,923 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:12,931 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-02-02 19:00:13,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 173 treesize of output 172 [2018-02-02 19:00:13,055 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,109 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,205 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 145 treesize of output 128 [2018-02-02 19:00:13,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:13,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:13,208 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,220 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 10 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-02-02 19:00:13,305 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 17 variables, input treesize:791, output treesize:661 [2018-02-02 19:00:13,493 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 153 treesize of output 134 [2018-02-02 19:00:13,495 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,495 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 63 treesize of output 47 [2018-02-02 19:00:13,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:13,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-02-02 19:00:13,513 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 93 [2018-02-02 19:00:13,574 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,574 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 54 treesize of output 38 [2018-02-02 19:00:13,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,584 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-02 19:00:13,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,637 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 63 treesize of output 56 [2018-02-02 19:00:13,638 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,639 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 25 treesize of output 17 [2018-02-02 19:00:13,639 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-02 19:00:13,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,653 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-02-02 19:00:13,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:13,700 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 23 treesize of output 16 [2018-02-02 19:00:13,700 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,709 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,709 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 24 treesize of output 16 [2018-02-02 19:00:13,710 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,716 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,755 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 153 treesize of output 134 [2018-02-02 19:00:13,757 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,757 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 63 treesize of output 47 [2018-02-02 19:00:13,757 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:13,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-02-02 19:00:13,771 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,781 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-02-02 19:00:13,812 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:13,812 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 46 treesize of output 30 [2018-02-02 19:00:13,812 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:13,821 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 15 treesize of output 8 [2018-02-02 19:00:13,821 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,827 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:13,847 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:418, output treesize:14 [2018-02-02 19:00:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:13,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:13,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-02-02 19:00:13,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:00:13,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:00:13,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:00:13,910 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 41 states. [2018-02-02 19:00:17,866 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 93 DAG size of output 68 [2018-02-02 19:00:18,054 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 120 DAG size of output 108 [2018-02-02 19:00:19,071 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 227 DAG size of output 94 [2018-02-02 19:00:19,450 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 193 DAG size of output 73 [2018-02-02 19:00:19,746 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 232 DAG size of output 99 [2018-02-02 19:00:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:21,194 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-02-02 19:00:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 19:00:21,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-02-02 19:00:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:21,195 INFO L225 Difference]: With dead ends: 195 [2018-02-02 19:00:21,195 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 19:00:21,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=529, Invalid=4301, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 19:00:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 19:00:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2018-02-02 19:00:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:00:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 19:00:21,200 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 50 [2018-02-02 19:00:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:21,201 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 19:00:21,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:00:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 19:00:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:00:21,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:21,201 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:21,202 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1254680052, now seen corresponding path program 1 times [2018-02-02 19:00:21,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:21,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:21,202 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:21,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:21,203 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:21,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:21,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:21,857 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-02 19:00:21,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:21,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:21,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:21,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:21,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 19:00:21,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-02 19:00:21,931 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-02 19:00:21,932 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-02 19:00:21,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,939 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-02 19:00:21,940 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-02 19:00:21,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-02-02 19:00:21,952 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 26 treesize of output 21 [2018-02-02 19:00:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:21,957 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-02 19:00:21,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,971 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 26 treesize of output 21 [2018-02-02 19:00:21,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:21,975 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-02 19:00:21,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:21,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:42 [2018-02-02 19:00:22,105 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-02 19:00:22,121 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-02 19:00:22,134 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-02 19:00:22,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:22,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:22,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-02-02 19:00:22,376 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (append_~node~0.base Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_2)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse4 append_~node~0.base))))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0)))) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|) (= |c_#memory_$Pointer$.offset| (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_4)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse4 append_~node~0.offset))))) (store .cse5 append_~node~0.base (store (store (select .cse5 append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-02-02 19:00:22,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:00:22,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,493 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 93 treesize of output 73 [2018-02-02 19:00:22,529 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-02 19:00:22,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-02-02 19:00:22,622 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 13 treesize of output 16 [2018-02-02 19:00:22,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,627 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-02 19:00:22,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,681 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 58 treesize of output 65 [2018-02-02 19:00:22,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,688 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 21 treesize of output 33 [2018-02-02 19:00:22,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-02-02 19:00:22,697 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,711 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,755 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-02 19:00:22,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-02-02 19:00:22,782 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 43 treesize of output 46 [2018-02-02 19:00:22,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,798 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 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 19:00:22,799 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:22,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-02 19:00:22,851 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:22,892 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:22,980 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 56 treesize of output 56 [2018-02-02 19:00:22,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,987 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 28 treesize of output 52 [2018-02-02 19:00:22,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:22,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 19:00:23,000 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,017 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,037 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,044 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 58 treesize of output 56 [2018-02-02 19:00:23,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 19:00:23,072 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:23,073 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 19:00:23,165 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:23,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 19:00:23,251 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,324 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-02-02 19:00:23,333 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,391 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:23,453 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:23,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-02 19:00:23,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,468 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 28 treesize of output 50 [2018-02-02 19:00:23,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:23,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 19:00:23,480 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,494 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,519 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:23,650 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 19:00:23,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 19:00:23,987 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 93 treesize of output 73 [2018-02-02 19:00:24,030 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-02 19:00:24,030 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,077 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 59 treesize of output 67 [2018-02-02 19:00:24,081 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 13 treesize of output 16 [2018-02-02 19:00:24,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,084 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 16 treesize of output 23 [2018-02-02 19:00:24,084 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,090 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,112 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 58 treesize of output 65 [2018-02-02 19:00:24,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,115 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 21 treesize of output 29 [2018-02-02 19:00:24,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 19:00:24,120 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,128 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,148 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,159 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-02-02 19:00:24,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-02-02 19:00:24,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-02 19:00:24,187 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 19:00:24,229 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:24,261 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:24,315 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 56 treesize of output 56 [2018-02-02 19:00:24,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,326 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 28 treesize of output 52 [2018-02-02 19:00:24,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 19:00:24,372 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,399 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,409 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,416 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 58 treesize of output 56 [2018-02-02 19:00:24,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 19:00:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-02-02 19:00:24,467 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:24,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 19:00:24,561 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,609 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 19:00:24,613 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,648 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:24,686 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:24,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-02 19:00:24,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-02-02 19:00:24,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:24,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 19:00:24,709 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,720 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,737 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:24,804 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 19:00:24,893 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 19:00:25,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 26 dim-0 vars, and 13 xjuncts. [2018-02-02 19:00:25,100 INFO L202 ElimStorePlain]: Needed 49 recursive calls to eliminate 9 variables, input treesize:205, output treesize:1434 [2018-02-02 19:00:25,544 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 375 DAG size of output 43 [2018-02-02 19:00:25,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 19:00:25,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:25,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:81 [2018-02-02 19:00:25,781 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 50 treesize of output 59 [2018-02-02 19:00:25,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:25,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,817 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 50 treesize of output 59 [2018-02-02 19:00:25,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:25,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:25,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:73 [2018-02-02 19:00:25,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 19:00:25,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-02 19:00:25,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,897 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 15 treesize of output 8 [2018-02-02 19:00:25,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 19:00:25,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-02 19:00:25,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:25,925 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 15 treesize of output 8 [2018-02-02 19:00:25,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:25,931 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:87, output treesize:7 [2018-02-02 19:00:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:26,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:26,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 39 [2018-02-02 19:00:26,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 19:00:26,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 19:00:26,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1277, Unknown=11, NotChecked=72, Total=1482 [2018-02-02 19:00:26,016 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 39 states. [2018-02-02 19:00:27,440 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-02-02 19:00:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:30,530 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2018-02-02 19:00:30,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:00:30,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-02-02 19:00:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:30,531 INFO L225 Difference]: With dead ends: 237 [2018-02-02 19:00:30,531 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 19:00:30,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=358, Invalid=2907, Unknown=45, NotChecked=112, Total=3422 [2018-02-02 19:00:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 19:00:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-02-02 19:00:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 19:00:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-02-02 19:00:30,535 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 52 [2018-02-02 19:00:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:30,535 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-02-02 19:00:30,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 19:00:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-02-02 19:00:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 19:00:30,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:30,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:30,536 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1222988087, now seen corresponding path program 1 times [2018-02-02 19:00:30,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:30,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:30,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:30,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:30,537 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:30,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:31,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:31,259 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-02 19:00:31,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:31,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:31,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 19:00:31,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 19:00:31,377 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-02 19:00:31,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:00:31,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 19:00:31,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:00:31,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-02-02 19:00:31,521 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-02 19:00:31,523 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-02 19:00:31,534 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-02 19:00:31,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:31,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:31,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-02-02 19:00:31,732 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (append_~node~0.base Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_8)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse4 append_~node~0.base))))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.base|) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_6)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse4 append_~node~0.offset))))) (store .cse5 append_~node~0.base (store (store (select .cse5 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-02-02 19:00:31,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:31,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:31,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:00:31,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-02-02 19:00:31,876 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-02 19:00:31,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:31,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-02-02 19:00:31,962 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 43 treesize of output 46 [2018-02-02 19:00:31,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:31,981 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 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 19:00:31,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:32,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,036 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 40 treesize of output 44 [2018-02-02 19:00:32,036 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:32,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-02-02 19:00:32,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,149 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 28 treesize of output 50 [2018-02-02 19:00:32,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 19:00:32,159 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,171 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,181 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,191 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 51 treesize of output 49 [2018-02-02 19:00:32,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 19:00:32,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-02-02 19:00:32,259 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:32,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,387 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:32,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-02-02 19:00:32,393 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 19:00:32,461 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,516 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:32,565 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:32,572 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 49 treesize of output 49 [2018-02-02 19:00:32,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,579 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 28 treesize of output 52 [2018-02-02 19:00:32,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 19:00:32,592 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,607 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,618 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 19:00:32,787 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 52 treesize of output 60 [2018-02-02 19:00:32,789 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 13 treesize of output 16 [2018-02-02 19:00:32,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,794 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-02 19:00:32,794 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,804 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,847 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 51 treesize of output 58 [2018-02-02 19:00:32,850 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,853 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 21 treesize of output 33 [2018-02-02 19:00:32,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:32,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-02-02 19:00:32,862 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,876 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,896 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:32,916 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 19:00:33,240 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 86 treesize of output 66 [2018-02-02 19:00:33,268 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-02 19:00:33,268 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,313 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 52 treesize of output 60 [2018-02-02 19:00:33,316 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 13 treesize of output 16 [2018-02-02 19:00:33,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,319 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 16 treesize of output 23 [2018-02-02 19:00:33,319 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,326 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-02-02 19:00:33,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,349 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 21 treesize of output 29 [2018-02-02 19:00:33,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 19:00:33,355 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,361 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,371 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,379 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-02-02 19:00:33,405 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 43 treesize of output 46 [2018-02-02 19:00:33,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 19:00:33,426 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:33,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-02 19:00:33,470 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,500 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:33,540 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 49 treesize of output 49 [2018-02-02 19:00:33,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,546 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 28 treesize of output 52 [2018-02-02 19:00:33,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 19:00:33,568 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,579 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,590 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,597 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 51 treesize of output 49 [2018-02-02 19:00:33,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 19:00:33,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-02-02 19:00:33,650 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:33,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,704 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:33,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 19:00:33,708 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 19:00:33,785 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,822 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:33,863 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:00:33,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-02-02 19:00:33,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,887 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 28 treesize of output 50 [2018-02-02 19:00:33,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:33,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 19:00:33,897 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,908 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,917 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:33,975 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 19:00:34,042 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 19:00:34,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 12 xjuncts. [2018-02-02 19:00:34,192 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:194, output treesize:1187 [2018-02-02 19:00:38,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:38,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:38,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:38,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 19:00:38,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:38,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:38,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:73 [2018-02-02 19:00:39,067 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 43 treesize of output 52 [2018-02-02 19:00:39,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:39,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,091 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 43 treesize of output 52 [2018-02-02 19:00:39,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:39,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:39,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:65 [2018-02-02 19:00:39,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-02 19:00:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:39,221 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 15 treesize of output 8 [2018-02-02 19:00:39,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,226 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:39,227 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 15 treesize of output 11 [2018-02-02 19:00:39,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-02 19:00:39,241 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:39,241 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 15 treesize of output 11 [2018-02-02 19:00:39,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:39,246 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 15 treesize of output 8 [2018-02-02 19:00:39,246 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:39,254 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:86, output treesize:7 [2018-02-02 19:00:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:00:39,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:39,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2018-02-02 19:00:39,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 19:00:39,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 19:00:39,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1656, Unknown=13, NotChecked=82, Total=1892 [2018-02-02 19:00:39,361 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 44 states. [2018-02-02 19:00:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:44,063 INFO L93 Difference]: Finished difference Result 229 states and 245 transitions. [2018-02-02 19:00:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:00:44,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-02-02 19:00:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:44,064 INFO L225 Difference]: With dead ends: 229 [2018-02-02 19:00:44,064 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 19:00:44,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=412, Invalid=3697, Unknown=55, NotChecked=126, Total=4290 [2018-02-02 19:00:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 19:00:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 169. [2018-02-02 19:00:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 19:00:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2018-02-02 19:00:44,068 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 54 [2018-02-02 19:00:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:44,069 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2018-02-02 19:00:44,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 19:00:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2018-02-02 19:00:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 19:00:44,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:44,069 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-02 19:00:44,069 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash -848788785, now seen corresponding path program 1 times [2018-02-02 19:00:44,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:44,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:44,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:44,071 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:44,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:44,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 19:00:44,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:44,112 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 19:00:44,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:44,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 19:00:44,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:44,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-02 19:00:44,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:00:44,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:00:44,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:00:44,174 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand 5 states. [2018-02-02 19:00:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:44,187 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2018-02-02 19:00:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:00:44,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-02-02 19:00:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:44,188 INFO L225 Difference]: With dead ends: 200 [2018-02-02 19:00:44,188 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 19:00:44,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-02 19:00:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 19:00:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2018-02-02 19:00:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 19:00:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2018-02-02 19:00:44,193 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 58 [2018-02-02 19:00:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:44,193 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2018-02-02 19:00:44,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:00:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2018-02-02 19:00:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 19:00:44,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:44,194 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:44,194 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 258761966, now seen corresponding path program 1 times [2018-02-02 19:00:44,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:44,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:44,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:44,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:44,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:44,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 19:00:44,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:44,962 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-02 19:00:44,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:45,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:45,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 19:00:45,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,117 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-02 19:00:45,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-02-02 19:00:45,373 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-02 19:00:45,376 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-02 19:00:45,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,386 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-02 19:00:45,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-02 19:00:45,429 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 23 treesize of output 35 [2018-02-02 19:00:45,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 19:00:45,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:45,452 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 20 treesize of output 19 [2018-02-02 19:00:45,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:45,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:00:45,476 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-02-02 19:00:45,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71 [2018-02-02 19:00:45,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:45,553 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 67 treesize of output 82 [2018-02-02 19:00:45,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:45,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2018-02-02 19:00:45,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:45,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:45,652 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 41 treesize of output 36 [2018-02-02 19:00:45,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:45,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-02 19:00:45,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:45,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 19:00:45,686 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-02-02 19:00:46,876 WARN L143 SmtUtils]: Spent 1140ms on a formula simplification that was a NOOP. DAG size: 61 [2018-02-02 19:00:46,880 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:46,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:46,903 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 17 treesize of output 10 [2018-02-02 19:00:46,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:46,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:46,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-02-02 19:00:47,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:47,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:47,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:47,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 19:00:47,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:47,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-02-02 19:00:47,137 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 77 treesize of output 75 [2018-02-02 19:00:47,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 19:00:47,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,155 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-02 19:00:47,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-02-02 19:00:47,200 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 75 treesize of output 73 [2018-02-02 19:00:47,202 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-02 19:00:47,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:47,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-02-02 19:00:47,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-02-02 19:00:47,267 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-02 19:00:47,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:47,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-02-02 19:00:47,782 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 19:00:47,784 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:47,784 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 33 treesize of output 21 [2018-02-02 19:00:47,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,798 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-02 19:00:47,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:47,804 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 15 treesize of output 8 [2018-02-02 19:00:47,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:47,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:00:47,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-02-02 19:00:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 19:00:47,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:47,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2018-02-02 19:00:47,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 19:00:47,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 19:00:47,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2085, Unknown=14, NotChecked=0, Total=2256 [2018-02-02 19:00:47,880 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand 48 states. [2018-02-02 19:00:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:00:52,988 INFO L93 Difference]: Finished difference Result 294 states and 318 transitions. [2018-02-02 19:00:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 19:00:52,989 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 72 [2018-02-02 19:00:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:00:52,990 INFO L225 Difference]: With dead ends: 294 [2018-02-02 19:00:52,990 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 19:00:52,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=776, Invalid=5530, Unknown=14, NotChecked=0, Total=6320 [2018-02-02 19:00:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 19:00:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 209. [2018-02-02 19:00:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 19:00:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 232 transitions. [2018-02-02 19:00:52,995 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 232 transitions. Word has length 72 [2018-02-02 19:00:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:00:52,995 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 232 transitions. [2018-02-02 19:00:52,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 19:00:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 232 transitions. [2018-02-02 19:00:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 19:00:52,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:00:52,996 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:00:52,996 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:00:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 258761967, now seen corresponding path program 1 times [2018-02-02 19:00:52,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:00:52,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:00:52,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:52,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:52,997 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:00:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:53,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:00:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 19:00:53,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:00:53,788 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-02 19:00:53,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:00:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:00:53,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:00:53,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 19:00:53,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:53,915 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-02 19:00:53,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-02-02 19:00:53,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:00:53,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:53,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:53,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-02 19:00:54,031 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-02 19:00:54,032 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-02 19:00:54,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,041 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-02 19:00:54,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 19:00:54,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-02-02 19:00:54,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 53 [2018-02-02 19:00:54,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 19:00:54,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2018-02-02 19:00:54,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,156 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 47 treesize of output 57 [2018-02-02 19:00:54,158 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 48 treesize of output 47 [2018-02-02 19:00:54,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-02-02 19:00:54,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,211 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:54,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 19:00:54,214 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:54,215 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 38 treesize of output 29 [2018-02-02 19:00:54,215 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,239 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:60, output treesize:103 [2018-02-02 19:00:54,292 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 72 treesize of output 67 [2018-02-02 19:00:54,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-02 19:00:54,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,350 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 68 treesize of output 63 [2018-02-02 19:00:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-02 19:00:54,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 151 [2018-02-02 19:00:54,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 146 [2018-02-02 19:00:54,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,512 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 145 treesize of output 172 [2018-02-02 19:00:54,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,557 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,621 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 152 treesize of output 152 [2018-02-02 19:00:54,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,634 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 150 [2018-02-02 19:00:54,635 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,696 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 135 treesize of output 162 [2018-02-02 19:00:54,696 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,730 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:00:54,732 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 117 treesize of output 98 [2018-02-02 19:00:54,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,738 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:54,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 54 [2018-02-02 19:00:54,740 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,751 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:54,792 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-02-02 19:00:54,874 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:00:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:54,893 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 17 treesize of output 10 [2018-02-02 19:00:54,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:54,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:282, output treesize:141 [2018-02-02 19:00:55,071 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 37 treesize of output 26 [2018-02-02 19:00:55,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,085 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-02 19:00:55,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:152, output treesize:135 [2018-02-02 19:00:55,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 132 [2018-02-02 19:00:55,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2018-02-02 19:00:55,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,277 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 4 case distinctions, treesize of input 90 treesize of output 126 [2018-02-02 19:00:55,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:55,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:55,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 161 [2018-02-02 19:00:55,369 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 152 treesize of output 140 [2018-02-02 19:00:55,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,429 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 4 case distinctions, treesize of input 110 treesize of output 146 [2018-02-02 19:00:55,429 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:55,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:55,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2018-02-02 19:00:55,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,523 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 45 treesize of output 78 [2018-02-02 19:00:55,524 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,534 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2018-02-02 19:00:55,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,550 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 45 treesize of output 90 [2018-02-02 19:00:55,550 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,561 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:55,606 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:165, output treesize:308 [2018-02-02 19:00:55,707 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 112 treesize of output 107 [2018-02-02 19:00:55,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-02-02 19:00:55,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:55,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 168 [2018-02-02 19:00:55,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:55,857 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 4 case distinctions, treesize of input 151 treesize of output 202 [2018-02-02 19:00:55,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:55,971 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 158 treesize of output 157 [2018-02-02 19:00:55,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:56,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 173 [2018-02-02 19:00:56,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,205 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 4 case distinctions, treesize of input 147 treesize of output 198 [2018-02-02 19:00:56,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-02 19:00:56,308 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 154 treesize of output 153 [2018-02-02 19:00:56,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,372 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:56,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 134 [2018-02-02 19:00:56,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,381 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:56,383 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 43 treesize of output 90 [2018-02-02 19:00:56,384 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,399 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 134 [2018-02-02 19:00:56,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,408 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:56,410 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 43 treesize of output 76 [2018-02-02 19:00:56,410 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,425 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-02-02 19:00:56,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 51 [2018-02-02 19:00:56,567 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,580 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-02-02 19:00:56,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,701 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 24 treesize of output 39 [2018-02-02 19:00:56,701 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,714 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-02-02 19:00:56,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:56,814 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 51 [2018-02-02 19:00:56,814 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,836 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:56,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-02 19:00:56,915 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:386, output treesize:508 [2018-02-02 19:00:57,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 177 [2018-02-02 19:00:57,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 167 [2018-02-02 19:00:57,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:57,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:57,613 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 146 treesize of output 129 [2018-02-02 19:00:57,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:57,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:57,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:57,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 164 [2018-02-02 19:00:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 163 [2018-02-02 19:00:58,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,383 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:58,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 129 [2018-02-02 19:00:58,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-02-02 19:00:58,395 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,652 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:00:58,652 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 115 treesize of output 101 [2018-02-02 19:00:58,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-02-02 19:00:58,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,660 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 122 [2018-02-02 19:00:58,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:58,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:58,737 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,747 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 132 [2018-02-02 19:00:58,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:58,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:58,808 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,820 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,859 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 136 treesize of output 119 [2018-02-02 19:00:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:58,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-02-02 19:00:58,861 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,872 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:58,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 10 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:00:58,966 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:746, output treesize:337 [2018-02-02 19:00:59,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 118 [2018-02-02 19:00:59,056 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 63 treesize of output 40 [2018-02-02 19:00:59,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:59,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-02-02 19:00:59,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 114 [2018-02-02 19:00:59,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:59,115 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 23 treesize of output 16 [2018-02-02 19:00:59,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,125 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 62 treesize of output 39 [2018-02-02 19:00:59,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-02-02 19:00:59,163 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 23 [2018-02-02 19:00:59,164 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:59,171 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 15 treesize of output 8 [2018-02-02 19:00:59,171 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,175 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2018-02-02 19:00:59,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-02 19:00:59,209 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2018-02-02 19:00:59,219 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,227 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-02-02 19:00:59,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-02-02 19:00:59,250 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,255 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-02 19:00:59,255 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,259 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2018-02-02 19:00:59,279 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 10 [2018-02-02 19:00:59,279 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:00:59,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-02 19:00:59,286 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,291 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:00:59,303 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:391, output treesize:14 [2018-02-02 19:00:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 19:00:59,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:00:59,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2018-02-02 19:00:59,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 19:00:59,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 19:00:59,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2023, Unknown=6, NotChecked=0, Total=2162 [2018-02-02 19:00:59,374 INFO L87 Difference]: Start difference. First operand 209 states and 232 transitions. Second operand 47 states. [2018-02-02 19:01:00,441 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 129 DAG size of output 109 [2018-02-02 19:01:01,627 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 134 DAG size of output 75 [2018-02-02 19:01:01,798 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 126 DAG size of output 61 [2018-02-02 19:01:02,066 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 190 DAG size of output 70 [2018-02-02 19:01:02,314 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 139 DAG size of output 80 [2018-02-02 19:01:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:01:03,732 INFO L93 Difference]: Finished difference Result 291 states and 315 transitions. [2018-02-02 19:01:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:01:03,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-02-02 19:01:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:01:03,733 INFO L225 Difference]: With dead ends: 291 [2018-02-02 19:01:03,733 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 19:01:03,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=699, Invalid=5301, Unknown=6, NotChecked=0, Total=6006 [2018-02-02 19:01:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 19:01:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 209. [2018-02-02 19:01:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 19:01:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2018-02-02 19:01:03,738 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 72 [2018-02-02 19:01:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:01:03,739 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2018-02-02 19:01:03,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 19:01:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2018-02-02 19:01:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 19:01:03,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:01:03,739 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:01:03,739 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, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 19:01:03,740 INFO L82 PathProgramCache]: Analyzing trace with hash 775300632, now seen corresponding path program 1 times [2018-02-02 19:01:03,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:01:03,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:01:03,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:01:03,740 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:01:03,740 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:01:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:01:03,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:01:04,886 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 68 [2018-02-02 19:01:05,299 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-02-02 19:01:05,650 WARN L143 SmtUtils]: Spent 222ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-02 19:01:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:01:05,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:01:05,927 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-02 19:01:05,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:01:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:01:05,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:01:06,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:01:06,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:01:06,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:01:06,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-02 19:01:06,132 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-02 19:01:06,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 19:01:06,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,142 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-02 19:01:06,143 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-02 19:01:06,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-02-02 19:01:06,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 19:01:06,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:01:06,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 16 treesize of output 23 [2018-02-02 19:01:06,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-02 19:01:06,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:01:06,208 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-02 19:01:06,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:01:06,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-02-02 19:01:06,474 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-02 19:01:06,477 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-02 19:01:06,495 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-02 19:01:06,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:01:06,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:01:06,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:80 Received shutdown request... [2018-02-02 19:01:21,102 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 19:01:21,102 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:01:21,106 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:01:21,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:01:21 BoogieIcfgContainer [2018-02-02 19:01:21,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:01:21,107 INFO L168 Benchmark]: Toolchain (without parser) took 87430.21 ms. Allocated memory was 402.1 MB in the beginning and 961.0 MB in the end (delta: 558.9 MB). Free memory was 359.0 MB in the beginning and 640.6 MB in the end (delta: -281.6 MB). Peak memory consumption was 277.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:01:21,109 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:01:21,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.85 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:01:21,109 INFO L168 Benchmark]: Boogie Preprocessor took 31.18 ms. Allocated memory is still 402.1 MB. Free memory was 348.3 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:01:21,109 INFO L168 Benchmark]: RCFGBuilder took 371.62 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 310.1 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:01:21,109 INFO L168 Benchmark]: TraceAbstraction took 86863.81 ms. Allocated memory was 402.1 MB in the beginning and 961.0 MB in the end (delta: 558.9 MB). Free memory was 310.1 MB in the beginning and 640.6 MB in the end (delta: -330.5 MB). Peak memory consumption was 228.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:01:21,114 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.85 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.18 ms. Allocated memory is still 402.1 MB. Free memory was 348.3 MB in the beginning and 345.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.62 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 310.1 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 86863.81 ms. Allocated memory was 402.1 MB in the beginning and 961.0 MB in the end (delta: 558.9 MB). Free memory was 310.1 MB in the beginning and 640.6 MB in the end (delta: -330.5 MB). Peak memory consumption was 228.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 131 locations, 55 error locations. TIMEOUT Result, 86.8s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 33.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1679 SDtfs, 6293 SDslu, 12235 SDs, 0 SdLazy, 14720 SolverSat, 1212 SolverUnsat, 163 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 388 SyntacticMatches, 53 SemanticMatches, 544 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7172 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 665 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1183 ConstructedInterpolants, 170 QuantifiedInterpolants, 1782441 SizeOfPredicates, 144 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 56/272 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-01-21-122.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-01-21-122.csv Completed graceful shutdown