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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:36:00,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:36:00,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:36:00,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:36:00,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:36:00,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:36:00,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:36:00,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:36:00,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:36:00,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:36:00,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:36:00,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:36:00,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:36:00,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:36:00,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:36:00,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:36:00,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:36:00,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:36:00,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:36:00,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:36:00,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:36:00,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:36:00,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:36:00,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:36:00,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:36:00,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:36:00,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:36:00,069 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:36:00,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:36:00,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:36:00,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:36:00,070 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:36:00,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:36:00,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:36:00,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:36:00,082 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:36:00,082 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:36:00,082 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:36:00,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:36:00,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:36:00,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:36:00,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:36:00,084 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:36:00,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:36:00,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:36:00,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:36:00,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:36:00,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:36:00,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:36:00,085 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:36:00,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:36:00,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:36:00,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:36:00,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:36:00,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:36:00,086 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:36:00,086 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:36:00,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:36:00,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:36:00,087 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:36:00,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:36:00,088 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:36:00,089 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:36:00,090 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:36:00,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:36:00,137 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:36:00,141 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:36:00,143 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:36:00,143 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:36:00,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-23 14:36:00,324 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:36:00,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:36:00,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:36:00,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:36:00,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:36:00,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e082f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00, skipping insertion in model container [2018-01-23 14:36:00,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,353 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:36:00,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:36:00,507 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:36:00,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:36:00,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00 WrapperNode [2018-01-23 14:36:00,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:36:00,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:36:00,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:36:00,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:36:00,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (1/1) ... [2018-01-23 14:36:00,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:36:00,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:36:00,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:36:00,569 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:36:00,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (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:36:00,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:36:00,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:36:00,617 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:36:00,617 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-23 14:36:00,618 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:36:00,619 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:36:00,619 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:36:00,619 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:36:00,919 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:36:00,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:36:00 BoogieIcfgContainer [2018-01-23 14:36:00,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:36:00,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:36:00,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:36:00,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:36:00,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:36:00" (1/3) ... [2018-01-23 14:36:00,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb418f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:36:00, skipping insertion in model container [2018-01-23 14:36:00,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:36:00" (2/3) ... [2018-01-23 14:36:00,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb418f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:36:00, skipping insertion in model container [2018-01-23 14:36:00,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:36:00" (3/3) ... [2018-01-23 14:36:00,928 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-23 14:36:00,938 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:36:00,947 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:36:00,992 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:36:00,992 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:36:00,992 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:36:00,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:36:00,993 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:36:00,993 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:36:00,993 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:36:00,993 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:36:00,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:36:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-23 14:36:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:36:01,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,013 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:36:01,013 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:36:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash 161638, now seen corresponding path program 1 times [2018-01-23 14:36:01,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:36:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:36:01,115 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:36:01,121 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:36:01,126 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:36:01,127 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:36:01,127 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:36:01,127 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:36:01,127 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:36:01,127 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:36:01,127 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:36:01,127 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:36:01,127 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:36:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-23 14:36:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-23 14:36:01,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:01,132 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:36:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1534673087, now seen corresponding path program 1 times [2018-01-23 14:36:01,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:01,179 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:36:01,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:01,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:36:01,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:36:01,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:36:01,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:36:01,289 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-23 14:36:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:01,313 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-23 14:36:01,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:36:01,315 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-23 14:36:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:01,325 INFO L225 Difference]: With dead ends: 119 [2018-01-23 14:36:01,325 INFO L226 Difference]: Without dead ends: 60 [2018-01-23 14:36:01,328 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:36:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-23 14:36:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-23 14:36:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-23 14:36:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-01-23 14:36:01,361 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 12 [2018-01-23 14:36:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:01,362 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-01-23 14:36:01,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:36:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-01-23 14:36:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:36:01,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,363 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:01,363 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:36:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1359962435, now seen corresponding path program 1 times [2018-01-23 14:36:01,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:36:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:36:01,403 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:36:01,408 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:36:01,410 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:36:01,410 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:36:01,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:36:01,419 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:36:01,419 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:36:01,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:36:01,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:36:01,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:36:01,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:36:01,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:36:01,419 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:36:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-23 14:36:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-23 14:36:01,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,423 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:01,423 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1736948604, now seen corresponding path program 1 times [2018-01-23 14:36:01,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:01,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:01,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:36:01,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:36:01,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:36:01,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:36:01,443 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-23 14:36:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:01,451 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2018-01-23 14:36:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:36:01,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-23 14:36:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:01,453 INFO L225 Difference]: With dead ends: 119 [2018-01-23 14:36:01,453 INFO L226 Difference]: Without dead ends: 58 [2018-01-23 14:36:01,454 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:36:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-23 14:36:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-23 14:36:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-23 14:36:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-23 14:36:01,461 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 10 [2018-01-23 14:36:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:01,461 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-23 14:36:01,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:36:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-23 14:36:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:36:01,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,462 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:01,462 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1755007480, now seen corresponding path program 1 times [2018-01-23 14:36:01,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:01,512 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:36:01,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:01,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:36:01,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:36:01,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:36:01,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:36:01,514 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 3 states. [2018-01-23 14:36:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:01,564 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-01-23 14:36:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:36:01,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-23 14:36:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:01,568 INFO L225 Difference]: With dead ends: 80 [2018-01-23 14:36:01,569 INFO L226 Difference]: Without dead ends: 77 [2018-01-23 14:36:01,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:36:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-23 14:36:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2018-01-23 14:36:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-23 14:36:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-01-23 14:36:01,579 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 14 [2018-01-23 14:36:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:01,579 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-01-23 14:36:01,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:36:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-01-23 14:36:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:36:01,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,581 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] [2018-01-23 14:36:01,581 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -108495441, now seen corresponding path program 1 times [2018-01-23 14:36:01,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:01,633 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:36:01,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:01,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:36:01,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:36:01,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:36:01,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:36:01,634 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2018-01-23 14:36:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:01,650 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-01-23 14:36:01,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:36:01,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-23 14:36:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:01,652 INFO L225 Difference]: With dead ends: 81 [2018-01-23 14:36:01,652 INFO L226 Difference]: Without dead ends: 62 [2018-01-23 14:36:01,652 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:36:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-23 14:36:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-23 14:36:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-23 14:36:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-01-23 14:36:01,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 23 [2018-01-23 14:36:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:01,657 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-01-23 14:36:01,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:36:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-01-23 14:36:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-23 14:36:01,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,658 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] [2018-01-23 14:36:01,658 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1477939535, now seen corresponding path program 1 times [2018-01-23 14:36:01,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:01,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:01,743 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:36:01,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:01,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:01,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:36:01,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:36:01,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:36:01,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:36:01,840 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 5 states. [2018-01-23 14:36:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:01,874 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-23 14:36:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:36:01,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-23 14:36:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:01,875 INFO L225 Difference]: With dead ends: 67 [2018-01-23 14:36:01,875 INFO L226 Difference]: Without dead ends: 64 [2018-01-23 14:36:01,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:36:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-23 14:36:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-23 14:36:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-23 14:36:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-23 14:36:01,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 33 [2018-01-23 14:36:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:01,881 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-23 14:36:01,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:36:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-23 14:36:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:36:01,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:01,883 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] [2018-01-23 14:36:01,883 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1966760520, now seen corresponding path program 1 times [2018-01-23 14:36:01,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:01,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:01,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:02,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:02,177 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:36:02,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:02,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:02,415 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-23 14:36:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:36:02,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:02,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-23 14:36:02,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-23 14:36:02,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-23 14:36:02,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=109, Unknown=1, NotChecked=20, Total=156 [2018-01-23 14:36:02,457 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 13 states. [2018-01-23 14:36:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:03,006 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-01-23 14:36:03,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:36:03,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-01-23 14:36:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:03,009 INFO L225 Difference]: With dead ends: 138 [2018-01-23 14:36:03,009 INFO L226 Difference]: Without dead ends: 135 [2018-01-23 14:36:03,009 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=258, Unknown=1, NotChecked=34, Total=380 [2018-01-23 14:36:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-23 14:36:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2018-01-23 14:36:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-23 14:36:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-01-23 14:36:03,023 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 42 [2018-01-23 14:36:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:03,023 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-01-23 14:36:03,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-23 14:36:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2018-01-23 14:36:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-23 14:36:03,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:03,026 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] [2018-01-23 14:36:03,028 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1934136735, now seen corresponding path program 1 times [2018-01-23 14:36:03,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:03,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:03,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:03,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:03,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:36:03,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:03,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:36:03,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:36:03,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:36:03,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:36:03,095 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 3 states. [2018-01-23 14:36:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:03,118 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2018-01-23 14:36:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:36:03,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-01-23 14:36:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:03,120 INFO L225 Difference]: With dead ends: 169 [2018-01-23 14:36:03,121 INFO L226 Difference]: Without dead ends: 115 [2018-01-23 14:36:03,121 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:36:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-23 14:36:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-23 14:36:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-23 14:36:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-01-23 14:36:03,133 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 45 [2018-01-23 14:36:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:03,133 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-01-23 14:36:03,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:36:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-01-23 14:36:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:36:03,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:03,136 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] [2018-01-23 14:36:03,136 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -671094140, now seen corresponding path program 1 times [2018-01-23 14:36:03,136 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:03,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:03,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:03,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:03,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:03,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:36:03,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:36:03,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:36:03,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:36:03,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:36:03,372 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 7 states. [2018-01-23 14:36:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:03,565 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2018-01-23 14:36:03,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:36:03,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-23 14:36:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:03,566 INFO L225 Difference]: With dead ends: 205 [2018-01-23 14:36:03,566 INFO L226 Difference]: Without dead ends: 179 [2018-01-23 14:36:03,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:36:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-23 14:36:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 129. [2018-01-23 14:36:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:36:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-01-23 14:36:03,580 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 49 [2018-01-23 14:36:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:03,581 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-01-23 14:36:03,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:36:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-01-23 14:36:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:36:03,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:03,583 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:03,583 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1169201519, now seen corresponding path program 2 times [2018-01-23 14:36:03,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:03,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:03,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:03,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:03,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:03,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:03,680 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:36:03,687 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:36:03,704 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:03,729 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:03,733 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:03,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:03,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:03,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-23 14:36:03,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:36:03,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:36:03,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:36:03,780 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 5 states. [2018-01-23 14:36:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:03,831 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-01-23 14:36:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:36:03,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-23 14:36:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:03,833 INFO L225 Difference]: With dead ends: 171 [2018-01-23 14:36:03,833 INFO L226 Difference]: Without dead ends: 143 [2018-01-23 14:36:03,834 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:36:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-23 14:36:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-23 14:36:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-23 14:36:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2018-01-23 14:36:03,845 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 51 [2018-01-23 14:36:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:03,845 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2018-01-23 14:36:03,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:36:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2018-01-23 14:36:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:36:03,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:03,847 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] [2018-01-23 14:36:03,847 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1564018141, now seen corresponding path program 1 times [2018-01-23 14:36:03,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:03,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:03,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,849 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:03,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:03,862 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:03,862 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:03,863 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:03,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:03,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:03,929 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:36:03,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:03,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:03,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:36:03,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:03,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:03,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:36:03,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:03,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:03,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-23 14:36:03,980 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:36:03,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:03,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:04,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:04,021 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:36:04,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-23 14:36:04,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-23 14:36:04,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-23 14:36:04,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:04,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:04,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:04,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-01-23 14:36:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:04,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:04,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-01-23 14:36:04,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:36:04,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:36:04,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:36:04,164 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand 12 states. [2018-01-23 14:36:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:04,642 INFO L93 Difference]: Finished difference Result 307 states and 351 transitions. [2018-01-23 14:36:04,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-23 14:36:04,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-01-23 14:36:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:04,644 INFO L225 Difference]: With dead ends: 307 [2018-01-23 14:36:04,644 INFO L226 Difference]: Without dead ends: 286 [2018-01-23 14:36:04,645 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2018-01-23 14:36:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-23 14:36:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 154. [2018-01-23 14:36:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-23 14:36:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-01-23 14:36:04,657 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 59 [2018-01-23 14:36:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:04,658 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-01-23 14:36:04,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:36:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-01-23 14:36:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-23 14:36:04,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:04,659 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:04,659 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -460382961, now seen corresponding path program 3 times [2018-01-23 14:36:04,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:04,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:04,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:04,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:04,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:04,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:36:04,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:04,792 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:36:04,801 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:36:04,813 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:04,833 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:04,852 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:04,854 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:04,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:04,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:04,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-23 14:36:04,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:36:04,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:36:04,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:36:04,903 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 8 states. [2018-01-23 14:36:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:05,075 INFO L93 Difference]: Finished difference Result 228 states and 265 transitions. [2018-01-23 14:36:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:36:05,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-23 14:36:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:05,077 INFO L225 Difference]: With dead ends: 228 [2018-01-23 14:36:05,077 INFO L226 Difference]: Without dead ends: 144 [2018-01-23 14:36:05,078 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:36:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-23 14:36:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2018-01-23 14:36:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-23 14:36:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-01-23 14:36:05,092 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 61 [2018-01-23 14:36:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:05,092 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-01-23 14:36:05,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:36:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-01-23 14:36:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:36:05,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:05,094 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:05,094 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash 921910806, now seen corresponding path program 1 times [2018-01-23 14:36:05,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:05,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:05,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:05,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:05,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:05,108 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:05,108 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:05,108 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:05,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:05,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:05,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-23 14:36:05,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-23 14:36:05,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:05,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-23 14:36:05,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-01-23 14:36:05,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-01-23 14:36:05,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:05,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:05,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:05,386 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:36:05,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,388 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:05,396 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:27 [2018-01-23 14:36:05,500 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 21 treesize of output 17 [2018-01-23 14:36:05,510 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 17 treesize of output 18 [2018-01-23 14:36:05,512 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:36:05,523 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:36:05,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:36:05,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:05,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:05,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:05,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-23 14:36:05,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:95 [2018-01-23 14:36:05,791 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 32 treesize of output 36 [2018-01-23 14:36:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-23 14:36:05,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-23 14:36:05,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-01-23 14:36:05,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:05,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:05,923 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 26 treesize of output 22 [2018-01-23 14:36:05,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-23 14:36:05,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,930 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:05,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:05,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:59, output treesize:39 [2018-01-23 14:36:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:06,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:06,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-01-23 14:36:06,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:36:06,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:36:06,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:36:06,075 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 18 states. [2018-01-23 14:36:08,789 WARN L146 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 34 DAG size of output 33 [2018-01-23 14:36:09,073 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 60 DAG size of output 46 [2018-01-23 14:36:13,537 WARN L146 SmtUtils]: Spent 4036ms on a formula simplification. DAG size of input: 80 DAG size of output 36 [2018-01-23 14:36:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:13,892 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2018-01-23 14:36:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-23 14:36:13,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-01-23 14:36:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:13,893 INFO L225 Difference]: With dead ends: 213 [2018-01-23 14:36:13,894 INFO L226 Difference]: Without dead ends: 200 [2018-01-23 14:36:13,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:36:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-23 14:36:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 173. [2018-01-23 14:36:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-23 14:36:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2018-01-23 14:36:13,905 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 65 [2018-01-23 14:36:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:13,906 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2018-01-23 14:36:13,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:36:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2018-01-23 14:36:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-23 14:36:13,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:13,907 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:13,907 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:13,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1141691977, now seen corresponding path program 1 times [2018-01-23 14:36:13,907 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:13,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:13,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:13,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:13,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:13,918 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:13,919 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:13,919 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:13,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:13,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:14,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:36:14,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:14,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:14,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:14,129 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:36:14,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:43 [2018-01-23 14:36:14,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-01-23 14:36:14,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-01-23 14:36:14,190 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:36:14,200 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:36:14,213 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:36:14,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:67 [2018-01-23 14:36:14,624 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int) (v_prenex_19 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~10.base 1))) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= 0 (select .cse0 v_prenex_19)) (not (= v_prenex_19 0)) (not (= main_~x~10.base 0)) (= (store (store .cse0 v_prenex_19 0) main_~x~10.base 0) |c_#valid|)))) is different from true [2018-01-23 14:36:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:36:14,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:14,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-01-23 14:36:14,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-23 14:36:14,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-23 14:36:14,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=206, Unknown=6, NotChecked=28, Total=272 [2018-01-23 14:36:14,681 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand 17 states. [2018-01-23 14:36:15,691 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 81 DAG size of output 53 [2018-01-23 14:36:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:15,960 INFO L93 Difference]: Finished difference Result 190 states and 213 transitions. [2018-01-23 14:36:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-23 14:36:15,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-01-23 14:36:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:15,962 INFO L225 Difference]: With dead ends: 190 [2018-01-23 14:36:15,962 INFO L226 Difference]: Without dead ends: 184 [2018-01-23 14:36:15,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=737, Unknown=13, NotChecked=56, Total=930 [2018-01-23 14:36:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-23 14:36:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-01-23 14:36:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-23 14:36:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2018-01-23 14:36:15,980 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 66 [2018-01-23 14:36:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:15,980 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2018-01-23 14:36:15,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-23 14:36:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2018-01-23 14:36:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:36:15,981 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:15,981 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:15,981 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1994120349, now seen corresponding path program 2 times [2018-01-23 14:36:15,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:15,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:15,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:15,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:15,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:15,993 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:15,993 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:15,993 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:16,000 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:36:16,014 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:16,027 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:16,031 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:16,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:16,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:16,047 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:36:16,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-23 14:36:16,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:16,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,061 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:36:16,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-23 14:36:16,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:36:16,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:16,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-01-23 14:36:16,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-23 14:36:16,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-23 14:36:16,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-23 14:36:16,195 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:16,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-23 14:36:16,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-23 14:36:16,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:16,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:16,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:16,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:116 [2018-01-23 14:36:16,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 58 [2018-01-23 14:36:16,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2018-01-23 14:36:16,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2018-01-23 14:36:16,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-01-23 14:36:16,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2018-01-23 14:36:16,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-01-23 14:36:16,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,535 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:16,563 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:155, output treesize:143 [2018-01-23 14:36:16,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-01-23 14:36:16,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-23 14:36:16,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 66 [2018-01-23 14:36:16,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-01-23 14:36:16,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,717 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:16,717 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2018-01-23 14:36:16,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 57 [2018-01-23 14:36:16,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,786 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:16,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-01-23 14:36:16,789 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-23 14:36:16,814 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:16,845 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:173, output treesize:128 [2018-01-23 14:36:16,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 49 [2018-01-23 14:36:16,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 59 [2018-01-23 14:36:16,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:16,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2018-01-23 14:36:16,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:16,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-01-23 14:36:16,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,979 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 23 treesize of output 15 [2018-01-23 14:36:16,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:16,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 38 [2018-01-23 14:36:17,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-01-23 14:36:17,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,031 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,039 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:185, output treesize:73 [2018-01-23 14:36:17,176 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 57 treesize of output 55 [2018-01-23 14:36:17,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:17,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-23 14:36:17,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-01-23 14:36:17,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-23 14:36:17,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,300 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 26 treesize of output 21 [2018-01-23 14:36:17,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:17,339 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 1 case distinctions, treesize of input 35 treesize of output 48 [2018-01-23 14:36:17,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:36:17,377 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-23 14:36:17,410 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:17,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 61 [2018-01-23 14:36:17,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2018-01-23 14:36:17,484 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,552 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-01-23 14:36:17,552 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-01-23 14:36:17,626 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 7 xjuncts. [2018-01-23 14:36:17,699 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 29 treesize of output 17 [2018-01-23 14:36:17,699 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,701 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 28 treesize of output 16 [2018-01-23 14:36:17,701 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,753 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 28 treesize of output 23 [2018-01-23 14:36:17,753 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,800 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 19 treesize of output 16 [2018-01-23 14:36:17,800 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,801 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 20 treesize of output 17 [2018-01-23 14:36:17,801 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-01-23 14:36:17,870 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,905 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 1 case distinctions, treesize of input 15 treesize of output 13 [2018-01-23 14:36:17,906 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:17,931 INFO L267 ElimStorePlain]: Start of recursive call 10: 12 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:17,961 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 53 treesize of output 55 [2018-01-23 14:36:17,964 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-23 14:36:17,965 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:17,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-23 14:36:17,990 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,011 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 14 treesize of output 9 [2018-01-23 14:36:18,011 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-01-23 14:36:18,032 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 17 [2018-01-23 14:36:18,052 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:18,062 INFO L267 ElimStorePlain]: Start of recursive call 21: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:18,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:18,076 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 4 variables, input treesize:213, output treesize:22 [2018-01-23 14:36:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:18,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:18,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-23 14:36:18,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-23 14:36:18,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-23 14:36:18,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-01-23 14:36:18,196 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand 25 states. [2018-01-23 14:36:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:20,031 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2018-01-23 14:36:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-23 14:36:20,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-01-23 14:36:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:20,034 INFO L225 Difference]: With dead ends: 304 [2018-01-23 14:36:20,034 INFO L226 Difference]: Without dead ends: 287 [2018-01-23 14:36:20,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=2529, Unknown=0, NotChecked=0, Total=2970 [2018-01-23 14:36:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-23 14:36:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 186. [2018-01-23 14:36:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-23 14:36:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2018-01-23 14:36:20,057 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 73 [2018-01-23 14:36:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:20,057 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2018-01-23 14:36:20,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-23 14:36:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2018-01-23 14:36:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:36:20,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:20,059 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:20,059 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1983315905, now seen corresponding path program 1 times [2018-01-23 14:36:20,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:20,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:20,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:20,060 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:20,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:20,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:21,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:21,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:36:21,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:21,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:21,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:21,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-01-23 14:36:21,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-01-23 14:36:21,233 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 11 treesize of output 8 [2018-01-23 14:36:21,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:21,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-23 14:36:21,293 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 54 treesize of output 50 [2018-01-23 14:36:21,295 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 12 treesize of output 11 [2018-01-23 14:36:21,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:60 [2018-01-23 14:36:21,377 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 55 treesize of output 44 [2018-01-23 14:36:21,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2018-01-23 14:36:21,383 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:36:21,397 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:36:21,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:21,421 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:36:21,422 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2018-01-23 14:36:21,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:21,519 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 17 treesize of output 21 [2018-01-23 14:36:21,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:21,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2018-01-23 14:36:21,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:21,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:21,607 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 17 treesize of output 21 [2018-01-23 14:36:21,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:21,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:21,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-01-23 14:36:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:21,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:21,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2018-01-23 14:36:21,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-23 14:36:21,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-23 14:36:21,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:36:21,698 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand 29 states. [2018-01-23 14:36:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:23,665 INFO L93 Difference]: Finished difference Result 329 states and 373 transitions. [2018-01-23 14:36:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-23 14:36:23,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-01-23 14:36:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:23,667 INFO L225 Difference]: With dead ends: 329 [2018-01-23 14:36:23,667 INFO L226 Difference]: Without dead ends: 294 [2018-01-23 14:36:23,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=207, Invalid=2145, Unknown=0, NotChecked=0, Total=2352 [2018-01-23 14:36:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-23 14:36:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 246. [2018-01-23 14:36:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-01-23 14:36:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2018-01-23 14:36:23,691 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 73 [2018-01-23 14:36:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:23,691 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2018-01-23 14:36:23,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-23 14:36:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2018-01-23 14:36:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:36:23,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:23,693 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:23,693 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash -420979568, now seen corresponding path program 1 times [2018-01-23 14:36:23,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:23,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:23,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:23,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:23,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:23,705 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:23,705 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:23,706 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:23,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:23,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:23,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:23,768 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:36:23,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:23,777 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:36:23,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-23 14:36:23,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:23,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,799 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:36:23,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:23,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:36:23,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-23 14:36:23,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:36:23,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:23,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:36:23,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:23,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:23,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2018-01-23 14:36:23,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-23 14:36:23,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-23 14:36:23,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-23 14:36:23,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-23 14:36:23,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:23,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-01-23 14:36:24,040 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:24,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 66 [2018-01-23 14:36:24,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,064 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 51 treesize of output 70 [2018-01-23 14:36:24,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,103 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:24,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 87 [2018-01-23 14:36:24,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 114 [2018-01-23 14:36:24,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:24,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:24,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:24,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:246 [2018-01-23 14:36:24,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 135 [2018-01-23 14:36:24,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 209 [2018-01-23 14:36:24,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 111 [2018-01-23 14:36:24,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,529 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 110 treesize of output 139 [2018-01-23 14:36:24,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 97 [2018-01-23 14:36:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 105 [2018-01-23 14:36:24,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:24,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 99 [2018-01-23 14:36:24,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,858 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 100 treesize of output 147 [2018-01-23 14:36:24,858 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,885 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:24,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 165 [2018-01-23 14:36:24,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:24,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 289 [2018-01-23 14:36:24,972 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,028 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:25,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 109 [2018-01-23 14:36:25,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 125 [2018-01-23 14:36:25,121 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,161 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:25,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:25,225 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:324, output treesize:526 [2018-01-23 14:36:25,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 163 [2018-01-23 14:36:25,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 226 [2018-01-23 14:36:25,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 150 [2018-01-23 14:36:25,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 237 [2018-01-23 14:36:25,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 317 treesize of output 215 [2018-01-23 14:36:25,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 379 [2018-01-23 14:36:25,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:25,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,923 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:25,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:25,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 185 [2018-01-23 14:36:25,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:26,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:26,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 162 [2018-01-23 14:36:26,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 198 [2018-01-23 14:36:26,131 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,212 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 260 [2018-01-23 14:36:26,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 367 [2018-01-23 14:36:26,319 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,416 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:26,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,417 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:26,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 245 [2018-01-23 14:36:26,426 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:26,490 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:26,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 126 [2018-01-23 14:36:26,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 139 [2018-01-23 14:36:26,578 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,634 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:26,691 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:640, output treesize:578 [2018-01-23 14:36:26,729 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:26,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 195 treesize of output 135 [2018-01-23 14:36:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:26,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-01-23 14:36:26,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 97 [2018-01-23 14:36:26,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 105 [2018-01-23 14:36:26,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,003 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:27,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 86 [2018-01-23 14:36:27,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-01-23 14:36:27,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,021 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,094 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:27,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 127 [2018-01-23 14:36:27,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 78 [2018-01-23 14:36:27,106 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,116 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,180 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:27,183 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:27,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 284 treesize of output 198 [2018-01-23 14:36:27,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 246 [2018-01-23 14:36:27,199 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,243 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:27,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 132 [2018-01-23 14:36:27,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 217 [2018-01-23 14:36:27,309 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,352 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:27,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:27,399 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:612, output treesize:366 [2018-01-23 14:36:27,470 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_64 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_prenex_64)) (.cse8 (select |c_#memory_$Pointer$.offset| v_prenex_64))) (let ((.cse4 (select .cse8 4)) (.cse2 (select .cse7 0))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (+ .cse4 4))) (let ((.cse5 (select .cse6 .cse1))) (let ((.cse0 (select |c_#memory_$Pointer$.base| c_main_~first~5.base)) (.cse3 (select .cse8 .cse5))) (and (= c_main_~first~5.base (select .cse0 .cse1)) (= c_main_~first~5.base .cse2) (= (select .cse0 .cse3) v_prenex_64) (= .cse3 .cse4) (= .cse5 0) (= (select .cse6 .cse4) 0) (= c_main_~first~5.base (select .cse7 4)) (= 0 .cse4)))))))) (let ((.cse12 (select |c_#memory_$Pointer$.base| c_main_~first~5.base))) (let ((.cse13 (select .cse12 4))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse13))) (let ((.cse9 (select .cse14 0)) (.cse15 (select |c_#memory_$Pointer$.offset| .cse13))) (let ((.cse11 (select .cse15 0)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse9))) (and (= .cse9 c_main_~first~5.base) (= (select .cse10 .cse11) 0) (= (select .cse12 0) .cse13) (= .cse11 0) (= c_main_~first~5.base (select .cse14 4)) (= (select .cse10 4) 0) (= (select .cse15 4) 0)))))))) is different from true [2018-01-23 14:36:27,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 132 [2018-01-23 14:36:27,744 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 102 treesize of output 97 [2018-01-23 14:36:27,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:27,796 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 104 treesize of output 98 [2018-01-23 14:36:27,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 93 [2018-01-23 14:36:27,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:27,910 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 78 treesize of output 73 [2018-01-23 14:36:27,910 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:28,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,065 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 66 [2018-01-23 14:36:28,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-01-23 14:36:28,068 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2018-01-23 14:36:28,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:28,143 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 29 treesize of output 24 [2018-01-23 14:36:28,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 40 [2018-01-23 14:36:28,188 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-01-23 14:36:28,232 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-23 14:36:28,233 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,280 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-01-23 14:36:28,281 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:28,289 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-01-23 14:36:28,290 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:28,319 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 22 treesize of output 12 [2018-01-23 14:36:28,319 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:28,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-01-23 14:36:28,347 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 51 treesize of output 33 [2018-01-23 14:36:28,347 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,360 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 33 treesize of output 28 [2018-01-23 14:36:28,360 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,370 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-23 14:36:28,371 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,379 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,389 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 71 [2018-01-23 14:36:28,392 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 45 treesize of output 40 [2018-01-23 14:36:28,392 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-01-23 14:36:28,429 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,460 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 22 [2018-01-23 14:36:28,460 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,486 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-01-23 14:36:28,487 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:28,498 INFO L267 ElimStorePlain]: Start of recursive call 20: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 131 [2018-01-23 14:36:28,554 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 119 treesize of output 114 [2018-01-23 14:36:28,555 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,719 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:28,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,721 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:28,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 64 [2018-01-23 14:36:28,731 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:28,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,835 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:28,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2018-01-23 14:36:28,844 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:28,940 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:28,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:28,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 56 [2018-01-23 14:36:28,949 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:29,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:29,056 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 114 treesize of output 84 [2018-01-23 14:36:29,057 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,114 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 78 treesize of output 68 [2018-01-23 14:36:29,114 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:29,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:29,280 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:29,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 65 [2018-01-23 14:36:29,281 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-01-23 14:36:29,319 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,372 INFO L267 ElimStorePlain]: Start of recursive call 25: 13 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:29,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2018-01-23 14:36:29,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 43 [2018-01-23 14:36:29,479 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:29,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:29,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-01-23 14:36:29,555 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:29,670 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 45 treesize of output 35 [2018-01-23 14:36:29,670 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-01-23 14:36:29,723 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 23 [2018-01-23 14:36:29,782 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:29,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:29,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-23 14:36:29,827 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-23 14:36:29,862 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-01-23 14:36:29,925 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:36:29,955 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:29,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2018-01-23 14:36:29,988 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:30,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 44 [2018-01-23 14:36:30,030 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 12 xjuncts. [2018-01-23 14:36:30,068 INFO L267 ElimStorePlain]: Start of recursive call 34: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-23 14:36:30,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-23 14:36:30,086 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 10 variables, input treesize:535, output treesize:38 [2018-01-23 14:36:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:36:30,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:30,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-01-23 14:36:30,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:36:30,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:36:30,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=383, Unknown=5, NotChecked=40, Total=506 [2018-01-23 14:36:30,246 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand 23 states. [2018-01-23 14:36:31,177 WARN L1029 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_$Pointer$.base| c_main_~x~10.base))) (let ((.cse7 (= c_main_~y~10.base (select .cse1 c_main_~x~10.offset)))) (or (let ((.cse0 (select .cse1 4))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse6 (select .cse3 0)) (.cse4 (select |c_#memory_$Pointer$.offset| .cse0))) (let ((.cse2 (select .cse4 0)) (.cse5 (select |c_#memory_$Pointer$.offset| .cse6))) (and (= .cse0 (select .cse1 0)) (= .cse2 0) (= c_main_~x~10.base (select .cse3 4)) (= (select .cse4 4) 0) (= 0 (select .cse5 .cse2)) (= 0 (select .cse5 4)) (= c_main_~x~10.base .cse6) .cse7))))) (and (exists ((v_prenex_64 Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| v_prenex_64)) (.cse16 (select |c_#memory_$Pointer$.offset| v_prenex_64))) (let ((.cse10 (select .cse16 4)) (.cse8 (select .cse15 0))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| .cse8)) (.cse12 (+ .cse10 4))) (let ((.cse13 (select .cse14 .cse12))) (let ((.cse11 (select |c_#memory_$Pointer$.base| c_main_~x~10.base)) (.cse9 (select .cse16 .cse13))) (and (= c_main_~x~10.base .cse8) (= .cse9 .cse10) (= c_main_~x~10.base (select .cse11 .cse12)) (= .cse13 0) (= (select .cse14 .cse10) 0) (= 0 .cse10) (= (select .cse11 .cse9) v_prenex_64) (= c_main_~x~10.base (select .cse15 4))))))))) .cse7)))) (= |c_main_#t~malloc3.offset| 0) (= 0 c_main_~x~6.offset) (or (let ((.cse22 (select |c_#memory_$Pointer$.base| c_main_~x~6.base))) (let ((.cse21 (select .cse22 4))) (let ((.cse23 (select |c_#memory_$Pointer$.base| .cse21))) (let ((.cse17 (select |c_#memory_$Pointer$.offset| .cse21)) (.cse18 (select .cse23 0))) (let ((.cse19 (select |c_#memory_$Pointer$.offset| .cse18)) (.cse20 (select .cse17 0))) (and (= (select .cse17 4) 0) (= .cse18 c_main_~x~6.base) (= 0 (select .cse19 4)) (= .cse20 0) (= (select .cse19 .cse20) 0) (= .cse21 (select .cse22 0)) (= (select .cse23 4) c_main_~x~6.base))))))) (exists ((v_prenex_64 Int)) (let ((.cse29 (select |c_#memory_$Pointer$.base| v_prenex_64)) (.cse32 (select |c_#memory_$Pointer$.offset| v_prenex_64))) (let ((.cse27 (select .cse32 4)) (.cse31 (select .cse29 0))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| .cse31)) (.cse25 (+ .cse27 4))) (let ((.cse28 (select .cse30 .cse25))) (let ((.cse24 (select |c_#memory_$Pointer$.base| c_main_~x~6.base)) (.cse26 (select .cse32 .cse28))) (and (= (select .cse24 .cse25) c_main_~x~6.base) (= (select .cse24 .cse26) v_prenex_64) (= .cse26 .cse27) (= .cse28 0) (= (select .cse29 4) c_main_~x~6.base) (= (select .cse30 .cse27) 0) (= 0 .cse27) (= .cse31 c_main_~x~6.base)))))))))) is different from true [2018-01-23 14:36:31,715 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 73 DAG size of output 65 [2018-01-23 14:36:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:31,862 INFO L93 Difference]: Finished difference Result 442 states and 495 transitions. [2018-01-23 14:36:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-23 14:36:31,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-01-23 14:36:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:31,864 INFO L225 Difference]: With dead ends: 442 [2018-01-23 14:36:31,864 INFO L226 Difference]: Without dead ends: 404 [2018-01-23 14:36:31,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=1522, Unknown=9, NotChecked=166, Total=1980 [2018-01-23 14:36:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-01-23 14:36:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 247. [2018-01-23 14:36:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-23 14:36:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 277 transitions. [2018-01-23 14:36:31,883 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 277 transitions. Word has length 79 [2018-01-23 14:36:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:31,883 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 277 transitions. [2018-01-23 14:36:31,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:36:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 277 transitions. [2018-01-23 14:36:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:36:31,885 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:31,885 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:31,885 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:31,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1264985070, now seen corresponding path program 1 times [2018-01-23 14:36:31,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:31,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:31,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:31,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:31,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:31,895 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:31,895 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:31,895 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:31,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:31,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-23 14:36:32,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:32,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-01-23 14:36:32,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:36:32,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:36:32,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:36:32,005 INFO L87 Difference]: Start difference. First operand 247 states and 277 transitions. Second operand 5 states. [2018-01-23 14:36:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:32,072 INFO L93 Difference]: Finished difference Result 459 states and 516 transitions. [2018-01-23 14:36:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:36:32,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-23 14:36:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:32,074 INFO L225 Difference]: With dead ends: 459 [2018-01-23 14:36:32,074 INFO L226 Difference]: Without dead ends: 221 [2018-01-23 14:36:32,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:36:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-23 14:36:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-01-23 14:36:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-23 14:36:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2018-01-23 14:36:32,098 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 79 [2018-01-23 14:36:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:32,098 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2018-01-23 14:36:32,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:36:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2018-01-23 14:36:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:36:32,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:32,099 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:32,099 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2054748333, now seen corresponding path program 1 times [2018-01-23 14:36:32,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:32,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:32,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:32,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:32,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:32,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:32,554 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 32 DAG size of output 14 [2018-01-23 14:36:32,848 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 43 DAG size of output 21 [2018-01-23 14:36:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:33,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:33,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:36:33,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:33,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:33,188 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:36:33,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:36:33,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,269 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:36:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:36:33,335 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:36:33,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:33,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-23 14:36:33,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:33,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-23 14:36:33,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-23 14:36:33,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:36:33,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:33,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2018-01-23 14:36:33,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-23 14:36:33,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:33,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-23 14:36:33,452 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 58 treesize of output 42 [2018-01-23 14:36:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,454 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 31 treesize of output 54 [2018-01-23 14:36:33,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-01-23 14:36:33,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2018-01-23 14:36:33,624 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 20 treesize of output 13 [2018-01-23 14:36:33,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:33,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:33,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 29 [2018-01-23 14:36:33,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:33,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:33,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:33,697 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:35 [2018-01-23 14:36:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:33,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:33,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2018-01-23 14:36:33,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-23 14:36:33,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-23 14:36:33,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:36:33,844 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand 33 states. [2018-01-23 14:36:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:35,449 INFO L93 Difference]: Finished difference Result 426 states and 482 transitions. [2018-01-23 14:36:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-23 14:36:35,449 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 80 [2018-01-23 14:36:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:35,450 INFO L225 Difference]: With dead ends: 426 [2018-01-23 14:36:35,451 INFO L226 Difference]: Without dead ends: 397 [2018-01-23 14:36:35,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=359, Invalid=3181, Unknown=0, NotChecked=0, Total=3540 [2018-01-23 14:36:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-23 14:36:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 307. [2018-01-23 14:36:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-01-23 14:36:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 344 transitions. [2018-01-23 14:36:35,472 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 344 transitions. Word has length 80 [2018-01-23 14:36:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:35,472 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 344 transitions. [2018-01-23 14:36:35,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-23 14:36:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 344 transitions. [2018-01-23 14:36:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:36:35,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:35,473 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:35,473 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 93840355, now seen corresponding path program 2 times [2018-01-23 14:36:35,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:35,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:35,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:35,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:35,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:35,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:36:35,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:35,988 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:36:35,993 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:36:36,003 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:36,017 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:36,023 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:36,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:36,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:36:36,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:36:36,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:36,070 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:36:36,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-23 14:36:36,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:36,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,094 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:36:36,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-23 14:36:36,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:36:36,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-23 14:36:36,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2018-01-23 14:36:36,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,160 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:36:36,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-01-23 14:36:36,210 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 28 treesize of output 29 [2018-01-23 14:36:36,211 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:36:36,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-23 14:36:36,251 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 37 treesize of output 36 [2018-01-23 14:36:36,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-23 14:36:36,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-01-23 14:36:36,303 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 44 treesize of output 41 [2018-01-23 14:36:36,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,308 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:36:36,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-01-23 14:36:36,364 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 53 treesize of output 48 [2018-01-23 14:36:36,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-23 14:36:36,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2018-01-23 14:36:36,437 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 68 treesize of output 61 [2018-01-23 14:36:36,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-23 14:36:36,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:59 [2018-01-23 14:36:36,489 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 62 treesize of output 59 [2018-01-23 14:36:36,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,492 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 21 treesize of output 36 [2018-01-23 14:36:36,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:36,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-01-23 14:36:36,560 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 120 treesize of output 82 [2018-01-23 14:36:36,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 127 [2018-01-23 14:36:36,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:36,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:102 [2018-01-23 14:36:36,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 71 [2018-01-23 14:36:36,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 56 [2018-01-23 14:36:36,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-23 14:36:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 64 [2018-01-23 14:36:36,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-01-23 14:36:36,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:36,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 59 [2018-01-23 14:36:36,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:36,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:36,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:36,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:109, output treesize:17 [2018-01-23 14:36:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:36:36,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:36,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-01-23 14:36:36,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-23 14:36:36,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-23 14:36:36,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:36:36,996 INFO L87 Difference]: Start difference. First operand 307 states and 344 transitions. Second operand 33 states. [2018-01-23 14:36:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:39,694 INFO L93 Difference]: Finished difference Result 440 states and 501 transitions. [2018-01-23 14:36:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-23 14:36:39,695 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 80 [2018-01-23 14:36:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:39,696 INFO L225 Difference]: With dead ends: 440 [2018-01-23 14:36:39,696 INFO L226 Difference]: Without dead ends: 396 [2018-01-23 14:36:39,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=580, Invalid=3580, Unknown=0, NotChecked=0, Total=4160 [2018-01-23 14:36:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-01-23 14:36:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 313. [2018-01-23 14:36:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-23 14:36:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 351 transitions. [2018-01-23 14:36:39,732 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 351 transitions. Word has length 80 [2018-01-23 14:36:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:39,733 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 351 transitions. [2018-01-23 14:36:39,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-23 14:36:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 351 transitions. [2018-01-23 14:36:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-23 14:36:39,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:39,734 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:39,734 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 209846235, now seen corresponding path program 2 times [2018-01-23 14:36:39,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:39,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:39,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:39,736 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:39,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:39,744 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-23 14:36:39,744 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-23 14:36:39,744 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-23 14:36:39,752 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:36:39,770 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:39,791 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:39,799 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:39,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:39,819 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:36:39,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:36:39,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:39,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:39,860 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:36:39,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-01-23 14:36:39,913 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:36:39,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:36:39,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,932 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:36:39,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-01-23 14:36:39,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:39,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:39,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:39,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:36:39,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:39,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-01-23 14:36:40,078 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:36:40,080 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 12 treesize of output 11 [2018-01-23 14:36:40,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-23 14:36:40,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,158 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 49 treesize of output 65 [2018-01-23 14:36:40,161 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 14 treesize of output 13 [2018-01-23 14:36:40,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:40,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-23 14:36:40,280 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 54 treesize of output 54 [2018-01-23 14:36:40,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-01-23 14:36:40,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:40,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-01-23 14:36:40,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,404 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 69 treesize of output 81 [2018-01-23 14:36:40,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-01-23 14:36:40,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:40,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:60 [2018-01-23 14:36:40,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 80 [2018-01-23 14:36:40,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-01-23 14:36:40,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,474 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 12 [2018-01-23 14:36:40,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-23 14:36:40,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:40,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:76 [2018-01-23 14:36:40,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-23 14:36:40,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:36:40,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:40,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:40,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:40,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:144 [2018-01-23 14:36:40,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:40,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 91 [2018-01-23 14:36:40,802 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 87 [2018-01-23 14:36:40,803 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:36:40,889 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 43 treesize of output 34 [2018-01-23 14:36:40,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:40,954 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:36:40,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,058 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2018-01-23 14:36:41,059 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-01-23 14:36:41,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-01-23 14:36:41,144 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 17 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:41,208 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:41,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 83 [2018-01-23 14:36:41,230 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 83 [2018-01-23 14:36:41,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:41,318 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 39 treesize of output 31 [2018-01-23 14:36:41,318 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,372 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 56 treesize of output 55 [2018-01-23 14:36:41,373 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-23 14:36:41,431 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-23 14:36:41,483 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-01-23 14:36:41,506 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,519 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 26 treesize of output 17 [2018-01-23 14:36:41,520 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:41,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:41,533 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-01-23 14:36:41,534 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,545 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 29 treesize of output 25 [2018-01-23 14:36:41,545 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:41,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:36:41,607 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:41,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 17 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:41,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:41,619 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:237, output treesize:9 [2018-01-23 14:36:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:41,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:36:41,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-01-23 14:36:41,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-23 14:36:41,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-23 14:36:41,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-01-23 14:36:41,716 INFO L87 Difference]: Start difference. First operand 313 states and 351 transitions. Second operand 23 states. [2018-01-23 14:36:43,816 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 85 DAG size of output 78 [2018-01-23 14:36:43,957 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 89 DAG size of output 82 [2018-01-23 14:36:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:44,287 INFO L93 Difference]: Finished difference Result 457 states and 512 transitions. [2018-01-23 14:36:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:36:44,287 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-01-23 14:36:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:44,289 INFO L225 Difference]: With dead ends: 457 [2018-01-23 14:36:44,289 INFO L226 Difference]: Without dead ends: 450 [2018-01-23 14:36:44,290 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=593, Invalid=2713, Unknown=0, NotChecked=0, Total=3306 [2018-01-23 14:36:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-01-23 14:36:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 320. [2018-01-23 14:36:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-23 14:36:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 359 transitions. [2018-01-23 14:36:44,324 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 359 transitions. Word has length 82 [2018-01-23 14:36:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:44,324 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 359 transitions. [2018-01-23 14:36:44,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-23 14:36:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 359 transitions. [2018-01-23 14:36:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-23 14:36:44,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:44,325 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:44,325 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1662423642, now seen corresponding path program 1 times [2018-01-23 14:36:44,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:44,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:44,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:44,327 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:44,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:44,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:44,527 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-23 14:36:44,528 ERROR L119 erpolLogProxyWrapper]: Interpolant 44 not inductive: (Check returned sat) [2018-01-23 14:36:44,529 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-23 14:36:44,533 INFO L168 Benchmark]: Toolchain (without parser) took 44208.44 ms. Allocated memory was 305.7 MB in the beginning and 738.7 MB in the end (delta: 433.1 MB). Free memory was 265.6 MB in the beginning and 346.7 MB in the end (delta: -81.1 MB). Peak memory consumption was 352.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:44,534 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:36:44,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.17 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 253.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:44,534 INFO L168 Benchmark]: Boogie Preprocessor took 34.72 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 251.4 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:36:44,534 INFO L168 Benchmark]: RCFGBuilder took 351.99 ms. Allocated memory is still 305.7 MB. Free memory was 251.4 MB in the beginning and 228.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:44,535 INFO L168 Benchmark]: TraceAbstraction took 43610.80 ms. Allocated memory was 305.7 MB in the beginning and 738.7 MB in the end (delta: 433.1 MB). Free memory was 227.3 MB in the beginning and 346.7 MB in the end (delta: -119.3 MB). Peak memory consumption was 313.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:44,536 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.19 ms. Allocated memory is still 305.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.17 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 253.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.72 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 351.99 ms. Allocated memory is still 305.7 MB. Free memory was 251.4 MB in the beginning and 228.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43610.80 ms. Allocated memory was 305.7 MB in the beginning and 738.7 MB in the end (delta: 433.1 MB). Free memory was 227.3 MB in the beginning and 346.7 MB in the end (delta: -119.3 MB). Peak memory consumption was 313.7 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, 63 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=63occurred 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: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, c1=0, c1 < 5 && __VERIFIER_nondet_int()=0, c2=0, first={0:0}, last={0:0}] [L635] COND FALSE !(c1 < 5 && __VERIFIER_nondet_int()) [L668] COND FALSE !(c1 > 0) VAL [c1=0, c2=0, first={0:0}, last={0:0}] [L682] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 63 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-36-44-543.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-36-44-543.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-36-44-543.csv Received shutdown request...