java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:05:39,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:05:39,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:05:39,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:05:39,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:05:39,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:05:39,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:05:39,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:05:39,095 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:05:39,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:05:39,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:05:39,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:05:39,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:05:39,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:05:39,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:05:39,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:05:39,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:05:39,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:05:39,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:05:39,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:05:39,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:05:39,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:05:39,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:05:39,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:05:39,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:05:39,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:05:39,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:05:39,115 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:05:39,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:05:39,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:05:39,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:05:39,117 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-20 22:05:39,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:05:39,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:05:39,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:05:39,128 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:05:39,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:05:39,128 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:05:39,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:05:39,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:05:39,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:05:39,130 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:05:39,130 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:05:39,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:05:39,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:05:39,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:05:39,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:05:39,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:05:39,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:05:39,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:05:39,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:05:39,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:05:39,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:05:39,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:05:39,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:05:39,133 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:05:39,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:05:39,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:05:39,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:05:39,133 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:05:39,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:05:39,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:05:39,134 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:05:39,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:05:39,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:05:39,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:05:39,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:05:39,136 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:05:39,136 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:05:39,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:05:39,183 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:05:39,187 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:05:39,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:05:39,189 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:05:39,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-01-20 22:05:39,365 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:05:39,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:05:39,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:05:39,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:05:39,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:05:39,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726f39e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39, skipping insertion in model container [2018-01-20 22:05:39,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,396 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:05:39,436 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:05:39,555 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:05:39,581 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:05:39,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39 WrapperNode [2018-01-20 22:05:39,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:05:39,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:05:39,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:05:39,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:05:39,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (1/1) ... [2018-01-20 22:05:39,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:05:39,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:05:39,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:05:39,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:05:39,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (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-20 22:05:39,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:05:39,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:05:39,668 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:05:39,669 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:05:39,670 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:05:39,670 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:05:40,014 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:05:40,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:05:40 BoogieIcfgContainer [2018-01-20 22:05:40,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:05:40,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:05:40,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:05:40,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:05:40,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:05:39" (1/3) ... [2018-01-20 22:05:40,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57051268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:05:40, skipping insertion in model container [2018-01-20 22:05:40,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:05:39" (2/3) ... [2018-01-20 22:05:40,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57051268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:05:40, skipping insertion in model container [2018-01-20 22:05:40,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:05:40" (3/3) ... [2018-01-20 22:05:40,020 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-01-20 22:05:40,026 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:05:40,032 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:05:40,066 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:05:40,066 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:05:40,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:05:40,066 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:05:40,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:05:40,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:05:40,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:05:40,067 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:05:40,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:05:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-01-20 22:05:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:05:40,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,096 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:05:40,097 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:05:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 178748, now seen corresponding path program 1 times [2018-01-20 22:05:40,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:05:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:05:40,196 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:05:40,202 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:05:40,210 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:05:40,210 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:05:40,210 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:05:40,210 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:05:40,210 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:05:40,211 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:05:40,211 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:05:40,211 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:05:40,211 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:05:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-01-20 22:05:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:05:40,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,217 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,217 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:05:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1961960643, now seen corresponding path program 1 times [2018-01-20 22:05:40,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:40,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:40,279 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-20 22:05:40,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:40,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:05:40,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:05:40,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:05:40,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:05:40,385 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-01-20 22:05:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:40,413 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2018-01-20 22:05:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:05:40,415 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 22:05:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:40,427 INFO L225 Difference]: With dead ends: 160 [2018-01-20 22:05:40,427 INFO L226 Difference]: Without dead ends: 82 [2018-01-20 22:05:40,431 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-20 22:05:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-20 22:05:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-20 22:05:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-20 22:05:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-20 22:05:40,466 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 20 [2018-01-20 22:05:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:40,466 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-20 22:05:40,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:05:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-20 22:05:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:05:40,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,467 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,468 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:05:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2069207582, now seen corresponding path program 1 times [2018-01-20 22:05:40,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:40,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:40,566 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-20 22:05:40,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:40,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:05:40,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:05:40,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:05:40,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:05:40,570 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-01-20 22:05:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:40,626 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-20 22:05:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:05:40,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 22:05:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:40,629 INFO L225 Difference]: With dead ends: 91 [2018-01-20 22:05:40,629 INFO L226 Difference]: Without dead ends: 86 [2018-01-20 22:05:40,630 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:05:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-20 22:05:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-20 22:05:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-20 22:05:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-20 22:05:40,640 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 23 [2018-01-20 22:05:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:40,641 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-20 22:05:40,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:05:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-20 22:05:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 22:05:40,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,643 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,643 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:05:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1378605137, now seen corresponding path program 1 times [2018-01-20 22:05:40,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:05:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:05:40,721 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:05:40,729 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:05:40,734 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:05:40,734 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:05:40,745 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:05:40,745 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:05:40,746 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:05:40,746 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:05:40,746 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:05:40,746 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:05:40,746 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:05:40,746 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:05:40,746 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:05:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-01-20 22:05:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:05:40,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,748 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,748 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash -757348010, now seen corresponding path program 1 times [2018-01-20 22:05:40,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:40,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:40,770 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-20 22:05:40,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:40,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:05:40,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:05:40,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:05:40,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:05:40,772 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-01-20 22:05:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:40,780 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2018-01-20 22:05:40,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:05:40,780 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 22:05:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:40,781 INFO L225 Difference]: With dead ends: 160 [2018-01-20 22:05:40,781 INFO L226 Difference]: Without dead ends: 80 [2018-01-20 22:05:40,781 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-20 22:05:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-20 22:05:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-20 22:05:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-20 22:05:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-20 22:05:40,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 18 [2018-01-20 22:05:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:40,787 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-20 22:05:40,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:05:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-20 22:05:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:05:40,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,787 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1655945531, now seen corresponding path program 1 times [2018-01-20 22:05:40,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:40,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:40,836 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-20 22:05:40,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:40,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:05:40,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:05:40,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:05:40,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:05:40,837 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2018-01-20 22:05:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:40,864 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-01-20 22:05:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:05:40,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-20 22:05:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:40,865 INFO L225 Difference]: With dead ends: 87 [2018-01-20 22:05:40,865 INFO L226 Difference]: Without dead ends: 84 [2018-01-20 22:05:40,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:05:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-20 22:05:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-01-20 22:05:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-20 22:05:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-20 22:05:40,870 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2018-01-20 22:05:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:40,871 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-20 22:05:40,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:05:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-20 22:05:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:05:40,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:40,872 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:40,872 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash 990743112, now seen corresponding path program 1 times [2018-01-20 22:05:40,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:40,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:40,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:40,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:40,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:41,334 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 39 DAG size of output 19 [2018-01-20 22:05:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:41,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:05:41,776 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-20 22:05:41,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:41,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:05:41,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:05:41,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:05:41,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:41,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:41,985 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-20 22:05:41,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:54 [2018-01-20 22:05:42,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-01-20 22:05:42,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2018-01-20 22:05:42,082 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-20 22:05:42,100 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-20 22:05:42,120 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-20 22:05:42,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:69 [2018-01-20 22:05:42,317 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (let ((.cse1 (store .cse0 main_~st~4.base 0))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store .cse1 main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= (select .cse1 main_~n~4.base) 1) (= 0 (select |c_old(#valid)| main_~n~4.base)))))) is different from true [2018-01-20 22:05:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-20 22:05:42,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:05:42,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-20 22:05:42,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:05:42,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:05:42,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=420, Unknown=1, NotChecked=40, Total=506 [2018-01-20 22:05:42,356 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 23 states. [2018-01-20 22:05:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:44,021 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2018-01-20 22:05:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 22:05:44,022 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-01-20 22:05:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:44,024 INFO L225 Difference]: With dead ends: 162 [2018-01-20 22:05:44,025 INFO L226 Difference]: Without dead ends: 159 [2018-01-20 22:05:44,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=169, Invalid=1161, Unknown=6, NotChecked=70, Total=1406 [2018-01-20 22:05:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-20 22:05:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2018-01-20 22:05:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 22:05:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-01-20 22:05:44,037 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-01-20 22:05:44,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:44,038 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-01-20 22:05:44,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:05:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-01-20 22:05:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 22:05:44,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:44,039 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:44,039 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:44,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1839012493, now seen corresponding path program 1 times [2018-01-20 22:05:44,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:44,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:44,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:44,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:44,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:44,110 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-20 22:05:44,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:44,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:05:44,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:05:44,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:05:44,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:05:44,111 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 5 states. [2018-01-20 22:05:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:44,187 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-01-20 22:05:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:05:44,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-20 22:05:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:44,190 INFO L225 Difference]: With dead ends: 169 [2018-01-20 22:05:44,190 INFO L226 Difference]: Without dead ends: 166 [2018-01-20 22:05:44,190 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:05:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-20 22:05:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2018-01-20 22:05:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 22:05:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-01-20 22:05:44,204 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 39 [2018-01-20 22:05:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:44,205 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-01-20 22:05:44,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:05:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-01-20 22:05:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-20 22:05:44,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:44,207 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:44,207 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1225789933, now seen corresponding path program 1 times [2018-01-20 22:05:44,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:44,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:44,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:44,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:44,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:44,281 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-20 22:05:44,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:05:44,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:05:44,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:05:44,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:05:44,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:05:44,283 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 5 states. [2018-01-20 22:05:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:44,382 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2018-01-20 22:05:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:05:44,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-20 22:05:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:44,383 INFO L225 Difference]: With dead ends: 180 [2018-01-20 22:05:44,383 INFO L226 Difference]: Without dead ends: 177 [2018-01-20 22:05:44,384 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:05:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-20 22:05:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2018-01-20 22:05:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 22:05:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-01-20 22:05:44,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 39 [2018-01-20 22:05:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:44,396 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-01-20 22:05:44,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:05:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-01-20 22:05:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:05:44,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:44,398 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] [2018-01-20 22:05:44,398 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1792880597, now seen corresponding path program 2 times [2018-01-20 22:05:44,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:44,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:44,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:44,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:44,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:44,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:05:44,539 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-20 22:05:44,553 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:05:44,568 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:05:44,581 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:05:44,584 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:05:44,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:05:44,591 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-20 22:05:44,593 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-20 22:05:44,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-20 22:05:44,632 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-20 22:05:44,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:44,645 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-20 22:05:44,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-01-20 22:05:44,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-20 22:05:44,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-20 22:05:44,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:44,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-20 22:05:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:44,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:05:44,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-20 22:05:44,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:05:44,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:05:44,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:05:44,716 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 9 states. [2018-01-20 22:05:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:44,808 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2018-01-20 22:05:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:05:44,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-01-20 22:05:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:44,810 INFO L225 Difference]: With dead ends: 185 [2018-01-20 22:05:44,811 INFO L226 Difference]: Without dead ends: 150 [2018-01-20 22:05:44,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:05:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-20 22:05:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-01-20 22:05:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-20 22:05:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2018-01-20 22:05:44,824 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 45 [2018-01-20 22:05:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:44,824 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2018-01-20 22:05:44,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:05:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2018-01-20 22:05:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:05:44,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:44,825 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:44,825 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:44,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1004896410, now seen corresponding path program 1 times [2018-01-20 22:05:44,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:44,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:44,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,826 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:05:44,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:44,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:45,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:05:45,843 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-20 22:05:45,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:45,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:05:45,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:05:45,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-20 22:05:45,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-20 22:05:45,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, 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-20 22:05:45,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-01-20 22:05:45,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:45,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:45,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:05:45,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:45,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-01-20 22:05:46,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-20 22:05:46,028 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-20 22:05:46,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-20 22:05:46,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:46,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-01-20 22:05:46,079 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 23 treesize of output 23 [2018-01-20 22:05:46,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,089 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-20 22:05:46,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-01-20 22:05:46,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:46,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:46,260 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-20 22:05:46,270 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-01-20 22:05:46,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:05:46,287 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 13 treesize of output 10 [2018-01-20 22:05:46,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:46,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:46,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:46,302 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:38 [2018-01-20 22:05:46,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-01-20 22:05:46,451 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 30 treesize of output 29 [2018-01-20 22:05:46,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2018-01-20 22:05:46,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:46,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:46,517 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 22 treesize of output 19 [2018-01-20 22:05:46,519 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-20 22:05:46,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,548 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 24 treesize of output 21 [2018-01-20 22:05:46,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:05:46,550 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:05:46,575 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:76, output treesize:59 [2018-01-20 22:05:46,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-01-20 22:05:46,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-20 22:05:46,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-01-20 22:05:46,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-20 22:05:46,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-01-20 22:05:46,805 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 33 treesize of output 32 [2018-01-20 22:05:46,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,832 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:05:46,845 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:85, output treesize:73 [2018-01-20 22:05:46,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:05:46,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:46,951 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-20 22:05:46,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2018-01-20 22:05:47,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-01-20 22:05:47,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:47,327 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 38 treesize of output 30 [2018-01-20 22:05:47,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-01-20 22:05:47,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:47,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-01-20 22:05:47,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-01-20 22:05:47,387 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 38 treesize of output 36 [2018-01-20 22:05:47,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:47,426 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 29 treesize of output 22 [2018-01-20 22:05:47,427 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,429 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 30 treesize of output 28 [2018-01-20 22:05:47,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:47,456 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 27 treesize of output 28 [2018-01-20 22:05:47,457 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:47,471 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:47,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-20 22:05:47,485 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:85, output treesize:55 [2018-01-20 22:05:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:47,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:05:47,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 45 [2018-01-20 22:05:47,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-20 22:05:47,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-20 22:05:47,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1870, Unknown=0, NotChecked=0, Total=1980 [2018-01-20 22:05:47,658 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand 45 states. [2018-01-20 22:05:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:05:51,094 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2018-01-20 22:05:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-20 22:05:51,094 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2018-01-20 22:05:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:05:51,096 INFO L225 Difference]: With dead ends: 269 [2018-01-20 22:05:51,096 INFO L226 Difference]: Without dead ends: 199 [2018-01-20 22:05:51,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=511, Invalid=4891, Unknown=0, NotChecked=0, Total=5402 [2018-01-20 22:05:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-20 22:05:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 136. [2018-01-20 22:05:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-20 22:05:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2018-01-20 22:05:51,105 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 51 [2018-01-20 22:05:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:05:51,105 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2018-01-20 22:05:51,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-20 22:05:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2018-01-20 22:05:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:05:51,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:05:51,106 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:05:51,106 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:05:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1489004538, now seen corresponding path program 1 times [2018-01-20 22:05:51,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:05:51,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:05:51,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:51,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:51,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:05:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:51,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:05:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:05:51,849 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:05:51,849 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:05:51,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:05:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:05:51,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:05:51,951 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-20 22:05:51,952 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-20 22:05:51,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-20 22:05:51,981 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 19 treesize of output 14 [2018-01-20 22:05:51,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-01-20 22:05:51,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:51,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-20 22:05:52,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-01-20 22:05:52,079 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 27 treesize of output 26 [2018-01-20 22:05:52,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 22:05:52,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 52 [2018-01-20 22:05:52,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,148 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 45 treesize of output 49 [2018-01-20 22:05:52,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,168 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:52,168 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 24 treesize of output 38 [2018-01-20 22:05:52,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:52,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:52,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:78 [2018-01-20 22:05:52,363 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 32 treesize of output 31 [2018-01-20 22:05:52,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-01-20 22:05:52,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:52,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:05:52,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:86 [2018-01-20 22:05:52,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-01-20 22:05:52,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:52,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 74 [2018-01-20 22:05:52,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:52,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-01-20 22:05:52,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:52,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 74 [2018-01-20 22:05:52,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:53,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-20 22:05:53,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:239, output treesize:449 [2018-01-20 22:05:53,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:53,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:53,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:53,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 91 [2018-01-20 22:05:53,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:53,445 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 66 [2018-01-20 22:05:53,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:53,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:55,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:55,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:55,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:55,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 89 [2018-01-20 22:05:55,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:55,232 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 58 [2018-01-20 22:05:55,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:55,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:56,474 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:56,476 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 64 treesize of output 66 [2018-01-20 22:05:56,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-20 22:05:56,485 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:56,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:57,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:57,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-01-20 22:05:57,666 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-20 22:05:57,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:57,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:58,801 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 84 treesize of output 81 [2018-01-20 22:05:58,803 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-20 22:05:58,804 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:58,819 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:59,751 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:59,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:59,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-01-20 22:05:59,760 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-20 22:05:59,760 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:59,775 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:00,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:00,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:00,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:00,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 110 [2018-01-20 22:06:00,648 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 105 treesize of output 104 [2018-01-20 22:06:00,649 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:00,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 88 [2018-01-20 22:06:00,739 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:00,795 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:01,562 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 80 treesize of output 77 [2018-01-20 22:06:01,564 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-20 22:06:01,565 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:01,579 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:01,581 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 80 treesize of output 77 [2018-01-20 22:06:01,584 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-20 22:06:01,584 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:01,599 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:02,187 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:02,189 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 64 treesize of output 56 [2018-01-20 22:06:02,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:02,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 49 [2018-01-20 22:06:02,197 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:02,210 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:02,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:02,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2018-01-20 22:06:02,694 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-20 22:06:02,695 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:02,707 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,094 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 61 treesize of output 62 [2018-01-20 22:06:03,096 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-20 22:06:03,096 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,106 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,461 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 59 treesize of output 48 [2018-01-20 22:06:03,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:03,465 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 33 treesize of output 51 [2018-01-20 22:06:03,465 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,478 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,480 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 68 treesize of output 55 [2018-01-20 22:06:03,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:03,485 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 43 treesize of output 60 [2018-01-20 22:06:03,485 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,496 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,783 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 65 treesize of output 62 [2018-01-20 22:06:03,786 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-20 22:06:03,786 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:03,797 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:04,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:04,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:04,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:04,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 112 [2018-01-20 22:06:04,055 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 105 treesize of output 104 [2018-01-20 22:06:04,055 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:04,137 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 80 treesize of output 80 [2018-01-20 22:06:04,138 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:04,184 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:04,436 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 80 treesize of output 104 [2018-01-20 22:06:04,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-01-20 22:06:04,440 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:04,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 90 [2018-01-20 22:06:04,497 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-01-20 22:06:04,540 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:04,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-01-20 22:06:04,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-20 22:06:04,553 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-01-20 22:06:04,573 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:04,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:04,818 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 84 treesize of output 89 [2018-01-20 22:06:04,820 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-20 22:06:04,821 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:04,836 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:05,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 16 dim-2 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-01-20 22:06:05,052 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 36 variables, input treesize:625, output treesize:657 [2018-01-20 22:06:05,505 WARN L146 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 174 DAG size of output 155 [2018-01-20 22:06:05,822 WARN L143 SmtUtils]: Spent 171ms on a formula simplification that was a NOOP. DAG size: 161 [2018-01-20 22:06:05,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:05,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 83 [2018-01-20 22:06:05,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-20 22:06:05,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:05,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:08,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:08,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:08,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:08,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 93 [2018-01-20 22:06:08,742 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 51 [2018-01-20 22:06:08,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:06:08,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:11,709 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 89 treesize of output 113 [2018-01-20 22:06:11,711 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 98 treesize of output 97 [2018-01-20 22:06:11,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:11,778 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:15,327 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:15,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:15,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2018-01-20 22:06:15,334 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-20 22:06:15,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:15,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:18,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:18,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:18,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:18,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:18,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 118 [2018-01-20 22:06:18,142 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 119 treesize of output 113 [2018-01-20 22:06:18,143 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:18,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 89 [2018-01-20 22:06:18,204 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:18,238 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:22,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-01-20 22:06:22,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:22,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-01-20 22:06:22,187 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:22,201 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:24,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 111 [2018-01-20 22:06:24,645 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 102 treesize of output 101 [2018-01-20 22:06:24,645 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:24,727 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:27,465 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:27,468 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 66 treesize of output 58 [2018-01-20 22:06:27,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2018-01-20 22:06:27,475 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-20 22:06:27,497 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:06:33,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:33,733 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 75 treesize of output 76 [2018-01-20 22:06:33,735 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-20 22:06:33,735 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:33,746 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:39,204 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:39,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-01-20 22:06:39,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:39,211 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 14 treesize of output 24 [2018-01-20 22:06:39,211 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:39,221 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:42,828 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:42,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2018-01-20 22:06:42,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-20 22:06:42,834 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:42,845 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:45,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:45,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-01-20 22:06:45,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:06:45,706 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 42 treesize of output 34 [2018-01-20 22:06:45,706 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-20 22:06:45,713 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:06:47,830 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:06:47,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2018-01-20 22:06:47,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2018-01-20 22:06:47,840 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-01-20 22:06:47,859 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. Received shutdown request... [2018-01-20 22:06:49,210 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-20 22:06:49,211 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:06:49,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:06:49 BoogieIcfgContainer [2018-01-20 22:06:49,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:06:49,214 INFO L168 Benchmark]: Toolchain (without parser) took 69848.16 ms. Allocated memory was 293.6 MB in the beginning and 650.1 MB in the end (delta: 356.5 MB). Free memory was 251.5 MB in the beginning and 314.7 MB in the end (delta: -63.2 MB). Peak memory consumption was 326.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:06:49,215 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 293.6 MB. Free memory is still 257.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:06:49,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.20 ms. Allocated memory is still 293.6 MB. Free memory was 250.5 MB in the beginning and 239.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:06:49,216 INFO L168 Benchmark]: Boogie Preprocessor took 36.42 ms. Allocated memory is still 293.6 MB. Free memory was 239.4 MB in the beginning and 237.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:06:49,216 INFO L168 Benchmark]: RCFGBuilder took 389.59 ms. Allocated memory is still 293.6 MB. Free memory was 237.4 MB in the beginning and 210.4 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:06:49,216 INFO L168 Benchmark]: TraceAbstraction took 69198.46 ms. Allocated memory was 293.6 MB in the beginning and 650.1 MB in the end (delta: 356.5 MB). Free memory was 210.4 MB in the beginning and 314.7 MB in the end (delta: -104.3 MB). Peak memory consumption was 285.4 MB. Max. memory is 5.3 GB. [2018-01-20 22:06:49,218 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.20 ms. Allocated memory is still 293.6 MB. Free memory is still 257.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.20 ms. Allocated memory is still 293.6 MB. Free memory was 250.5 MB in the beginning and 239.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.42 ms. Allocated memory is still 293.6 MB. Free memory was 239.4 MB in the beginning and 237.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 389.59 ms. Allocated memory is still 293.6 MB. Free memory was 237.4 MB in the beginning and 210.4 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69198.46 ms. Allocated memory was 293.6 MB in the beginning and 650.1 MB in the end (delta: 356.5 MB). Free memory was 210.4 MB in the beginning and 314.7 MB in the end (delta: -104.3 MB). Peak memory consumption was 285.4 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, 85 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=85occurred 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: [L629] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={10:0}] [L629] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L630] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L631] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L651] n = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, n={0:0}, root={10:0}] [L652] EXPR, FCALL malloc(sizeof(*s)) VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}] [L652] struct StackItem* s = malloc(sizeof(*s)), *st; VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={11:0}] [L653] FCALL s->next = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={11:0}] [L654] FCALL s->node = root VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={11:0}] [L655] COND TRUE s != ((void *)0) [L656] st = s VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={11:0}, s={11:0}] [L657] EXPR, FCALL s->next VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={11:0}, s={11:0}, s->next={0:0}] [L657] s = s->next [L658] EXPR, FCALL st->node VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={0:0}, root={10:0}, s={0:0}, s={11:0}, st->node={10:0}] [L658] n = st->node [L659] FCALL free(st) VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={10:0}, root={10:0}, s={11:0}, s={0:0}] [L660] FCALL n->left VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={10:0}, n->left={0:0}, root={10:0}, s={0:0}, s={11:0}] [L660] COND FALSE !(n->left) [L666] FCALL n->right VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={10:0}, n->right={0:0}, root={10:0}, s={0:0}, s={11:0}] [L666] COND FALSE !(n->right) [L672] FCALL free(n) VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={10:0}, root={10:0}, s={11:0}, s={0:0}] [L655] COND FALSE !(s != ((void *)0)) VAL [malloc(sizeof(*root))={10:0}, malloc(sizeof(*s))={11:0}, n={10:0}, root={10:0}, s={0:0}, s={11:0}] [L674] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 85 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 182 SDtfs, 38 SDslu, 140 SDs, 0 SdLazy, 13 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 52 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 199. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 85 locations, 3 error locations. TIMEOUT Result, 68.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 617 SDtfs, 1147 SDslu, 3923 SDs, 0 SdLazy, 3441 SolverSat, 196 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 106 SyntacticMatches, 9 SemanticMatches, 130 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 213 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 365 ConstructedInterpolants, 23 QuantifiedInterpolants, 178255 SizeOfPredicates, 42 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 35/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-06-49-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-06-49-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-06-49-226.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-06-49-226.csv Completed graceful shutdown