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/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:27:28,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:27:28,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:27:28,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:27:28,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:27:28,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:27:28,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:27:28,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:27:28,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:27:28,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:27:28,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:27:28,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:27:28,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:27:28,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:27:28,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:27:28,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:27:28,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:27:28,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:27:28,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:27:28,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:27:28,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:27:28,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:27:28,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:27:28,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:27:28,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:27:28,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:27:28,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:27:28,246 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:27:28,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:27:28,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:27:28,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:27:28,247 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:27:28,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:27:28,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:27:28,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:27:28,257 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:27:28,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:27:28,257 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:27:28,257 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:27:28,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:27:28,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:27:28,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:27:28,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:27:28,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:27:28,260 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:27:28,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:27:28,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:27:28,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:27:28,260 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:27:28,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:27:28,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:27:28,262 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:27:28,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:27:28,306 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:27:28,309 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:27:28,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:27:28,310 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:27:28,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:27:28,487 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:27:28,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:27:28,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:27:28,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:27:28,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:27:28,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b83b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28, skipping insertion in model container [2018-01-20 22:27:28,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,525 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:27:28,571 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:27:28,700 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:27:28,719 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:27:28,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28 WrapperNode [2018-01-20 22:27:28,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:27:28,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:27:28,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:27:28,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:27:28,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (1/1) ... [2018-01-20 22:27:28,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:27:28,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:27:28,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:27:28,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:27:28,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (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:27:28,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:27:28,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:27:28,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:27:28,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:27:28,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:27:28,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:27:28,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:27:29,192 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:27:29,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:27:29 BoogieIcfgContainer [2018-01-20 22:27:29,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:27:29,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:27:29,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:27:29,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:27:29,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:27:28" (1/3) ... [2018-01-20 22:27:29,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d62ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:27:29, skipping insertion in model container [2018-01-20 22:27:29,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:27:28" (2/3) ... [2018-01-20 22:27:29,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d62ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:27:29, skipping insertion in model container [2018-01-20 22:27:29,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:27:29" (3/3) ... [2018-01-20 22:27:29,201 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:27:29,210 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:27:29,218 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:27:29,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:27:29,269 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:27:29,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:27:29,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:27:29,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:27:29,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:27:29,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:27:29,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:27:29,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:27:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-20 22:27:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:27:29,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:29,292 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:27:29,293 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:27:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash 261931, now seen corresponding path program 1 times [2018-01-20 22:27:29,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:29,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:29,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:29,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:27:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:27:29,402 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:27:29,410 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:27:29,418 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:27:29,418 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:27:29,418 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:27:29,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:27:29,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:27:29,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:27:29,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:27:29,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:27:29,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:27:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-20 22:27:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:27:29,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:29,425 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:27:29,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:27:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1481030300, now seen corresponding path program 1 times [2018-01-20 22:27:29,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:29,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:29,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:29,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:29,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:29,598 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:27:29,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:27:29,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:27:29,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:27:29,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:27:29,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:27:29,614 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-20 22:27:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:29,644 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2018-01-20 22:27:29,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:27:29,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-20 22:27:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:29,654 INFO L225 Difference]: With dead ends: 170 [2018-01-20 22:27:29,654 INFO L226 Difference]: Without dead ends: 88 [2018-01-20 22:27:29,658 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:27:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-20 22:27:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-20 22:27:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-20 22:27:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-20 22:27:29,699 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 21 [2018-01-20 22:27:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:29,700 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-20 22:27:29,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:27:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-20 22:27:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 22:27:29,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:29,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:29,701 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:27:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1311117136, now seen corresponding path program 1 times [2018-01-20 22:27:29,701 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:29,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:29,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:29,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:29,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:29,831 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:27:29,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:27:29,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:27:29,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:27:29,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:27:29,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:27:29,833 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-01-20 22:27:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:30,053 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2018-01-20 22:27:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:27:30,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-20 22:27:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:30,056 INFO L225 Difference]: With dead ends: 139 [2018-01-20 22:27:30,056 INFO L226 Difference]: Without dead ends: 120 [2018-01-20 22:27:30,057 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:27:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-20 22:27:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 92. [2018-01-20 22:27:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-20 22:27:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-20 22:27:30,068 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 30 [2018-01-20 22:27:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:30,068 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-20 22:27:30,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:27:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-20 22:27:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 22:27:30,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:30,070 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:30,070 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:27:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 491544981, now seen corresponding path program 1 times [2018-01-20 22:27:30,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:30,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:30,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:30,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:27:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:27:30,131 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:27:30,139 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:27:30,146 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:27:30,146 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:27:30,160 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:27:30,161 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:27:30,161 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:27:30,161 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:27:30,161 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:27:30,161 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:27:30,161 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:27:30,161 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:27:30,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:27:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-20 22:27:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:27:30,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:30,165 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:30,165 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash 55172353, now seen corresponding path program 1 times [2018-01-20 22:27:30,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:30,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:30,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:30,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:30,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:30,194 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:27:30,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:27:30,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:27:30,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:27:30,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:27:30,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:27:30,195 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-01-20 22:27:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:30,202 INFO L93 Difference]: Finished difference Result 170 states and 228 transitions. [2018-01-20 22:27:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:27:30,202 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-20 22:27:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:30,203 INFO L225 Difference]: With dead ends: 170 [2018-01-20 22:27:30,203 INFO L226 Difference]: Without dead ends: 86 [2018-01-20 22:27:30,203 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:27:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-20 22:27:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-20 22:27:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-20 22:27:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-20 22:27:30,208 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-20 22:27:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:30,208 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-20 22:27:30,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:27:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-20 22:27:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 22:27:30,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:30,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:30,209 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2057227957, now seen corresponding path program 1 times [2018-01-20 22:27:30,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:30,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:30,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:30,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:30,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:30,271 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:27:30,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:27:30,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:27:30,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:27:30,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:27:30,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:27:30,272 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-01-20 22:27:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:30,407 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-20 22:27:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:27:30,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-20 22:27:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:30,409 INFO L225 Difference]: With dead ends: 135 [2018-01-20 22:27:30,409 INFO L226 Difference]: Without dead ends: 118 [2018-01-20 22:27:30,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:27:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-20 22:27:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2018-01-20 22:27:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-20 22:27:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-01-20 22:27:30,418 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 28 [2018-01-20 22:27:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:30,418 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-01-20 22:27:30,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:27:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-01-20 22:27:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:27:30,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:30,420 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:30,421 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:30,421 INFO L82 PathProgramCache]: Analyzing trace with hash 894365242, now seen corresponding path program 1 times [2018-01-20 22:27:30,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:30,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:30,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:30,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:30,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:30,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:30,641 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:27:30,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:30,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:30,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:30,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-20 22:27:30,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:27:30,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:27:30,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2018-01-20 22:27:30,861 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 9 states. [2018-01-20 22:27:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:31,206 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-20 22:27:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:27:31,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-20 22:27:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:31,209 INFO L225 Difference]: With dead ends: 146 [2018-01-20 22:27:31,209 INFO L226 Difference]: Without dead ends: 143 [2018-01-20 22:27:31,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=110, Unknown=5, NotChecked=0, Total=156 [2018-01-20 22:27:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-20 22:27:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2018-01-20 22:27:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 22:27:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-20 22:27:31,221 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 42 [2018-01-20 22:27:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:31,222 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-20 22:27:31,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:27:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-20 22:27:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 22:27:31,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:31,224 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:31,224 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1706144563, now seen corresponding path program 1 times [2018-01-20 22:27:31,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:31,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:31,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:31,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:31,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:31,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:27:31,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:31,336 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:27:31,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:31,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:31,401 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:27:31,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:27:31,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:31,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:31,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:31,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-20 22:27:31,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-20 22:27:31,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:27:31,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:31,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:31,434 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:27:31,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-20 22:27:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:31,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:27:31,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-01-20 22:27:31,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:27:31,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:27:31,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:27:31,466 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 9 states. [2018-01-20 22:27:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:31,907 INFO L93 Difference]: Finished difference Result 216 states and 235 transitions. [2018-01-20 22:27:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:27:31,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-01-20 22:27:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:31,909 INFO L225 Difference]: With dead ends: 216 [2018-01-20 22:27:31,909 INFO L226 Difference]: Without dead ends: 174 [2018-01-20 22:27:31,910 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:27:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-20 22:27:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 149. [2018-01-20 22:27:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-20 22:27:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-01-20 22:27:31,921 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 44 [2018-01-20 22:27:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:31,922 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-01-20 22:27:31,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:27:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-01-20 22:27:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 22:27:31,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:31,924 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:31,924 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash -256957715, now seen corresponding path program 2 times [2018-01-20 22:27:31,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:31,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:31,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:31,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:31,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:31,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:27:32,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:32,062 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:27:32,067 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:27:32,085 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:32,095 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:32,097 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:27:32,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:32,122 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:27:32,124 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:27:32,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,126 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:27:32,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-20 22:27:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:27:32,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:32,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-01-20 22:27:32,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-20 22:27:32,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-20 22:27:32,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-01-20 22:27:32,186 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 13 states. [2018-01-20 22:27:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:32,454 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2018-01-20 22:27:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-20 22:27:32,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-20 22:27:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:32,455 INFO L225 Difference]: With dead ends: 232 [2018-01-20 22:27:32,455 INFO L226 Difference]: Without dead ends: 160 [2018-01-20 22:27:32,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-20 22:27:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-20 22:27:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 128. [2018-01-20 22:27:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-20 22:27:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-20 22:27:32,465 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 50 [2018-01-20 22:27:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:32,466 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-20 22:27:32,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-20 22:27:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-20 22:27:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-20 22:27:32,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:32,467 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:32,467 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash 434425747, now seen corresponding path program 1 times [2018-01-20 22:27:32,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:32,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:32,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:32,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:27:32,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:32,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:32,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:32,714 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:27:32,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:32,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:32,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:27:32,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:27:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:32,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:32,824 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:27:32,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-20 22:27:32,858 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:27:32,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:27:32,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,868 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:27:32,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-20 22:27:32,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:32,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-01-20 22:27:32,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:32,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:32,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:32,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-20 22:27:33,045 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 48 treesize of output 39 [2018-01-20 22:27:33,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:33,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:33,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:33,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:33,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:72 [2018-01-20 22:27:33,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-01-20 22:27:33,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:33,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-20 22:27:33,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:33,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:33,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:33,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-01-20 22:27:33,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-01-20 22:27:33,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:27:33,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:33,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:27:33,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:33,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:33,233 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:27:33,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-20 22:27:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:33,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:33,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2018-01-20 22:27:33,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-20 22:27:33,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-20 22:27:33,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-01-20 22:27:33,294 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 25 states. [2018-01-20 22:27:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:34,584 INFO L93 Difference]: Finished difference Result 277 states and 298 transitions. [2018-01-20 22:27:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-20 22:27:34,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-01-20 22:27:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:34,586 INFO L225 Difference]: With dead ends: 277 [2018-01-20 22:27:34,586 INFO L226 Difference]: Without dead ends: 264 [2018-01-20 22:27:34,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2018-01-20 22:27:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-20 22:27:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 211. [2018-01-20 22:27:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-20 22:27:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2018-01-20 22:27:34,597 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 67 [2018-01-20 22:27:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:34,597 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2018-01-20 22:27:34,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-20 22:27:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2018-01-20 22:27:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-20 22:27:34,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:34,598 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:34,598 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -70106772, now seen corresponding path program 1 times [2018-01-20 22:27:34,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:34,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:34,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:34,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:34,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:34,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:35,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:35,254 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:35,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:35,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:35,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:27:35,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:27:35,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:27:35,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:27:35,328 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:27:35,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:27:35,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,338 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:27:35,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:27:35,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:27:35,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:35,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:35,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-20 22:27:35,536 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 57 treesize of output 52 [2018-01-20 22:27:35,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:35,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:35,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:35,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:35,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:100 [2018-01-20 22:27:35,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,810 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 59 treesize of output 58 [2018-01-20 22:27:35,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,815 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 22 treesize of output 14 [2018-01-20 22:27:35,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:45 [2018-01-20 22:27:35,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:27:35,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-20 22:27:35,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,898 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 50 treesize of output 49 [2018-01-20 22:27:35,901 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 7 [2018-01-20 22:27:35,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:35,914 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:27:35,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2018-01-20 22:27:35,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:35,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2018-01-20 22:27:35,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:35,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:36,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:53 [2018-01-20 22:27:36,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2018-01-20 22:27:36,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:36,227 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 2 case distinctions, treesize of input 20 treesize of output 35 [2018-01-20 22:27:36,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:36,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:36,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:36,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:140 [2018-01-20 22:27:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-01-20 22:27:36,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:36,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-20 22:27:36,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:36,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-01-20 22:27:36,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-01-20 22:27:36,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-01-20 22:27:36,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:27:36,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-20 22:27:36,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:36,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:4 [2018-01-20 22:27:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:36,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:36,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 36 [2018-01-20 22:27:36,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 22:27:36,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 22:27:36,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2018-01-20 22:27:36,567 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand 36 states. [2018-01-20 22:27:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:38,415 INFO L93 Difference]: Finished difference Result 369 states and 398 transitions. [2018-01-20 22:27:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-20 22:27:38,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-01-20 22:27:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:38,418 INFO L225 Difference]: With dead ends: 369 [2018-01-20 22:27:38,418 INFO L226 Difference]: Without dead ends: 356 [2018-01-20 22:27:38,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=609, Invalid=4083, Unknown=0, NotChecked=0, Total=4692 [2018-01-20 22:27:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-01-20 22:27:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 221. [2018-01-20 22:27:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-20 22:27:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 238 transitions. [2018-01-20 22:27:38,429 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 238 transitions. Word has length 76 [2018-01-20 22:27:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:38,429 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 238 transitions. [2018-01-20 22:27:38,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 22:27:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 238 transitions. [2018-01-20 22:27:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-20 22:27:38,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:38,430 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:38,430 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1274770860, now seen corresponding path program 1 times [2018-01-20 22:27:38,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:38,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:38,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:38,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:38,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:38,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-20 22:27:38,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:27:38,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:27:38,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:27:38,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:27:38,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:27:38,678 INFO L87 Difference]: Start difference. First operand 221 states and 238 transitions. Second operand 5 states. [2018-01-20 22:27:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:38,909 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-01-20 22:27:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:27:38,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-01-20 22:27:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:38,910 INFO L225 Difference]: With dead ends: 244 [2018-01-20 22:27:38,910 INFO L226 Difference]: Without dead ends: 187 [2018-01-20 22:27:38,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:27:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-20 22:27:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-01-20 22:27:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-20 22:27:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-01-20 22:27:38,917 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 78 [2018-01-20 22:27:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:38,918 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-01-20 22:27:38,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:27:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2018-01-20 22:27:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:27:38,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:38,919 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:38,919 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 751973080, now seen corresponding path program 2 times [2018-01-20 22:27:38,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:38,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:38,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:38,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:38,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:38,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:27:39,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:39,652 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:39,658 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:27:39,670 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:39,683 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:39,687 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:27:39,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:39,774 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:27:39,776 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:27:39,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:39,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:39,787 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:27:39,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:40 [2018-01-20 22:27:39,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:39,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:27:39,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:39,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:39,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:39,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:39,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-01-20 22:27:39,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:39,991 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 57 treesize of output 56 [2018-01-20 22:27:40,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:40,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:40,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:40,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:40,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:106 [2018-01-20 22:27:40,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:40,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-01-20 22:27:40,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:40,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-20 22:27:40,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:40,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:40,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:40,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:45 [2018-01-20 22:27:40,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:40,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-20 22:27:40,245 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 33 treesize of output 22 [2018-01-20 22:27:40,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:40,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:27:40,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:40,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:40,270 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:27:40,271 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2018-01-20 22:27:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-20 22:27:41,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:41,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2018-01-20 22:27:41,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 22:27:41,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 22:27:41,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1084, Unknown=75, NotChecked=0, Total=1260 [2018-01-20 22:27:41,119 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand 36 states. [2018-01-20 22:27:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:42,997 INFO L93 Difference]: Finished difference Result 268 states and 283 transitions. [2018-01-20 22:27:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-20 22:27:42,998 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-01-20 22:27:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:42,999 INFO L225 Difference]: With dead ends: 268 [2018-01-20 22:27:42,999 INFO L226 Difference]: Without dead ends: 265 [2018-01-20 22:27:43,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=270, Invalid=2623, Unknown=77, NotChecked=0, Total=2970 [2018-01-20 22:27:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-20 22:27:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 244. [2018-01-20 22:27:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-20 22:27:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 258 transitions. [2018-01-20 22:27:43,010 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 258 transitions. Word has length 81 [2018-01-20 22:27:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:43,010 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 258 transitions. [2018-01-20 22:27:43,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 22:27:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 258 transitions. [2018-01-20 22:27:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-20 22:27:43,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:43,012 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:43,012 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:43,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1988736943, now seen corresponding path program 1 times [2018-01-20 22:27:43,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:43,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:43,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:43,014 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:27:43,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:43,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:27:43,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:43,962 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:43,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:43,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:44,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-01-20 22:27:44,109 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 22 treesize of output 14 [2018-01-20 22:27:44,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-20 22:27:44,115 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 18 treesize of output 10 [2018-01-20 22:27:44,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:10 [2018-01-20 22:27:44,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-20 22:27:44,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-20 22:27:44,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:44,196 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:27:44,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-01-20 22:27:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:27:44,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:44,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 34 [2018-01-20 22:27:44,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:27:44,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:27:44,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 22:27:44,244 INFO L87 Difference]: Start difference. First operand 244 states and 258 transitions. Second operand 34 states. [2018-01-20 22:27:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:46,541 INFO L93 Difference]: Finished difference Result 418 states and 449 transitions. [2018-01-20 22:27:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-20 22:27:46,573 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 83 [2018-01-20 22:27:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:46,574 INFO L225 Difference]: With dead ends: 418 [2018-01-20 22:27:46,574 INFO L226 Difference]: Without dead ends: 401 [2018-01-20 22:27:46,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=525, Invalid=5327, Unknown=0, NotChecked=0, Total=5852 [2018-01-20 22:27:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-20 22:27:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 321. [2018-01-20 22:27:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-01-20 22:27:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions. [2018-01-20 22:27:46,590 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 83 [2018-01-20 22:27:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:46,591 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 345 transitions. [2018-01-20 22:27:46,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-20 22:27:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions. [2018-01-20 22:27:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-20 22:27:46,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:46,593 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:27:46,593 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:46,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1693116811, now seen corresponding path program 3 times [2018-01-20 22:27:46,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:46,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:46,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:46,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:27:46,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:46,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:27:46,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:46,841 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:46,848 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:27:46,860 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:27:46,874 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:27:46,957 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:27:46,993 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:27:46,995 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:27:47,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:47,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:27:47,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:27:47,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:27:47,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-20 22:27:47,127 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:27:47,129 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:27:47,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,143 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:27:47,145 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:27:47,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-20 22:27:47,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,217 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 29 treesize of output 30 [2018-01-20 22:27:47,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:47,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-01-20 22:27:47,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:47,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:47,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-01-20 22:27:47,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-20 22:27:47,301 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 15 [2018-01-20 22:27:47,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:27:47,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:47,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2018-01-20 22:27:47,380 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 40 treesize of output 35 [2018-01-20 22:27:47,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:47,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:47,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:47,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:47,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:68 [2018-01-20 22:27:47,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,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 42 treesize of output 41 [2018-01-20 22:27:47,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:47,473 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 22 treesize of output 14 [2018-01-20 22:27:47,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2018-01-20 22:27:47,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-20 22:27:47,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:27:47,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:47,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-20 22:27:47,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:47,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:47,690 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:27:47,690 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:8 [2018-01-20 22:27:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-20 22:27:47,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:47,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 35 [2018-01-20 22:27:47,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:27:47,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:27:47,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 22:27:47,793 INFO L87 Difference]: Start difference. First operand 321 states and 345 transitions. Second operand 35 states. [2018-01-20 22:27:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:50,129 INFO L93 Difference]: Finished difference Result 453 states and 487 transitions. [2018-01-20 22:27:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-20 22:27:50,129 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 89 [2018-01-20 22:27:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:50,131 INFO L225 Difference]: With dead ends: 453 [2018-01-20 22:27:50,131 INFO L226 Difference]: Without dead ends: 385 [2018-01-20 22:27:50,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=555, Invalid=5451, Unknown=0, NotChecked=0, Total=6006 [2018-01-20 22:27:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-01-20 22:27:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 324. [2018-01-20 22:27:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-20 22:27:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 347 transitions. [2018-01-20 22:27:50,147 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 347 transitions. Word has length 89 [2018-01-20 22:27:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:50,147 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 347 transitions. [2018-01-20 22:27:50,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:27:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 347 transitions. [2018-01-20 22:27:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-20 22:27:50,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:50,149 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:50,149 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1327303439, now seen corresponding path program 2 times [2018-01-20 22:27:50,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:50,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:50,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:50,151 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:27:50,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:50,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:51,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:51,132 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:51,137 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:27:51,149 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:51,163 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:27:51,167 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:27:51,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:51,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:27:51,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:27:51,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:27:51,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-20 22:27:51,228 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:27:51,230 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:27:51,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,242 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:27:51,243 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:27:51,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-01-20 22:27:51,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-01-20 22:27:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:51,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,361 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 29 treesize of output 30 [2018-01-20 22:27:51,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:51,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:51,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-01-20 22:27:51,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-20 22:27:51,431 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 15 [2018-01-20 22:27:51,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:27:51,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:51,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:49 [2018-01-20 22:27:51,529 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 49 treesize of output 40 [2018-01-20 22:27:51,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:51,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:51,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:51,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:51,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:96 [2018-01-20 22:27:51,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-01-20 22:27:51,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,631 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 22 treesize of output 14 [2018-01-20 22:27:51,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:43 [2018-01-20 22:27:51,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:27:51,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-20 22:27:51,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,716 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 42 treesize of output 56 [2018-01-20 22:27:51,720 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 29 treesize of output 23 [2018-01-20 22:27:51,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:51,738 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:27:51,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:42 [2018-01-20 22:27:51,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:51,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-01-20 22:27:51,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:51,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27: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:27:52,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:52,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:51 [2018-01-20 22:27:52,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:52,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:52,153 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 0 case distinctions, treesize of input 84 treesize of output 90 [2018-01-20 22:27:52,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-20 22:27:52,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:52,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:52,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:52,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:122 [2018-01-20 22:27:52,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:52,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:52,273 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 84 [2018-01-20 22:27:52,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:52,277 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 38 treesize of output 22 [2018-01-20 22:27:52,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:52,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:52,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:52,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:59 [2018-01-20 22:27:52,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-20 22:27:52,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:27:52,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:52,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:52,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:52,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:62 [2018-01-20 22:27:52,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:53,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:53,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2018-01-20 22:27:53,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:27:53,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:53,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:27:53,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:53,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-01-20 22:27:53,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:53,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:53,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:53,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:9 [2018-01-20 22:27:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:27:53,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:53,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 54 [2018-01-20 22:27:53,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-20 22:27:53,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-20 22:27:53,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2626, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 22:27:53,172 INFO L87 Difference]: Start difference. First operand 324 states and 347 transitions. Second operand 54 states. [2018-01-20 22:27:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:27:57,215 INFO L93 Difference]: Finished difference Result 391 states and 416 transitions. [2018-01-20 22:27:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-20 22:27:57,215 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 90 [2018-01-20 22:27:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:27:57,216 INFO L225 Difference]: With dead ends: 391 [2018-01-20 22:27:57,216 INFO L226 Difference]: Without dead ends: 370 [2018-01-20 22:27:57,218 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=973, Invalid=9947, Unknown=0, NotChecked=0, Total=10920 [2018-01-20 22:27:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-01-20 22:27:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2018-01-20 22:27:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-20 22:27:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 351 transitions. [2018-01-20 22:27:57,235 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 351 transitions. Word has length 90 [2018-01-20 22:27:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:27:57,235 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 351 transitions. [2018-01-20 22:27:57,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-20 22:27:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 351 transitions. [2018-01-20 22:27:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-20 22:27:57,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:27:57,237 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:57,237 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:27:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1114901414, now seen corresponding path program 4 times [2018-01-20 22:27:57,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:27:57,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:27:57,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:57,239 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:27:57,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:27:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:27:57,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:27:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:57,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:27:57,752 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:27:57,757 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:27:58,148 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:27:58,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:27:58,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:27:58,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:27:58,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:27:58,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:27:58,188 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:27:58,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:27:58,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,201 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:27:58,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:27:58,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:27:58,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:58,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:58,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-20 22:27:58,343 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 57 treesize of output 52 [2018-01-20 22:27:58,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:27:58,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:58,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:58,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:58,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:100 [2018-01-20 22:27:58,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-01-20 22:27:58,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,432 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 22 treesize of output 14 [2018-01-20 22:27:58,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:45 [2018-01-20 22:27:58,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:27:58,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-20 22:27:58,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,487 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 50 treesize of output 49 [2018-01-20 22:27:58,490 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 7 [2018-01-20 22:27:58,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,504 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:27:58,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2018-01-20 22:27:58,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 73 [2018-01-20 22:27:58,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:27:58,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:58,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:53 [2018-01-20 22:27:58,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-01-20 22:27:58,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,666 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 2 case distinctions, treesize of input 20 treesize of output 35 [2018-01-20 22:27:58,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:27:58,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:27:58,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:27:58,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:124 [2018-01-20 22:27:58,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-01-20 22:27:58,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:27:58,765 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 38 treesize of output 22 [2018-01-20 22:27:58,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:27:58,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-01-20 22:27:58,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-01-20 22:27:58,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:27:58,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-01-20 22:27:58,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-20 22:27:58,838 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:27:58,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:4 [2018-01-20 22:27:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:27:58,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:27:58,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 34 [2018-01-20 22:27:58,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:27:58,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:27:58,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 22:27:58,909 INFO L87 Difference]: Start difference. First operand 328 states and 351 transitions. Second operand 34 states. [2018-01-20 22:28:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:28:00,354 INFO L93 Difference]: Finished difference Result 486 states and 521 transitions. [2018-01-20 22:28:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-20 22:28:00,354 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 92 [2018-01-20 22:28:00,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:28:00,356 INFO L225 Difference]: With dead ends: 486 [2018-01-20 22:28:00,357 INFO L226 Difference]: Without dead ends: 473 [2018-01-20 22:28:00,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2018-01-20 22:28:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-01-20 22:28:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 421. [2018-01-20 22:28:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-01-20 22:28:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 452 transitions. [2018-01-20 22:28:00,375 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 452 transitions. Word has length 92 [2018-01-20 22:28:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:28:00,375 INFO L432 AbstractCegarLoop]: Abstraction has 421 states and 452 transitions. [2018-01-20 22:28:00,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-20 22:28:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 452 transitions. [2018-01-20 22:28:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-01-20 22:28:00,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:28:00,377 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:00,377 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:28:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2053118413, now seen corresponding path program 1 times [2018-01-20 22:28:00,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:28:00,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:28:00,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:00,379 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:28:00,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:00,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:28:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:28:01,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:28:01,445 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:28:01,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:28:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:01,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:28:01,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:28:01,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:28:01,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:01,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:01,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:28:01,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-20 22:28:01,516 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:28:01,518 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:28:01,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,527 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:28:01,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:28:01,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-01-20 22:28:01,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:01,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-01-20 22:28:01,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:01,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-20 22:28:01,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:01,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:01,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-01-20 22:28:01,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-20 22:28:01,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-20 22:28:01,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,655 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:28:01,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:01,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:32 [2018-01-20 22:28:01,719 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 40 treesize of output 31 [2018-01-20 22:28:01,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:28:01,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:01,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:01,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:01,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:62 [2018-01-20 22:28:01,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:01,794 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 42 treesize of output 41 [2018-01-20 22:28:01,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:01,797 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 22 treesize of output 14 [2018-01-20 22:28:01,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:01,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2018-01-20 22:28:02,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2018-01-20 22:28:02,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 22:28:02,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,301 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 16 treesize of output 12 [2018-01-20 22:28:02,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:02,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:02,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-20 22:28:02,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:28:02,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:28:02,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-01-20 22:28:02,427 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 14 treesize of output 10 [2018-01-20 22:28:02,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:28:02,438 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,443 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-01-20 22:28:02,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-01-20 22:28:02,456 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:02,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:28:02,472 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:02,476 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:02,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:28:02,486 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:131, output treesize:27 [2018-01-20 22:28:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:28:02,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:28:02,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2018-01-20 22:28:02,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-20 22:28:02,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-20 22:28:02,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2100, Unknown=1, NotChecked=0, Total=2256 [2018-01-20 22:28:02,601 INFO L87 Difference]: Start difference. First operand 421 states and 452 transitions. Second operand 48 states. [2018-01-20 22:28:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:28:04,607 INFO L93 Difference]: Finished difference Result 476 states and 508 transitions. [2018-01-20 22:28:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:28:04,607 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-01-20 22:28:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:28:04,608 INFO L225 Difference]: With dead ends: 476 [2018-01-20 22:28:04,608 INFO L226 Difference]: Without dead ends: 397 [2018-01-20 22:28:04,610 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=464, Invalid=4937, Unknown=1, NotChecked=0, Total=5402 [2018-01-20 22:28:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-20 22:28:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 376. [2018-01-20 22:28:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-01-20 22:28:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 404 transitions. [2018-01-20 22:28:04,620 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 404 transitions. Word has length 92 [2018-01-20 22:28:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:28:04,620 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 404 transitions. [2018-01-20 22:28:04,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-20 22:28:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 404 transitions. [2018-01-20 22:28:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:28:04,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:28:04,622 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,622 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 22:28:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1123382139, now seen corresponding path program 1 times [2018-01-20 22:28:04,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:28:04,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:28:04,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:04,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:28:04,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:04,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:28:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:28:05,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:28:05,496 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:28:05,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:28:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:05,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:28:05,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:28:05,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:28:05,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:28:05,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:28:05,583 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:28:05,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:28:05,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,593 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:28:05,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:28:05,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:28:05,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:05,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:05,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-20 22:28:05,776 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 57 treesize of output 52 [2018-01-20 22:28:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:28:05,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:05,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:05,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:05,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:100 [2018-01-20 22:28:05,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,884 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 59 treesize of output 58 [2018-01-20 22:28:05,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-20 22:28:05,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:45 [2018-01-20 22:28:05,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-01-20 22:28:05,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:62 [2018-01-20 22:28:05,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:05,964 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 59 treesize of output 58 [2018-01-20 22:28:05,966 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 7 [2018-01-20 22:28:05,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:05,983 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:28:05,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:67 [2018-01-20 22:28:06,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2018-01-20 22:28:06,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:06,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:06,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:76 [2018-01-20 22:28:06,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 88 [2018-01-20 22:28:06,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,244 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 2 case distinctions, treesize of input 20 treesize of output 35 [2018-01-20 22:28:06,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:06,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:06,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:06,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:194 [2018-01-20 22:28:06,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2018-01-20 22:28:06,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,379 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 22 treesize of output 14 [2018-01-20 22:28:06,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:06,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:109, output treesize:82 [2018-01-20 22:28:06,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-01-20 22:28:06,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,454 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:28:06,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-01-20 22:28:06,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2018-01-20 22:28:06,513 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 14 treesize of output 7 [2018-01-20 22:28:06,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:06,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:84 [2018-01-20 22:28:06,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 108 [2018-01-20 22:28:06,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:06,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:06,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:89 [2018-01-20 22:28:06,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 129 [2018-01-20 22:28:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2018-01-20 22:28:06,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:06,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:06,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:06,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:248 [2018-01-20 22:28:06,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 115 [2018-01-20 22:28:06,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:06,988 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 46 treesize of output 26 [2018-01-20 22:28:06,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:06,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:07,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2018-01-20 22:28:07,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-20 22:28:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:28:07,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:07,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:142, output treesize:127 [2018-01-20 22:28:07,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-01-20 22:28:07,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-01-20 22:28:07,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:28:07,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:28:07,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:28:07,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:07,404 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:131, output treesize:4 [2018-01-20 22:28:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:28:07,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:28:07,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 34] total 53 [2018-01-20 22:28:07,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-20 22:28:07,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-20 22:28:07,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2493, Unknown=0, NotChecked=0, Total=2756 [2018-01-20 22:28:07,485 INFO L87 Difference]: Start difference. First operand 376 states and 404 transitions. Second operand 53 states. [2018-01-20 22:28:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:28:12,086 INFO L93 Difference]: Finished difference Result 685 states and 734 transitions. [2018-01-20 22:28:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-01-20 22:28:12,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 101 [2018-01-20 22:28:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:28:12,089 INFO L225 Difference]: With dead ends: 685 [2018-01-20 22:28:12,089 INFO L226 Difference]: Without dead ends: 664 [2018-01-20 22:28:12,092 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1264, Invalid=11168, Unknown=0, NotChecked=0, Total=12432 [2018-01-20 22:28:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-20 22:28:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 400. [2018-01-20 22:28:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-01-20 22:28:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 429 transitions. [2018-01-20 22:28:12,108 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 429 transitions. Word has length 101 [2018-01-20 22:28:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:28:12,109 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 429 transitions. [2018-01-20 22:28:12,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-20 22:28:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 429 transitions. [2018-01-20 22:28:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:28:12,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:28:12,110 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:12,111 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-20 22:28:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1864833185, now seen corresponding path program 2 times [2018-01-20 22:28:12,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:28:12,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:28:12,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:12,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:28:12,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:12,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:28:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:28:12,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:28:12,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:28:12,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:28:12,767 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:28:12,783 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:28:12,789 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:28:12,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:28:12,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-20 22:28:12,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:28:12,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:12,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:12,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:28:12,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-01-20 22:28:12,896 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:28:12,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:28:12,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,907 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:28:12,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-01-20 22:28:12,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:12,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-01-20 22:28:12,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:12,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:12,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:12,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-01-20 22:28:13,105 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 57 treesize of output 52 [2018-01-20 22:28:13,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:28:13,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:13,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:13,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:13,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:106 [2018-01-20 22:28:13,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,208 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 59 treesize of output 58 [2018-01-20 22:28:13,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-20 22:28:13,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:48 [2018-01-20 22:28:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-01-20 22:28:13,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:65 [2018-01-20 22:28:13,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,284 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 59 treesize of output 58 [2018-01-20 22:28:13,287 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 7 [2018-01-20 22:28:13,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,307 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:28:13,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:70 [2018-01-20 22:28:13,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2018-01-20 22:28:13,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:13,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:13,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:79 [2018-01-20 22:28:13,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 100 [2018-01-20 22:28:13,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,564 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 2 case distinctions, treesize of input 20 treesize of output 35 [2018-01-20 22:28:13,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:13,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:13,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:13,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:168 [2018-01-20 22:28:13,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-01-20 22:28:13,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,705 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 22 treesize of output 14 [2018-01-20 22:28:13,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:13,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:77 [2018-01-20 22:28:13,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-01-20 22:28:13,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,790 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:28:13,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:82 [2018-01-20 22:28:13,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 84 [2018-01-20 22:28:13,838 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 14 treesize of output 7 [2018-01-20 22:28:13,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:13,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:87 [2018-01-20 22:28:13,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:13,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2018-01-20 22:28:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-20 22:28:13,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:13,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:13,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:92 [2018-01-20 22:28:14,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 129 [2018-01-20 22:28:14,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2018-01-20 22:28:14,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:28:14,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:28:14,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:28:14,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:163, output treesize:254 [2018-01-20 22:28:14,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 115 [2018-01-20 22:28:14,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:28:14,286 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 46 treesize of output 26 [2018-01-20 22:28:14,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:14,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:182, output treesize:127 [2018-01-20 22:28:14,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-20 22:28:14,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-20 22:28:14,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:28:14,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:130 [2018-01-20 22:28:14,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-01-20 22:28:14,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-20 22:28:14,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-01-20 22:28:14,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-01-20 22:28:14,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-20 22:28:14,688 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:28:14,694 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:134, output treesize:8 [2018-01-20 22:28:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:28:14,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:28:14,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 35] total 56 [2018-01-20 22:28:14,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-20 22:28:14,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-20 22:28:14,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2769, Unknown=0, NotChecked=0, Total=3080 [2018-01-20 22:28:14,860 INFO L87 Difference]: Start difference. First operand 400 states and 429 transitions. Second operand 56 states. [2018-01-20 22:28:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:28:18,224 INFO L93 Difference]: Finished difference Result 685 states and 734 transitions. [2018-01-20 22:28:18,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-20 22:28:18,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 101 [2018-01-20 22:28:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:28:18,226 INFO L225 Difference]: With dead ends: 685 [2018-01-20 22:28:18,226 INFO L226 Difference]: Without dead ends: 672 [2018-01-20 22:28:18,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3860 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1246, Invalid=10526, Unknown=0, NotChecked=0, Total=11772 [2018-01-20 22:28:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-01-20 22:28:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 411. [2018-01-20 22:28:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-01-20 22:28:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 441 transitions. [2018-01-20 22:28:18,237 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 441 transitions. Word has length 101 [2018-01-20 22:28:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:28:18,237 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 441 transitions. [2018-01-20 22:28:18,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-20 22:28:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 441 transitions. [2018-01-20 22:28:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:28:18,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:28:18,238 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:18,238 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-20 22:28:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash 737885716, now seen corresponding path program 1 times [2018-01-20 22:28:18,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:28:18,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:28:18,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:18,240 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:28:18,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:28:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:28:18,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-20 22:28:18,553 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:264) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:262) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:131) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:200) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-20 22:28:18,557 INFO L168 Benchmark]: Toolchain (without parser) took 50069.06 ms. Allocated memory was 307.8 MB in the beginning and 781.7 MB in the end (delta: 474.0 MB). Free memory was 266.7 MB in the beginning and 656.5 MB in the end (delta: -389.8 MB). Peak memory consumption was 426.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:28:18,558 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:28:18,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 254.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:28:18,558 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 252.7 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:28:18,559 INFO L168 Benchmark]: RCFGBuilder took 424.45 ms. Allocated memory is still 307.8 MB. Free memory was 252.7 MB in the beginning and 223.8 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:28:18,559 INFO L168 Benchmark]: TraceAbstraction took 49362.02 ms. Allocated memory was 307.8 MB in the beginning and 781.7 MB in the end (delta: 474.0 MB). Free memory was 223.8 MB in the beginning and 656.5 MB in the end (delta: -432.7 MB). Peak memory consumption was 383.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:28:18,560 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 307.8 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.95 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 254.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 424.45 ms. Allocated memory is still 307.8 MB. Free memory was 252.7 MB in the beginning and 223.8 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49362.02 ms. Allocated memory was 307.8 MB in the beginning and 781.7 MB in the end (delta: 474.0 MB). Free memory was 223.8 MB in the beginning and 656.5 MB in the end (delta: -432.7 MB). Peak memory consumption was 383.2 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, 91 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=91occurred 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: [L994] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={14:0}] [L994] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L995] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L997] FCALL list->colour = BLACK VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L999] struct TSLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] end = ((void*)0) [L1029] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1032] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1032] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1033] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1033] COND FALSE !(!(BLACK == end->colour)) [L1033] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1034] COND TRUE ((void*)0) != end VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1036] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1036] COND FALSE !(RED == end->colour) [L1043] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1043] end = end->next [L1034] COND FALSE !(((void*)0) != end) VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1047] COND TRUE ((void*)0) != list VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1049] EXPR, FCALL list->colour VAL [end={0:0}, list={14:0}, list->colour=1, malloc(sizeof(struct TSLL))={14:0}] [L1049] COND FALSE !(RED == list->colour) [L1058] EXPR, FCALL list->next VAL [end={0:0}, list={14:0}, list->next={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1058] end = list->next [L1059] FCALL free(list) VAL [end={0:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}] [L1060] list = end VAL [end={0:0}, list={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1047] COND FALSE !(((void*)0) != list) VAL [end={0:0}, list={0:0}, malloc(sizeof(struct TSLL))={14:0}] [L1064] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 91 locations, 3 error locations. UNSAFE Result, 0.7s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 167 SDtfs, 223 SDslu, 66 SDs, 0 SdLazy, 73 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, 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, 28 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 2807 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 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:264) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-28-18-568.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-28-18-568.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-28-18-568.csv Completed graceful shutdown