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_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:30:37,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:30:37,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:30:37,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:30:37,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:30:37,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:30:37,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:30:37,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:30:37,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:30:37,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:30:37,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:30:37,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:30:37,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:30:37,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:30:37,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:30:37,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:30:37,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:30:37,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:30:37,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:30:37,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:30:37,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:30:37,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:30:37,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:30:37,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:30:37,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:30:37,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:30:37,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:30:37,635 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:30:37,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:30:37,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:30:37,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:30:37,636 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:37,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:30:37,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:30:37,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:30:37,645 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:30:37,645 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:30:37,645 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:30:37,646 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:30:37,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:30:37,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:30:37,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:30:37,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:30:37,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:30:37,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:30:37,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:30:37,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:30:37,648 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:30:37,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:30:37,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:30:37,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:30:37,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:30:37,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:30:37,650 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:30:37,651 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:30:37,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:30:37,691 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:30:37,694 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:30:37,695 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:30:37,696 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:30:37,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-01-23 14:30:37,873 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:30:37,878 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:30:37,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:30:37,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:30:37,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:30:37,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:30:37" (1/1) ... [2018-01-23 14:30:37,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b09386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:37, skipping insertion in model container [2018-01-23 14:30:37,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:30:37" (1/1) ... [2018-01-23 14:30:37,908 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:30:37,948 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:30:38,062 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:30:38,089 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:30:38,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:38 WrapperNode [2018-01-23 14:30:38,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:30:38,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:30:38,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:30:38,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:30:38,111 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:38" (1/1) ... [2018-01-23 14:30:38,111 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:38" (1/1) ... [2018-01-23 14:30:38,123 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:38" (1/1) ... [2018-01-23 14:30:38,124 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:38" (1/1) ... [2018-01-23 14:30:38,131 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:38" (1/1) ... [2018-01-23 14:30:38,135 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:38" (1/1) ... [2018-01-23 14:30:38,136 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:38" (1/1) ... [2018-01-23 14:30:38,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:30:38,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:30:38,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:30:38,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:30:38,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:38" (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:38,182 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:30:38,182 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:30:38,182 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:30:38,182 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:30:38,182 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:30:38,183 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:30:38,184 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:30:38,184 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:30:38,184 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:30:38,632 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:30:38,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:30:38 BoogieIcfgContainer [2018-01-23 14:30:38,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:30:38,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:30:38,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:30:38,636 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:30:38,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:30:37" (1/3) ... [2018-01-23 14:30:38,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473e25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:30:38, skipping insertion in model container [2018-01-23 14:30:38,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:30:38" (2/3) ... [2018-01-23 14:30:38,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4473e25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:30:38, skipping insertion in model container [2018-01-23 14:30:38,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:30:38" (3/3) ... [2018-01-23 14:30:38,641 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-01-23 14:30:38,649 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:30:38,658 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:30:38,706 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:38,706 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:38,706 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:38,706 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:38,707 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:38,707 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:38,707 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:38,707 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:30:38,708 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-23 14:30:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:30:38,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:38,736 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:30:38,737 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:30:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash 262355, now seen corresponding path program 1 times [2018-01-23 14:30:38,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:38,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:38,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:38,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:38,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:38,863 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:30:38,869 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:38,875 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:38,875 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:38,875 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:38,876 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:38,876 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:38,876 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:38,876 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:38,876 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:30:38,876 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-23 14:30:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:30:38,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:38,881 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:38,881 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash -936424552, now seen corresponding path program 1 times [2018-01-23 14:30:38,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:38,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:38,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:38,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:38,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:38,918 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:39,028 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:39,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:30:39,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:30:39,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:30:39,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:39,042 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2018-01-23 14:30:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,065 INFO L93 Difference]: Finished difference Result 216 states and 260 transitions. [2018-01-23 14:30:39,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:30:39,066 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-23 14:30:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,075 INFO L225 Difference]: With dead ends: 216 [2018-01-23 14:30:39,075 INFO L226 Difference]: Without dead ends: 119 [2018-01-23 14:30:39,077 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:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-23 14:30:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-23 14:30:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-23 14:30:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-23 14:30:39,118 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2018-01-23 14:30:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,118 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-23 14:30:39,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:30:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-23 14:30:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-23 14:30:39,119 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,120 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, 1, 1, 1] [2018-01-23 14:30:39,120 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1072713404, now seen corresponding path program 1 times [2018-01-23 14:30:39,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,139 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:39,203 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:39,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:30:39,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:30:39,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:30:39,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:30:39,205 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 4 states. [2018-01-23 14:30:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,247 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-01-23 14:30:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:30:39,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-23 14:30:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,249 INFO L225 Difference]: With dead ends: 161 [2018-01-23 14:30:39,249 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:30:39,250 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:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:30:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-23 14:30:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-23 14:30:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-01-23 14:30:39,260 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 27 [2018-01-23 14:30:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,260 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-01-23 14:30:39,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:30:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-01-23 14:30:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-23 14:30:39,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,263 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, 1, 1, 1, 1] [2018-01-23 14:30:39,263 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:39,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1759311448, now seen corresponding path program 1 times [2018-01-23 14:30:39,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,288 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:39,335 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:39,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:30:39,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:30:39,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:30:39,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:39,336 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 3 states. [2018-01-23 14:30:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,352 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-01-23 14:30:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:30:39,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-23 14:30:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,355 INFO L225 Difference]: With dead ends: 237 [2018-01-23 14:30:39,355 INFO L226 Difference]: Without dead ends: 158 [2018-01-23 14:30:39,356 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-23 14:30:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-23 14:30:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-23 14:30:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-23 14:30:39,369 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 44 [2018-01-23 14:30:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,369 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-23 14:30:39,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:30:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-23 14:30:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:30:39,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,371 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, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:39,372 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:30:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash -512140811, now seen corresponding path program 1 times [2018-01-23 14:30:39,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:30:39,447 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:30:39,457 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:39,466 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:39,467 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:30:39,485 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:30:39,485 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:30:39,485 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:30:39,485 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:30:39,485 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:30:39,485 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:30:39,485 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:30:39,485 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:30:39,486 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:30:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-23 14:30:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:30:39,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,489 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] [2018-01-23 14:30:39,489 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash -769688664, now seen corresponding path program 1 times [2018-01-23 14:30:39,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,499 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:39,511 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:39,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:30:39,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:30:39,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:30:39,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:30:39,512 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2018-01-23 14:30:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,519 INFO L93 Difference]: Finished difference Result 216 states and 260 transitions. [2018-01-23 14:30:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:30:39,519 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:30:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,521 INFO L225 Difference]: With dead ends: 216 [2018-01-23 14:30:39,521 INFO L226 Difference]: Without dead ends: 117 [2018-01-23 14:30:39,522 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:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-23 14:30:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-23 14:30:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-23 14:30:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-23 14:30:39,530 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 20 [2018-01-23 14:30:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,530 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-23 14:30:39,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:30:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-23 14:30:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:30:39,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,531 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, 1] [2018-01-23 14:30:39,532 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash -403350444, now seen corresponding path program 1 times [2018-01-23 14:30:39,532 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,543 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:39,592 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:39,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:30:39,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:30:39,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:30:39,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:30:39,594 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 4 states. [2018-01-23 14:30:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,666 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-01-23 14:30:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:30:39,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-23 14:30:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,668 INFO L225 Difference]: With dead ends: 157 [2018-01-23 14:30:39,668 INFO L226 Difference]: Without dead ends: 154 [2018-01-23 14:30:39,668 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:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-23 14:30:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-23 14:30:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-23 14:30:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-01-23 14:30:39,678 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 25 [2018-01-23 14:30:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,678 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-01-23 14:30:39,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:30:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-01-23 14:30:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:30:39,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,680 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, 1, 1] [2018-01-23 14:30:39,680 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1941493352, now seen corresponding path program 1 times [2018-01-23 14:30:39,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,692 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:39,713 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:39,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:39,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:30:39,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:30:39,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:30:39,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:39,714 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 3 states. [2018-01-23 14:30:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:39,732 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2018-01-23 14:30:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:30:39,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-01-23 14:30:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:39,734 INFO L225 Difference]: With dead ends: 233 [2018-01-23 14:30:39,734 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:30:39,735 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:30:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-23 14:30:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-23 14:30:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-01-23 14:30:39,746 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 42 [2018-01-23 14:30:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:39,746 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-01-23 14:30:39,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:30:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-01-23 14:30:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-23 14:30:39,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:39,748 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, 1, 1, 1, 1] [2018-01-23 14:30:39,748 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1818459461, now seen corresponding path program 1 times [2018-01-23 14:30:39,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:39,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:39,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:39,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:39,764 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:40,313 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:40,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:40,313 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:40,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:40,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:40,499 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:40,505 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:40,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:40,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:40,570 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:40,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:48 [2018-01-23 14:30:40,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:40,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-01-23 14:30:40,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:30:40,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:40,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:40,787 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:40,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:48 [2018-01-23 14:30:40,840 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 43 treesize of output 35 [2018-01-23 14:30:40,849 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 35 treesize of output 32 [2018-01-23 14:30:40,851 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:40,862 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:40,878 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:40,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:69 [2018-01-23 14:30:41,076 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~tmp~4.base Int) (|main_#t~mem64.base| Int)) (let ((.cse0 (store |c_old(#valid)| main_~tmp~4.base 1))) (and (not (= 0 main_~tmp~4.base)) (= |c_#valid| (store (store .cse0 |main_#t~mem64.base| 0) main_~tmp~4.base 0)) (not (= |main_#t~mem64.base| 0)) (= 0 (select |c_old(#valid)| main_~tmp~4.base)) (= (select .cse0 |main_#t~mem64.base|) 0)))) is different from true [2018-01-23 14:30:41,098 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:41,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:41,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-23 14:30:41,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:30:41,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:30:41,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=302, Unknown=5, NotChecked=34, Total=380 [2018-01-23 14:30:41,121 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 20 states. [2018-01-23 14:30:42,295 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 60 DAG size of output 30 [2018-01-23 14:30:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:43,052 INFO L93 Difference]: Finished difference Result 322 states and 379 transitions. [2018-01-23 14:30:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-23 14:30:43,053 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-01-23 14:30:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:43,054 INFO L225 Difference]: With dead ends: 322 [2018-01-23 14:30:43,055 INFO L226 Difference]: Without dead ends: 319 [2018-01-23 14:30:43,056 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=110, Invalid=754, Unknown=10, NotChecked=56, Total=930 [2018-01-23 14:30:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-23 14:30:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 204. [2018-01-23 14:30:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-23 14:30:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2018-01-23 14:30:43,070 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 44 [2018-01-23 14:30:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,071 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2018-01-23 14:30:43,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:30:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2018-01-23 14:30:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-23 14:30:43,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,073 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:43,073 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:43,073 INFO L82 PathProgramCache]: Analyzing trace with hash 494070907, now seen corresponding path program 1 times [2018-01-23 14:30:43,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,089 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,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:43,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:43,170 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:43,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:43,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:43,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-23 14:30:43,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:30:43,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:30:43,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:30:43,268 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand 8 states. [2018-01-23 14:30:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:43,453 INFO L93 Difference]: Finished difference Result 501 states and 586 transitions. [2018-01-23 14:30:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:30:43,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-01-23 14:30:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:43,455 INFO L225 Difference]: With dead ends: 501 [2018-01-23 14:30:43,456 INFO L226 Difference]: Without dead ends: 460 [2018-01-23 14:30:43,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:30:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-01-23 14:30:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 201. [2018-01-23 14:30:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-23 14:30:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2018-01-23 14:30:43,474 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 53 [2018-01-23 14:30:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:43,474 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2018-01-23 14:30:43,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:30:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2018-01-23 14:30:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-23 14:30:43,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:43,476 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:43,476 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1339755966, now seen corresponding path program 1 times [2018-01-23 14:30:43,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:43,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:43,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:43,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:43,508 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,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:44,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:44,746 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:44,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:44,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:44,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:30:44,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:30:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:44,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:44,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:30:44,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-23 14:30:44,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:30:44,903 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,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,905 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,911 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,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-23 14:30:44,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-23 14:30:44,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:30:44,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:44,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,005 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:45,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:30 [2018-01-23 14:30:45,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:45,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:45,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:45,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-01-23 14:30:45,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-01-23 14:30:45,083 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 32 treesize of output 33 [2018-01-23 14:30:45,085 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:45,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,096 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:45,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-01-23 14:30:45,142 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2018-01-23 14:30:45,147 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 16 treesize of output 15 [2018-01-23 14:30:45,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-01-23 14:30:45,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-23 14:30:45,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:45 [2018-01-23 14:30:45,318 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 46 treesize of output 40 [2018-01-23 14:30:45,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2018-01-23 14:30:45,326 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:45,336 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:45,348 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:45,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:117 [2018-01-23 14:30:45,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2018-01-23 14:30:45,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-23 14:30:45,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-01-23 14:30:45,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:45,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-01-23 14:30:45,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:45,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-01-23 14:30:45,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 5 xjuncts. [2018-01-23 14:30:45,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-23 14:30:45,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:45,702 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:4 [2018-01-23 14:30:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:45,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:45,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17] total 40 [2018-01-23 14:30:45,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:30:45,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:30:45,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1461, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:30:45,763 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand 40 states. [2018-01-23 14:30:47,717 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 124 DAG size of output 81 [2018-01-23 14:30:47,864 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 112 DAG size of output 63 [2018-01-23 14:30:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:49,685 INFO L93 Difference]: Finished difference Result 528 states and 624 transitions. [2018-01-23 14:30:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-23 14:30:49,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 56 [2018-01-23 14:30:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:49,688 INFO L225 Difference]: With dead ends: 528 [2018-01-23 14:30:49,688 INFO L226 Difference]: Without dead ends: 446 [2018-01-23 14:30:49,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=451, Invalid=3089, Unknown=0, NotChecked=0, Total=3540 [2018-01-23 14:30:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-23 14:30:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 240. [2018-01-23 14:30:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-23 14:30:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 286 transitions. [2018-01-23 14:30:49,708 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 286 transitions. Word has length 56 [2018-01-23 14:30:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:49,709 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 286 transitions. [2018-01-23 14:30:49,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:30:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 286 transitions. [2018-01-23 14:30:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:30:49,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:49,710 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:49,711 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 306239164, now seen corresponding path program 1 times [2018-01-23 14:30:49,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:49,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:49,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:49,732 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:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:50,158 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:50,158 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:30:50,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:50,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:50,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:30:50,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:30:50,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:30:50,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-23 14:30:50,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:30:50,318 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:50,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:30:50,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:30:50,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-01-23 14:30:50,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-01-23 14:30:50,412 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 16 treesize of output 15 [2018-01-23 14:30:50,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-23 14:30:50,431 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 20 treesize of output 19 [2018-01-23 14:30:50,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:50,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:35 [2018-01-23 14:30:50,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2018-01-23 14:30:50,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:50,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 128 [2018-01-23 14:30:50,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 32 xjuncts. [2018-01-23 14:30:50,967 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 87 treesize of output 76 [2018-01-23 14:30:50,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:51,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2018-01-23 14:30:51,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:51,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 82 [2018-01-23 14:30:51,273 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:51,432 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 72 treesize of output 73 [2018-01-23 14:30:51,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:51,439 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 74 treesize of output 63 [2018-01-23 14:30:51,440 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:51,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2018-01-23 14:30:51,597 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:51,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2018-01-23 14:30:51,752 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:51,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 85 [2018-01-23 14:30:51,914 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:30:52,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 13 dim-0 vars, and 15 xjuncts. [2018-01-23 14:30:52,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 97 [2018-01-23 14:30:52,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 68 [2018-01-23 14:30:52,280 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:52,320 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 79 treesize of output 68 [2018-01-23 14:30:52,321 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:52,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 68 treesize of output 55 [2018-01-23 14:30:52,356 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:52,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:52,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 64 [2018-01-23 14:30:52,402 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:52,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:52,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:52,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 104 [2018-01-23 14:30:52,462 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-01-23 14:30:52,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2018-01-23 14:30:52,562 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:52,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-01-23 14:30:52,659 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:52,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2018-01-23 14:30:52,756 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:52,858 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: 10 dim-0 vars, and 10 xjuncts. [2018-01-23 14:30:53,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 55 [2018-01-23 14:30:53,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-01-23 14:30:53,201 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-01-23 14:30:53,221 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2018-01-23 14:30:53,246 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:53,255 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-01-23 14:30:53,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-23 14:30:53,261 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:53,266 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,269 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-01-23 14:30:53,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2018-01-23 14:30:53,273 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:53,282 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,288 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2018-01-23 14:30:53,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2018-01-23 14:30:53,304 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-01-23 14:30:53,335 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,348 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 63 [2018-01-23 14:30:53,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-01-23 14:30:53,358 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 50 treesize of output 35 [2018-01-23 14:30:53,380 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-01-23 14:30:53,402 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,409 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2018-01-23 14:30:53,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-01-23 14:30:53,424 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:30:53,452 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:53,464 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2018-01-23 14:30:53,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2018-01-23 14:30:53,475 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-01-23 14:30:53,494 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2018-01-23 14:30:53,516 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,534 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-23 14:30:53,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-01-23 14:30:53,540 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:53,559 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,564 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-23 14:30:53,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-23 14:30:53,659 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:53,675 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,679 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 59 [2018-01-23 14:30:53,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2018-01-23 14:30:53,689 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:53,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2018-01-23 14:30:53,723 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:53,740 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2018-01-23 14:30:53,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-01-23 14:30:53,989 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:53,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-23 14:30:53,996 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:53,998 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 57 [2018-01-23 14:30:54,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2018-01-23 14:30:54,006 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2018-01-23 14:30:54,023 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:30:54,040 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,046 INFO L267 ElimStorePlain]: Start of recursive call 57: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-01-23 14:30:54,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-01-23 14:30:54,051 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 25 [2018-01-23 14:30:54,059 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,063 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-01-23 14:30:54,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2018-01-23 14:30:54,070 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:30:54,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-01-23 14:30:54,079 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:54,080 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,085 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-01-23 14:30:54,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-01-23 14:30:54,088 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-23 14:30:54,096 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,100 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-01-23 14:30:54,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2018-01-23 14:30:54,104 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:54,112 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,117 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 73 [2018-01-23 14:30:54,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2018-01-23 14:30:54,126 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,134 INFO L267 ElimStorePlain]: Start of recursive call 74: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 73 [2018-01-23 14:30:54,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2018-01-23 14:30:54,142 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 54 treesize of output 35 [2018-01-23 14:30:54,166 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-01-23 14:30:54,183 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,189 INFO L267 ElimStorePlain]: Start of recursive call 76: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2018-01-23 14:30:54,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 38 [2018-01-23 14:30:54,200 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:54,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-01-23 14:30:54,219 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2018-01-23 14:30:54,240 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,247 INFO L267 ElimStorePlain]: Start of recursive call 80: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 61 [2018-01-23 14:30:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 24 [2018-01-23 14:30:54,256 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,261 INFO L267 ElimStorePlain]: Start of recursive call 84: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 51 [2018-01-23 14:30:54,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-01-23 14:30:54,268 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-01-23 14:30:54,283 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:54,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2018-01-23 14:30:54,294 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,298 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 69 [2018-01-23 14:30:54,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 42 [2018-01-23 14:30:54,313 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,331 INFO L267 ElimStorePlain]: Start of recursive call 90: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2018-01-23 14:30:54,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2018-01-23 14:30:54,336 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:54,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:54,342 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,347 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 73 [2018-01-23 14:30:54,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 65 treesize of output 38 [2018-01-23 14:30:54,352 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:54,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:54,363 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,370 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2018-01-23 14:30:54,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-01-23 14:30:54,374 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 25 [2018-01-23 14:30:54,382 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,384 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:54,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:54,410 INFO L202 ElimStorePlain]: Needed 100 recursive calls to eliminate 6 variables, input treesize:199, output treesize:11 [2018-01-23 14:30:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:54,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:54,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2018-01-23 14:30:54,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-23 14:30:54,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-23 14:30:54,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1235, Unknown=2, NotChecked=0, Total=1332 [2018-01-23 14:30:54,507 INFO L87 Difference]: Start difference. First operand 240 states and 286 transitions. Second operand 37 states. [2018-01-23 14:30:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:56,542 INFO L93 Difference]: Finished difference Result 565 states and 664 transitions. [2018-01-23 14:30:56,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-23 14:30:56,542 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-01-23 14:30:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:56,544 INFO L225 Difference]: With dead ends: 565 [2018-01-23 14:30:56,544 INFO L226 Difference]: Without dead ends: 460 [2018-01-23 14:30:56,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=399, Invalid=3257, Unknown=4, NotChecked=0, Total=3660 [2018-01-23 14:30:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-01-23 14:30:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 240. [2018-01-23 14:30:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-23 14:30:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 285 transitions. [2018-01-23 14:30:56,564 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 285 transitions. Word has length 57 [2018-01-23 14:30:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:56,564 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 285 transitions. [2018-01-23 14:30:56,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-23 14:30:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 285 transitions. [2018-01-23 14:30:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-23 14:30:56,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:56,566 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:56,566 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1932641787, now seen corresponding path program 2 times [2018-01-23 14:30:56,566 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:56,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:56,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:56,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:56,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:56,580 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:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:56,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:56,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:30:56,705 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:30:56,730 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:30:56,747 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:30:56,751 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:30:56,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:56,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:30:56,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:56,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:30:56,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:30:56,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,857 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 12 treesize of output 10 [2018-01-23 14:30:56,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:56,859 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,866 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 12 treesize of output 10 [2018-01-23 14:30:56,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:30:56,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:56,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:56,872 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-01-23 14:30:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:56,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:56,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-01-23 14:30:56,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:30:56,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:30:56,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:30:56,910 INFO L87 Difference]: Start difference. First operand 240 states and 285 transitions. Second operand 9 states. [2018-01-23 14:30:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:57,484 INFO L93 Difference]: Finished difference Result 422 states and 497 transitions. [2018-01-23 14:30:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:30:57,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-01-23 14:30:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:57,487 INFO L225 Difference]: With dead ends: 422 [2018-01-23 14:30:57,487 INFO L226 Difference]: Without dead ends: 340 [2018-01-23 14:30:57,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-01-23 14:30:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-23 14:30:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 251. [2018-01-23 14:30:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-23 14:30:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2018-01-23 14:30:57,506 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 62 [2018-01-23 14:30:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:57,507 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2018-01-23 14:30:57,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:30:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2018-01-23 14:30:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:30:57,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:57,508 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:57,508 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash -816042828, now seen corresponding path program 2 times [2018-01-23 14:30:57,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:57,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:57,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:57,509 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:30:57,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:57,520 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:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:57,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:57,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:30:57,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:30:57,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:30:57,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:57,564 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 3 states. [2018-01-23 14:30:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:57,594 INFO L93 Difference]: Finished difference Result 350 states and 411 transitions. [2018-01-23 14:30:57,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:30:57,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-01-23 14:30:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:57,596 INFO L225 Difference]: With dead ends: 350 [2018-01-23 14:30:57,596 INFO L226 Difference]: Without dead ends: 246 [2018-01-23 14:30:57,597 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-23 14:30:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 238. [2018-01-23 14:30:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-23 14:30:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 281 transitions. [2018-01-23 14:30:57,613 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 281 transitions. Word has length 63 [2018-01-23 14:30:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:57,614 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 281 transitions. [2018-01-23 14:30:57,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:30:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 281 transitions. [2018-01-23 14:30:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:30:57,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:57,615 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:57,615 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:57,615 INFO L82 PathProgramCache]: Analyzing trace with hash 125362406, now seen corresponding path program 1 times [2018-01-23 14:30:57,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:57,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:57,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:57,616 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:30:57,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:57,627 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:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:57,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:57,739 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:30:57,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:57,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:57,831 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 29 treesize of output 27 [2018-01-23 14:30:57,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:30:57,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,845 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 20 treesize of output 16 [2018-01-23 14:30:57,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2018-01-23 14:30:57,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,854 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 29 treesize of output 27 [2018-01-23 14:30:57,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:30:57,855 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,858 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,863 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 20 treesize of output 16 [2018-01-23 14:30:57,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:30:57,864 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,865 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:57,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:57,867 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:59, output treesize:9 [2018-01-23 14:30:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:57,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:57,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-23 14:30:57,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:30:57,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:30:57,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:30:57,920 INFO L87 Difference]: Start difference. First operand 238 states and 281 transitions. Second operand 9 states. [2018-01-23 14:30:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:58,405 INFO L93 Difference]: Finished difference Result 335 states and 391 transitions. [2018-01-23 14:30:58,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:30:58,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-01-23 14:30:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:58,407 INFO L225 Difference]: With dead ends: 335 [2018-01-23 14:30:58,407 INFO L226 Difference]: Without dead ends: 313 [2018-01-23 14:30:58,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:30:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-23 14:30:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 215. [2018-01-23 14:30:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-23 14:30:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2018-01-23 14:30:58,422 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 64 [2018-01-23 14:30:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:58,422 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2018-01-23 14:30:58,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:30:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2018-01-23 14:30:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:30:58,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:58,424 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:58,424 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:58,424 INFO L82 PathProgramCache]: Analyzing trace with hash 738041777, now seen corresponding path program 1 times [2018-01-23 14:30:58,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:58,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:58,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:58,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:58,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:58,436 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:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:30:58,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:30:58,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:30:58,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:30:58,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:30:58,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:58,479 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand 3 states. [2018-01-23 14:30:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:58,499 INFO L93 Difference]: Finished difference Result 294 states and 342 transitions. [2018-01-23 14:30:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:30:58,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-01-23 14:30:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:58,501 INFO L225 Difference]: With dead ends: 294 [2018-01-23 14:30:58,501 INFO L226 Difference]: Without dead ends: 223 [2018-01-23 14:30:58,501 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:30:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-23 14:30:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-01-23 14:30:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-23 14:30:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 259 transitions. [2018-01-23 14:30:58,517 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 259 transitions. Word has length 66 [2018-01-23 14:30:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:58,518 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 259 transitions. [2018-01-23 14:30:58,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:30:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 259 transitions. [2018-01-23 14:30:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-23 14:30:58,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:58,519 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:58,519 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1265079011, now seen corresponding path program 1 times [2018-01-23 14:30:58,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:58,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:58,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:58,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:58,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:58,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:31:00,431 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 80 DAG size of output 57 [2018-01-23 14:31:01,769 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 103 DAG size of output 65 [2018-01-23 14:31:01,956 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 120 DAG size of output 74 [2018-01-23 14:31:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:31:02,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:31:02,999 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:31:03,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:31:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:31:03,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:31:03,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:31:03,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:31:03,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,202 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:31:03,204 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:31:03,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:57 [2018-01-23 14:31:03,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,351 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 33 treesize of output 34 [2018-01-23 14:31:03,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:31:03,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 80 [2018-01-23 14:31:03,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:31:03,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:57 [2018-01-23 14:31:03,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,571 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 21 treesize of output 22 [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 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,604 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 71 treesize of output 72 [2018-01-23 14:31:03,606 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,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:81 [2018-01-23 14:31:03,630 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 19 treesize of output 15 [2018-01-23 14:31:03,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:31:03,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:84 [2018-01-23 14:31:03,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:03,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 87 [2018-01-23 14:31:03,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:31:03,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:03,780 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:31:03,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:102 [2018-01-23 14:31:05,043 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 211 treesize of output 203 [2018-01-23 14:31:05,053 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 196 treesize of output 176 [2018-01-23 14:31:05,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:05,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 220 [2018-01-23 14:31:05,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:05,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:31:05,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:05,388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 198 [2018-01-23 14:31:05,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:05,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 188 [2018-01-23 14:31:05,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-01-23 14:31:06,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:06,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:06,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 200 [2018-01-23 14:31:06,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-01-23 14:31:06,663 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 210 treesize of output 190 [2018-01-23 14:31:06,663 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:06,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-23 14:31:07,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:07,163 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 176 [2018-01-23 14:31:07,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 181 [2018-01-23 14:31:07,183 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-01-23 14:31:07,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 161 [2018-01-23 14:31:07,326 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,427 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:31:07,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:07,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 171 [2018-01-23 14:31:07,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 171 [2018-01-23 14:31:07,454 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-01-23 14:31:07,523 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:31:07,886 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 191 treesize of output 164 [2018-01-23 14:31:07,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 82 [2018-01-23 14:31:07,892 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,912 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:07,919 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 187 treesize of output 180 [2018-01-23 14:31:07,923 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 32 treesize of output 19 [2018-01-23 14:31:07,923 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,943 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:07,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 145 [2018-01-23 14:31:07,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-01-23 14:31:07,951 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,968 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 125 [2018-01-23 14:31:07,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 66 [2018-01-23 14:31:07,978 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:07,996 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:08,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 173 [2018-01-23 14:31:08,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-01-23 14:31:08,003 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:08,021 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:08,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-01-23 14:31:08,315 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 8 variables, input treesize:423, output treesize:1181 [2018-01-23 14:31:08,866 WARN L146 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 91 DAG size of output 87 [2018-01-23 14:31:09,400 WARN L146 SmtUtils]: Spent 322ms on a formula simplification. DAG size of input: 113 DAG size of output 86 [2018-01-23 14:31:09,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:09,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 92 [2018-01-23 14:31:09,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-23 14:31:09,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:09,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2018-01-23 14:31:09,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:31:09,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-23 14:31:09,770 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 105 treesize of output 101 [2018-01-23 14:31:09,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:31:09,773 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:09,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,023 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 90 treesize of output 76 [2018-01-23 14:31:10,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2018-01-23 14:31:10,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:10,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 114 [2018-01-23 14:31:10,226 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 44 treesize of output 25 [2018-01-23 14:31:10,226 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-23 14:31:10,243 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,259 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:10,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 119 [2018-01-23 14:31:10,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-01-23 14:31:10,450 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 80 treesize of output 57 [2018-01-23 14:31:10,477 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:31:10,493 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,684 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 117 treesize of output 115 [2018-01-23 14:31:10,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:31:10,686 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,697 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:10,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 91 [2018-01-23 14:31:10,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-01-23 14:31:10,877 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:31:10,892 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:10,904 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:11,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2018-01-23 14:31:11,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:31:11,064 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,078 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-01-23 14:31:11,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:31:11,267 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,277 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,279 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 56 treesize of output 52 [2018-01-23 14:31:11,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:31:11,280 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,288 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 108 [2018-01-23 14:31:11,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-01-23 14:31:11,454 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,467 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:11,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2018-01-23 14:31:11,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-23 14:31:11,634 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:11,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:11,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:11,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-01-23 14:31:11,650 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:11,663 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:11,806 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 85 treesize of output 79 [2018-01-23 14:31:11,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-01-23 14:31:11,808 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,821 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:11,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 12 dim-2 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-01-23 14:31:11,960 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 15 variables, input treesize:720, output treesize:390 [2018-01-23 14:31:12,372 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 132 DAG size of output 132 [2018-01-23 14:31:12,379 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 53 treesize of output 52 [2018-01-23 14:31:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:12,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 59 treesize of output 58 [2018-01-23 14:31:12,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:12,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-01-23 14:31:12,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:277, output treesize:275 [2018-01-23 14:31:12,786 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~tmp~4.base Int) (v_prenex_69 Int) (|main_#t~mem64.base| Int)) (let ((.cse2 (store |c_old(#valid)| main_~tmp~4.base 1))) (let ((.cse1 (store .cse2 |main_#t~mem64.base| 1))) (let ((.cse0 (store (store .cse1 v_prenex_69 0) |main_#t~mem64.base| 0))) (and (not (= v_prenex_69 0)) (= |c_#valid| (store .cse0 main_~tmp~4.base 0)) (= (select .cse1 v_prenex_69) 0) (= (select .cse0 main_~tmp~4.base) 1) (not (= 0 main_~tmp~4.base)) (not (= |main_#t~mem64.base| 0)) (= 0 (select |c_old(#valid)| main_~tmp~4.base)) (= (select .cse2 |main_#t~mem64.base|) 0)))))) is different from true [2018-01-23 14:31:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:31:12,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:31:12,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25] total 60 [2018-01-23 14:31:12,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-23 14:31:12,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-23 14:31:12,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3365, Unknown=23, NotChecked=116, Total=3660 [2018-01-23 14:31:12,858 INFO L87 Difference]: Start difference. First operand 222 states and 259 transitions. Second operand 61 states. [2018-01-23 14:31:14,558 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 134 DAG size of output 76 [2018-01-23 14:31:14,779 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 96 DAG size of output 67 [2018-01-23 14:31:15,025 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 109 DAG size of output 78 [2018-01-23 14:31:15,381 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 126 DAG size of output 80 [2018-01-23 14:31:15,580 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 104 DAG size of output 65 [2018-01-23 14:31:15,909 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 140 DAG size of output 78 [2018-01-23 14:31:16,169 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 134 DAG size of output 73 [2018-01-23 14:31:16,670 WARN L146 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 154 DAG size of output 88 [2018-01-23 14:31:16,956 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 141 DAG size of output 63 [2018-01-23 14:31:17,270 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 151 DAG size of output 76 [2018-01-23 14:31:17,490 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 111 DAG size of output 55 [2018-01-23 14:31:18,011 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 146 DAG size of output 74 [2018-01-23 14:31:18,893 WARN L146 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 240 DAG size of output 85 [2018-01-23 14:31:19,935 WARN L146 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 246 DAG size of output 88 [2018-01-23 14:31:20,887 WARN L146 SmtUtils]: Spent 614ms on a formula simplification. DAG size of input: 260 DAG size of output 106 [2018-01-23 14:31:21,841 WARN L146 SmtUtils]: Spent 588ms on a formula simplification. DAG size of input: 267 DAG size of output 103 [2018-01-23 14:31:23,094 WARN L146 SmtUtils]: Spent 557ms on a formula simplification. DAG size of input: 262 DAG size of output 101 [2018-01-23 14:31:23,664 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 165 DAG size of output 83 [2018-01-23 14:31:23,982 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 88 DAG size of output 85 [2018-01-23 14:31:24,471 WARN L146 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 170 DAG size of output 87 [2018-01-23 14:31:25,230 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 183 DAG size of output 93 [2018-01-23 14:31:25,828 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 203 DAG size of output 88 [2018-01-23 14:31:26,535 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 184 DAG size of output 89 [2018-01-23 14:31:27,073 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 212 DAG size of output 95 [2018-01-23 14:31:27,429 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 140 DAG size of output 64 [2018-01-23 14:31:27,902 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 160 DAG size of output 68 [2018-01-23 14:31:28,314 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 179 DAG size of output 77 [2018-01-23 14:31:29,316 WARN L146 SmtUtils]: Spent 715ms on a formula simplification. DAG size of input: 160 DAG size of output 158 [2018-01-23 14:31:29,934 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 110 DAG size of output 107 [2018-01-23 14:31:30,467 WARN L146 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 119 DAG size of output 119 [2018-01-23 14:31:30,932 WARN L146 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 121 DAG size of output 121 [2018-01-23 14:31:31,422 WARN L146 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 131 DAG size of output 131 [2018-01-23 14:31:31,960 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 142 DAG size of output 142 [2018-01-23 14:31:32,354 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 126 DAG size of output 111 [2018-01-23 14:31:33,385 WARN L146 SmtUtils]: Spent 747ms on a formula simplification. DAG size of input: 248 DAG size of output 163 [2018-01-23 14:31:33,772 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 120 DAG size of output 116 [2018-01-23 14:31:34,070 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 103 DAG size of output 100 [2018-01-23 14:31:34,485 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 102 DAG size of output 102 [2018-01-23 14:31:34,738 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 89 DAG size of output 80 [2018-01-23 14:31:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:31:34,939 INFO L93 Difference]: Finished difference Result 453 states and 528 transitions. [2018-01-23 14:31:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-23 14:31:34,939 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 69 [2018-01-23 14:31:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:31:34,940 INFO L225 Difference]: With dead ends: 453 [2018-01-23 14:31:34,940 INFO L226 Difference]: Without dead ends: 444 [2018-01-23 14:31:34,943 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=837, Invalid=11057, Unknown=100, NotChecked=216, Total=12210 [2018-01-23 14:31:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-01-23 14:31:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 281. [2018-01-23 14:31:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-23 14:31:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 329 transitions. [2018-01-23 14:31:34,958 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 329 transitions. Word has length 69 [2018-01-23 14:31:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:31:34,958 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 329 transitions. [2018-01-23 14:31:34,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-23 14:31:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 329 transitions. [2018-01-23 14:31:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-23 14:31:34,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:31:34,959 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,959 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:31:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396437, now seen corresponding path program 1 times [2018-01-23 14:31:34,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:31:34,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:31:34,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:31:34,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:31:34,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:31:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:31:34,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:31:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:31:35,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:31:35,310 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:31:35,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:31:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:31:35,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:31:35,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:31:35,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:31:35,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:31:35,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-23 14:31:35,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:31:35,374 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:31:35,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,381 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:31:35,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-23 14:31:35,400 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 22 treesize of output 18 [2018-01-23 14:31:35,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-23 14:31:35,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:35,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:35,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:35,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:18 [2018-01-23 14:31:35,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-23 14:31:35,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-01-23 14:31:35,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:31:35,516 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:35,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-23 14:31:35,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:31:35,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, 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:35,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-23 14:31:35,583 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 28 treesize of output 27 [2018-01-23 14:31:35,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,585 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:31:35,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-01-23 14:31:35,649 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 37 treesize of output 34 [2018-01-23 14:31:35,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-23 14:31:35,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-01-23 14:31:35,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:31:35,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2018-01-23 14:31:35,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-23 14:31:35,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:31:35,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:31:35,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:45 [2018-01-23 14:31:35,815 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 84 [2018-01-23 14:31:35,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2018-01-23 14:31:35,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:31:35,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:31:35,927 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 90 [2018-01-23 14:31:35,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-23 14:31:36,024 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 73 treesize of output 72 [2018-01-23 14:31:36,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:31:36,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-23 14:31:36,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-01-23 14:31:36,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:305 [2018-01-23 14:31:36,492 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 84 DAG size of output 62 [2018-01-23 14:31:36,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 41 [2018-01-23 14:31:36,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:31:36,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:31:36,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:31:36,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 68 [2018-01-23 14:31:36,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2018-01-23 14:31:36,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. Received shutdown request... [2018-01-23 14:31:36,667 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:31:36,668 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:31:36,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:31:36 BoogieIcfgContainer [2018-01-23 14:31:36,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:31:36,670 INFO L168 Benchmark]: Toolchain (without parser) took 58796.53 ms. Allocated memory was 306.7 MB in the beginning and 858.3 MB in the end (delta: 551.6 MB). Free memory was 264.0 MB in the beginning and 360.6 MB in the end (delta: -96.5 MB). Peak memory consumption was 455.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:36,671 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:31:36,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.99 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:36,671 INFO L168 Benchmark]: Boogie Preprocessor took 37.81 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 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:36,671 INFO L168 Benchmark]: RCFGBuilder took 494.76 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 215.5 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:36,672 INFO L168 Benchmark]: TraceAbstraction took 58035.34 ms. Allocated memory was 306.7 MB in the beginning and 858.3 MB in the end (delta: 551.6 MB). Free memory was 215.5 MB in the beginning and 360.6 MB in the end (delta: -145.0 MB). Peak memory consumption was 406.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:31:36,673 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.12 ms. Allocated memory is still 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.99 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.81 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.76 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 215.5 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58035.34 ms. Allocated memory was 306.7 MB in the beginning and 858.3 MB in the end (delta: 551.6 MB). Free memory was 215.5 MB in the beginning and 360.6 MB in the end (delta: -145.0 MB). Peak memory consumption was 406.5 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, 122 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=122occurred 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: [L632] EXPR, FCALL malloc(sizeof(*tree)) VAL [malloc(sizeof(*tree))={14:0}] [L632] TreeNode* tree = malloc(sizeof(*tree)); [L633] TreeNode* tmp; [L634] ListNode* tmpList; VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L635] FCALL tree->left = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L636] FCALL tree->right = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, tree={14:0}] [L637] EXPR, FCALL malloc(sizeof(ListNode)) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}] [L637] FCALL tree->list = malloc(sizeof(ListNode)) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}] [L638] EXPR, FCALL tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}] [L638] EXPR, FCALL tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}, tree->list={16:0}] [L638] FCALL tree->list->next = tree->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, tree={14:0}, tree->list={16:0}, tree->list={16:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L645] COND FALSE !(__VERIFIER_nondet_int()) [L685] COND TRUE ((void *)0) != tree [L687] tmp = tree [L688] TreeNode* pred = ((void *)0); VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={14:0}] [L689] EXPR, FCALL tmp->left VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tree={14:0}] [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tree={14:0}] [L689] EXPR, FCALL tmp->right VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tmp->right={0:0}, tree={14:0}] [L689] (((void *)0) != tmp->left) || (((void *)0) != tmp->right) VAL [(((void *)0) != tmp->left) || (((void *)0) != tmp->right)=0, malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->left={0:0}, tmp->right={0:0}, tree={14:0}] [L689] COND FALSE !((((void *)0) != tmp->left) || (((void *)0) != tmp->right)) [L701] COND FALSE !(((void *)0) != pred) [L714] tree = ((void *)0) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tmp->list={16:0}, tree={0:0}] [L716] EXPR, FCALL tmp->list->next VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tmp->list={16:0}, tmp->list->next={16:0}, tree={0:0}] [L716] COND FALSE !(tmp->list != tmp->list->next) [L722] EXPR, FCALL tmp->list VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L722] FCALL free(tmp->list) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tmp->list={16:0}, tree={0:0}] [L723] FCALL free(tmp) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L685] COND FALSE !(((void *)0) != tree) VAL [malloc(sizeof(*tree))={14:0}, malloc(sizeof(ListNode))={16:0}, pred={0:0}, tmp={14:0}, tree={0:0}] [L725] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 122 locations, 3 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 259 SDslu, 187 SDs, 0 SdLazy, 21 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 4292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 72 with TraceHistMax 2, 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 90. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 122 locations, 3 error locations. TIMEOUT Result, 57.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 31.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1648 SDtfs, 9489 SDslu, 12765 SDs, 0 SdLazy, 12224 SolverSat, 715 SolverUnsat, 225 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 698 GetRequests, 366 SyntacticMatches, 11 SemanticMatches, 321 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3811 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=12, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1159 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 1026 NumberOfCodeBlocks, 1026 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1007 ConstructedInterpolants, 24 QuantifiedInterpolants, 1853010 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 101/194 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_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-31-36-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-31-36-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-31-36-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-31-36-679.csv Completed graceful shutdown