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/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:30:41,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:30:41,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:30:41,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:30:41,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:30:41,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:30:41,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:30:41,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:30:41,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:30:41,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:30:41,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:30:41,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:30:41,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:30:41,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:30:41,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:30:41,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:30:41,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:30:41,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:30:41,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:30:41,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:30:41,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:30:41,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:30:41,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:30:41,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:30:41,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:30:41,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:30:41,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:30:41,576 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:30:41,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:30:41,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:30:41,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:30:41,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:30:41,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:30:41,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:30:41,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:30:41,587 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:30:41,587 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:30:41,587 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:30:41,587 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:30:41,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:30:41,588 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:30:41,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:30:41,588 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:30:41,589 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:30:41,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:30:41,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:30:41,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:30:41,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:30:41,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:30:41,590 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:30:41,591 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:30:41,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:30:41,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:30:41,591 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:30:41,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:30:41,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:30:41,592 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:30:41,592 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:30:41,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:30:41,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:30:41,592 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:30:41,593 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:30:41,593 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:30:41,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:30:41,640 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:30:41,644 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:30:41,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:30:41,645 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:30:41,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-23 14:30:41,866 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:30:41,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:30:41,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:30:41,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:30:41,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:30:41,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:30:41" (1/1) ... [2018-01-23 14:30:41,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646b4c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:41, skipping insertion in model container [2018-01-23 14:30:41,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:30:41" (1/1) ... [2018-01-23 14:30:41,894 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:30:41,933 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:30:42,055 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:30:42,076 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:30:42,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42 WrapperNode [2018-01-23 14:30:42,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:30:42,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:30:42,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:30:42,088 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:30:42,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... [2018-01-23 14:30:42,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:30:42,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:30:42,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:30:42,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:30:42,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (1/1) ... No working directory specified, using /storage/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-01-23 14:30:42,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:30:42,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:30:42,175 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:30:42,176 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:30:42,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:30:42,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:30:42,553 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:30:42,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:30:42 BoogieIcfgContainer [2018-01-23 14:30:42,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:30:42,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:30:42,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:30:42,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:30:42,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:30:41" (1/3) ... [2018-01-23 14:30:42,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e665c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:30:42, skipping insertion in model container [2018-01-23 14:30:42,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:42" (2/3) ... [2018-01-23 14:30:42,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e665c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:30:42, skipping insertion in model container [2018-01-23 14:30:42,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:30:42" (3/3) ... [2018-01-23 14:30:42,562 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-23 14:30:42,571 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:30:42,578 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:30:42,618 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:42,618 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:42,618 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:42,618 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:42,618 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:42,618 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:42,618 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:42,618 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:30:42,619 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-23 14:30:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:30:42,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:42,649 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:30:42,649 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:30:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 185475, now seen corresponding path program 1 times [2018-01-23 14:30:42,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:42,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:42,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:42,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:42,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:42,760 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:30:42,766 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:42,772 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:42,773 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:42,773 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:42,773 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:42,773 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:42,773 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:42,773 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:42,773 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:30:42,773 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-23 14:30:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-23 14:30:42,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:42,777 INFO L322 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-01-23 14:30:42,777 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1602735979, now seen corresponding path program 1 times [2018-01-23 14:30:42,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:42,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:42,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:42,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:42,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:42,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:42,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:42,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:30:42,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:30:42,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:30:42,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:42,957 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 2 states. [2018-01-23 14:30:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:42,984 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2018-01-23 14:30:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:30:42,986 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-23 14:30:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:42,998 INFO L225 Difference]: With dead ends: 173 [2018-01-23 14:30:42,999 INFO L226 Difference]: Without dead ends: 89 [2018-01-23 14:30:43,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-23 14:30:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-23 14:30:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:30:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-23 14:30:43,040 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 21 [2018-01-23 14:30:43,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,040 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-23 14:30:43,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:30:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-23 14:30:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:30:43,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,041 INFO L322 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] [2018-01-23 14:30:43,042 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash 553744969, now seen corresponding path program 1 times [2018-01-23 14:30:43,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:43,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:43,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:30:43,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:30:43,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:30:43,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:30:43,158 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 4 states. [2018-01-23 14:30:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:43,217 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-01-23 14:30:43,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:30:43,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-23 14:30:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:43,219 INFO L225 Difference]: With dead ends: 98 [2018-01-23 14:30:43,219 INFO L226 Difference]: Without dead ends: 93 [2018-01-23 14:30:43,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:30:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-23 14:30:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-01-23 14:30:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:30:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-23 14:30:43,230 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2018-01-23 14:30:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,230 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-23 14:30:43,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:30:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-23 14:30:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:30:43,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,232 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:43,233 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1841085354, now seen corresponding path program 1 times [2018-01-23 14:30:43,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:43,312 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:30:43,320 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:43,327 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:43,328 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:43,345 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:43,345 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:43,345 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:43,346 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:43,346 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:43,346 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:43,346 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:43,346 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:30:43,346 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-23 14:30:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:30:43,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,350 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:43,350 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2000564629, now seen corresponding path program 1 times [2018-01-23 14:30:43,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:43,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:43,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:30:43,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:30:43,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:30:43,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:43,378 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 2 states. [2018-01-23 14:30:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:43,387 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2018-01-23 14:30:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:30:43,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-23 14:30:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:43,389 INFO L225 Difference]: With dead ends: 173 [2018-01-23 14:30:43,389 INFO L226 Difference]: Without dead ends: 87 [2018-01-23 14:30:43,390 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-23 14:30:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-23 14:30:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:30:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-23 14:30:43,398 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-23 14:30:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,399 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-23 14:30:43,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:30:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-23 14:30:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:30:43,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,400 INFO L322 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] [2018-01-23 14:30:43,400 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1791600567, now seen corresponding path program 1 times [2018-01-23 14:30:43,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:43,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:43,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:30:43,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:30:43,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:30:43,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:30:43,451 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 4 states. [2018-01-23 14:30:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:43,493 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-23 14:30:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:30:43,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-23 14:30:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:43,495 INFO L225 Difference]: With dead ends: 94 [2018-01-23 14:30:43,495 INFO L226 Difference]: Without dead ends: 91 [2018-01-23 14:30:43,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:30:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-23 14:30:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-23 14:30:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:30:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-23 14:30:43,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 22 [2018-01-23 14:30:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,501 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-23 14:30:43,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:30:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-23 14:30:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:30:43,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,503 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:43,503 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2138226282, now seen corresponding path program 1 times [2018-01-23 14:30:43,503 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:44,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:44,278 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:30:44,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:44,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:44,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-23 14:30:44,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:30:44,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:54 [2018-01-23 14:30:44,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-01-23 14:30:44,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2018-01-23 14:30:44,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:44,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:44,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:44,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:69 [2018-01-23 14:30:45,050 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (let ((.cse1 (store .cse0 main_~st~4.base 0))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store .cse1 main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= (select .cse1 main_~n~4.base) 1) (= 0 (select |c_old(#valid)| main_~n~4.base)))))) is different from true [2018-01-23 14:30:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:30:45,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:45,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-23 14:30:45,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:30:45,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:30:45,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=419, Unknown=2, NotChecked=40, Total=506 [2018-01-23 14:30:45,091 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 23 states. [2018-01-23 14:30:46,116 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 81 DAG size of output 38 [2018-01-23 14:30:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:46,819 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2018-01-23 14:30:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:30:46,820 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-01-23 14:30:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:46,824 INFO L225 Difference]: With dead ends: 169 [2018-01-23 14:30:46,824 INFO L226 Difference]: Without dead ends: 166 [2018-01-23 14:30:46,826 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=1098, Unknown=6, NotChecked=68, Total=1332 [2018-01-23 14:30:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-23 14:30:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 129. [2018-01-23 14:30:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:30:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-23 14:30:46,841 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 34 [2018-01-23 14:30:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:46,841 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-23 14:30:46,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:30:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-23 14:30:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:30:46,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:46,844 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:46,844 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -232230565, now seen corresponding path program 1 times [2018-01-23 14:30:46,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:46,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:46,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:46,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:46,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:46,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:46,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:46,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:30:46,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:30:46,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:30:46,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:30:46,902 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 5 states. [2018-01-23 14:30:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:47,000 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-01-23 14:30:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:30:47,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-23 14:30:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:47,002 INFO L225 Difference]: With dead ends: 184 [2018-01-23 14:30:47,003 INFO L226 Difference]: Without dead ends: 181 [2018-01-23 14:30:47,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:30:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-23 14:30:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2018-01-23 14:30:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:30:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-23 14:30:47,017 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 40 [2018-01-23 14:30:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:47,017 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-23 14:30:47,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:30:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-23 14:30:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-23 14:30:47,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:47,019 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:47,019 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash 380991995, now seen corresponding path program 1 times [2018-01-23 14:30:47,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:47,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:47,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:47,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:47,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:47,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:47,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:30:47,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:30:47,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:30:47,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:30:47,075 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 5 states. [2018-01-23 14:30:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:47,138 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-01-23 14:30:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:30:47,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-23 14:30:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:47,139 INFO L225 Difference]: With dead ends: 181 [2018-01-23 14:30:47,139 INFO L226 Difference]: Without dead ends: 178 [2018-01-23 14:30:47,140 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:30:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-23 14:30:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 129. [2018-01-23 14:30:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:30:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-23 14:30:47,148 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 40 [2018-01-23 14:30:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:47,148 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-23 14:30:47,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:30:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-23 14:30:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:30:47,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:47,150 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:47,150 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 423075683, now seen corresponding path program 2 times [2018-01-23 14:30:47,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:47,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:47,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:47,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:47,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:47,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:47,277 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:30:47,289 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:30:47,307 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:30:47,330 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:30:47,333 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:30:47,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:47,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:30:47,344 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-01-23 14:30:47,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-23 14:30:47,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:30:47,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:47,366 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-01-23 14:30:47,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-01-23 14:30:47,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:30:47,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:30:47,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:47,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-23 14:30:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:47,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:47,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-23 14:30:47,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:30:47,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:30:47,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:30:47,470 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 9 states. [2018-01-23 14:30:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:47,687 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-01-23 14:30:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:30:47,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-23 14:30:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:47,689 INFO L225 Difference]: With dead ends: 192 [2018-01-23 14:30:47,689 INFO L226 Difference]: Without dead ends: 157 [2018-01-23 14:30:47,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:30:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-23 14:30:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2018-01-23 14:30:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-23 14:30:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-01-23 14:30:47,708 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 46 [2018-01-23 14:30:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:47,709 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-01-23 14:30:47,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:30:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-01-23 14:30:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:30:47,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:47,711 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:47,711 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1822928984, now seen corresponding path program 1 times [2018-01-23 14:30:47,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:47,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:47,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,712 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:30:47,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:47,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:48,518 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 36 DAG size of output 27 [2018-01-23 14:30:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:48,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:48,861 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:30:48,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:48,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:48,937 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-01-23 14:30:48,944 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-01-23 14:30:48,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-23 14:30:48,979 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-01-23 14:30:48,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:48,982 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-01-23 14:30:48,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:48,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-23 14:30:49,027 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 19 [2018-01-23 14:30:49,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-23 14:30:49,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-23 14:30:49,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-23 14:30:49,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-23 14:30:49,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-23 14:30:49,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,228 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 3 case distinctions, treesize of input 42 treesize of output 57 [2018-01-23 14:30:49,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-01-23 14:30:49,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,260 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:30:49,261 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 29 treesize of output 55 [2018-01-23 14:30:49,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:49,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:49,293 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:98 [2018-01-23 14:30:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-01-23 14:30:49,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-23 14:30:49,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:49,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:49,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:104 [2018-01-23 14:30:49,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:49,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 85 [2018-01-23 14:30:49,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:50,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,107 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 2 case distinctions, treesize of input 55 treesize of output 58 [2018-01-23 14:30:50,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:50,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,232 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 2 case distinctions, treesize of input 82 treesize of output 85 [2018-01-23 14:30:50,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:50,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,368 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 2 case distinctions, treesize of input 55 treesize of output 58 [2018-01-23 14:30:50,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:50,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-23 14:30:50,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:275, output treesize:521 [2018-01-23 14:30:50,732 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 122 [2018-01-23 14:30:50,973 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 122 [2018-01-23 14:30:51,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:51,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 103 [2018-01-23 14:30:51,021 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-01-23 14:30:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:51,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:52,543 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:30:52,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:52,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 84 [2018-01-23 14:30:52,551 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-01-23 14:30:52,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:52,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,036 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:30:54,039 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 71 treesize of output 73 [2018-01-23 14:30:54,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-23 14:30:54,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:55,630 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 103 treesize of output 127 [2018-01-23 14:30:55,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-01-23 14:30:55,667 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:55,759 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 105 treesize of output 113 [2018-01-23 14:30:55,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:55,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:57,403 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:30:57,405 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 71 treesize of output 61 [2018-01-23 14:30:57,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:57,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 68 [2018-01-23 14:30:57,420 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,437 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:58,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-01-23 14:30:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,912 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 64 [2018-01-23 14:30:58,913 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:58,939 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:58,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:58,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 117 [2018-01-23 14:30:58,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-01-23 14:30:58,963 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:59,035 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 85 treesize of output 91 [2018-01-23 14:30:59,036 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:59,081 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:31:00,157 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 69 [2018-01-23 14:31:00,159 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-01-23 14:31:00,160 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:00,174 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:00,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:00,996 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 76 treesize of output 81 [2018-01-23 14:31:01,029 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-01-23 14:31:01,030 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:01,045 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:01,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-01-23 14:31:01,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:01,783 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 48 treesize of output 75 [2018-01-23 14:31:01,784 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:01,797 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:01,800 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 66 treesize of output 53 [2018-01-23 14:31:01,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:01,809 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 38 treesize of output 66 [2018-01-23 14:31:01,809 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:01,857 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:02,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:02,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:02,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 115 [2018-01-23 14:31:02,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:02,404 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 135 [2018-01-23 14:31:02,405 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:02,507 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 88 treesize of output 87 [2018-01-23 14:31:02,507 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:02,564 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:31:03,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2018-01-23 14:31:03,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,089 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 58 [2018-01-23 14:31:03,090 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:03,115 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:03,547 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 103 treesize of output 100 [2018-01-23 14:31:03,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:31:03,549 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,568 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,571 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 87 treesize of output 84 [2018-01-23 14:31:03,573 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-01-23 14:31:03,573 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,589 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-01-23 14:31:03,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:31:03,959 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,973 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:04,311 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 65 [2018-01-23 14:31:04,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:31:04,313 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:04,324 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:04,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:04,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:04,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:04,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2018-01-23 14:31:04,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:04,640 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 78 [2018-01-23 14:31:04,641 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:04,661 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:04,926 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 91 treesize of output 88 [2018-01-23 14:31:04,928 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-01-23 14:31:04,928 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:04,943 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:05,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 16 dim-2 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2018-01-23 14:31:05,194 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 36 variables, input treesize:697, output treesize:789 [2018-01-23 14:31:05,680 WARN L146 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 196 DAG size of output 177 [2018-01-23 14:31:06,117 WARN L143 SmtUtils]: Spent 240ms on a formula simplification that was a NOOP. DAG size: 183 [2018-01-23 14:31:06,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:06,162 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:31:06,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 89 [2018-01-23 14:31:06,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-23 14:31:06,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:06,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:12,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:12,180 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 88 treesize of output 93 [2018-01-23 14:31:12,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-23 14:31:12,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:12,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:16,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:16,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:16,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2018-01-23 14:31:16,816 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 62 [2018-01-23 14:31:16,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:31:16,837 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:23,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 126 [2018-01-23 14:31:23,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:23,030 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:31:23,057 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 123 [2018-01-23 14:31:23,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-01-23 14:31:23,145 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:31:26,265 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 81 treesize of output 77 [2018-01-23 14:31:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-01-23 14:31:26,271 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:26,282 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:30,537 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 81 treesize of output 62 [2018-01-23 14:31:30,548 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 2 case distinctions, treesize of input 54 treesize of output 57 [2018-01-23 14:31:30,548 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-23 14:31:30,569 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. Received shutdown request... [2018-01-23 14:31:52,767 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:31:52,768 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:31:52,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:31:52 BoogieIcfgContainer [2018-01-23 14:31:52,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:31:52,770 INFO L168 Benchmark]: Toolchain (without parser) took 70903.88 ms. Allocated memory was 299.4 MB in the beginning and 624.4 MB in the end (delta: 325.1 MB). Free memory was 257.7 MB in the beginning and 329.9 MB in the end (delta: -72.2 MB). Peak memory consumption was 275.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:52,771 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 299.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:31:52,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.11 ms. Allocated memory is still 299.4 MB. Free memory was 256.7 MB in the beginning and 245.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:52,772 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 299.4 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:52,772 INFO L168 Benchmark]: RCFGBuilder took 427.26 ms. Allocated memory is still 299.4 MB. Free memory was 243.5 MB in the beginning and 215.9 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:52,772 INFO L168 Benchmark]: TraceAbstraction took 70215.16 ms. Allocated memory was 299.4 MB in the beginning and 624.4 MB in the end (delta: 325.1 MB). Free memory was 215.9 MB in the beginning and 329.9 MB in the end (delta: -114.0 MB). Peak memory consumption was 233.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:52,774 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.16 ms. Allocated memory is still 299.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.11 ms. Allocated memory is still 299.4 MB. Free memory was 256.7 MB in the beginning and 245.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 299.4 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 427.26 ms. Allocated memory is still 299.4 MB. Free memory was 243.5 MB in the beginning and 215.9 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70215.16 ms. Allocated memory was 299.4 MB in the beginning and 624.4 MB in the end (delta: 325.1 MB). Free memory was 215.9 MB in the beginning and 329.9 MB in the end (delta: -114.0 MB). Peak memory consumption was 233.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L630] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={14:0}] [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L631] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L632] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L633] FCALL root->parent = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, n={0:0}, root={14:0}] [L656] EXPR, FCALL malloc(sizeof(*s)) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}] [L656] struct StackItem* s = malloc(sizeof(*s)), *st; VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L657] FCALL s->next = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L658] FCALL s->node = root VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L659] COND TRUE s != ((void *)0) [L660] st = s VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}, s={15:0}] [L661] EXPR, FCALL s->next VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}, s={15:0}, s->next={0:0}] [L661] s = s->next [L662] EXPR, FCALL st->node VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}, s={0:0}, st->node={14:0}] [L662] n = st->node [L663] FCALL free(st) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={15:0}, s={0:0}] [L664] FCALL n->left VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, n->left={0:0}, root={14:0}, s={15:0}, s={0:0}] [L664] COND FALSE !(n->left) [L670] FCALL n->right VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, n->right={0:0}, root={14:0}, s={15:0}, s={0:0}] [L670] COND FALSE !(n->right) [L676] FCALL free(n) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={15:0}, s={0:0}] [L659] COND FALSE !(s != ((void *)0)) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={15:0}, s={0:0}] [L678] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 38 SDslu, 154 SDs, 0 SdLazy, 13 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 348. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. TIMEOUT Result, 69.4s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 592 SDtfs, 549 SDslu, 2458 SDs, 0 SdLazy, 1172 SolverSat, 22 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 273 ConstructedInterpolants, 11 QuantifiedInterpolants, 69351 SizeOfPredicates, 18 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 27/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-31-52-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-31-52-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-31-52-781.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-31-52-781.csv Completed graceful shutdown