java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:04:40,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:04:40,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:04:40,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:04:40,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:04:40,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:04:40,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:04:40,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:04:40,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:04:40,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:04:40,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:04:40,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:04:40,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:04:40,385 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:04:40,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:04:40,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:04:40,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:04:40,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:04:40,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:04:40,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:04:40,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:04:40,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:04:40,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:04:40,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:04:40,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:04:40,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:04:40,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:04:40,402 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:04:40,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:04:40,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:04:40,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:04:40,403 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:04:40,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:04:40,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:04:40,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:04:40,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:04:40,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:04:40,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:04:40,416 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:04:40,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:04:40,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:04:40,417 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:04:40,417 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:04:40,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:04:40,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:04:40,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:04:40,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:04:40,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:04:40,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:04:40,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:04:40,419 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:04:40,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:04:40,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:04:40,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:04:40,420 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:04:40,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:04:40,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:04:40,421 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:04:40,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:04:40,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:04:40,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:04:40,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:04:40,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:04:40,422 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:04:40,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:04:40,465 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:04:40,468 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:04:40,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:04:40,470 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:04:40,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-20 22:04:40,654 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:04:40,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:04:40,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:04:40,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:04:40,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:04:40,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a484b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40, skipping insertion in model container [2018-01-20 22:04:40,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,681 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:04:40,719 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:04:40,844 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:04:40,870 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:04:40,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40 WrapperNode [2018-01-20 22:04:40,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:04:40,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:04:40,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:04:40,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:04:40,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (1/1) ... [2018-01-20 22:04:40,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:04:40,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:04:40,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:04:40,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:04:40,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (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:04:40,973 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:04:40,973 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:04:40,974 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:04:40,974 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:04:40,975 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:04:40,975 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:04:40,975 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:04:41,367 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:04:41,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:04:41 BoogieIcfgContainer [2018-01-20 22:04:41,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:04:41,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:04:41,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:04:41,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:04:41,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:04:40" (1/3) ... [2018-01-20 22:04:41,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3c41e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:04:41, skipping insertion in model container [2018-01-20 22:04:41,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:04:40" (2/3) ... [2018-01-20 22:04:41,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3c41e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:04:41, skipping insertion in model container [2018-01-20 22:04:41,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:04:41" (3/3) ... [2018-01-20 22:04:41,377 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-01-20 22:04:41,387 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:04:41,396 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:04:41,437 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:04:41,437 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:04:41,437 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:04:41,437 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:04:41,437 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:04:41,437 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:04:41,437 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:04:41,437 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:04:41,438 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:04:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-20 22:04:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:04:41,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:41,463 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:04:41,463 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:04:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash 185475, now seen corresponding path program 1 times [2018-01-20 22:04:41,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:41,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:41,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:41,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:04:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:04:41,567 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:04:41,573 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:04:41,583 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:04:41,583 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:04:41,584 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:04:41,584 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:04:41,584 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:04:41,584 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:04:41,584 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:04:41,584 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:04:41,585 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:04:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-20 22:04:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:04:41,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:41,590 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:04:41,591 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:04:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1602735979, now seen corresponding path program 1 times [2018-01-20 22:04:41,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:41,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:41,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:41,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:41,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:41,752 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:04:41,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:41,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:04:41,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:04:41,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:04:41,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:04:41,771 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 2 states. [2018-01-20 22:04:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:41,797 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2018-01-20 22:04:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:04:41,799 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-20 22:04:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:41,811 INFO L225 Difference]: With dead ends: 173 [2018-01-20 22:04:41,812 INFO L226 Difference]: Without dead ends: 89 [2018-01-20 22:04:41,814 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:04:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-20 22:04:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-20 22:04:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 22:04:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-20 22:04:41,853 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 21 [2018-01-20 22:04:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:41,853 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-20 22:04:41,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:04:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-20 22:04:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:04:41,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:41,855 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:41,855 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:04:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash 553744969, now seen corresponding path program 1 times [2018-01-20 22:04:41,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:41,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:41,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:41,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:41,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:41,948 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:04:41,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:41,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:04:41,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:04:41,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:04:41,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:04:41,951 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 4 states. [2018-01-20 22:04:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:42,015 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-01-20 22:04:42,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:04:42,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 22:04:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:42,018 INFO L225 Difference]: With dead ends: 98 [2018-01-20 22:04:42,018 INFO L226 Difference]: Without dead ends: 93 [2018-01-20 22:04:42,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:04:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-20 22:04:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-01-20 22:04:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-20 22:04:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-01-20 22:04:42,030 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2018-01-20 22:04:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:42,031 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-01-20 22:04:42,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:04:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-01-20 22:04:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 22:04:42,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:42,033 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:42,033 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:04:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1841085354, now seen corresponding path program 1 times [2018-01-20 22:04:42,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:42,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:42,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:42,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:04:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:04:42,120 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:04:42,130 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:04:42,138 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:04:42,138 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:04:42,155 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:04:42,155 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:04:42,155 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:04:42,155 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:04:42,155 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:04:42,156 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:04:42,156 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:04:42,156 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:04:42,156 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:04:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-01-20 22:04:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:04:42,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:42,159 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:04:42,160 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2000564629, now seen corresponding path program 1 times [2018-01-20 22:04:42,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:42,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:42,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:42,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:42,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:42,186 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:04:42,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:42,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:04:42,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:04:42,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:04:42,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:04:42,188 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 2 states. [2018-01-20 22:04:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:42,197 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2018-01-20 22:04:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:04:42,197 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-20 22:04:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:42,198 INFO L225 Difference]: With dead ends: 173 [2018-01-20 22:04:42,199 INFO L226 Difference]: Without dead ends: 87 [2018-01-20 22:04:42,199 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:04:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-20 22:04:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-20 22:04:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-20 22:04:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-20 22:04:42,207 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-20 22:04:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:42,207 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-20 22:04:42,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:04:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-20 22:04:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:04:42,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:42,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] [2018-01-20 22:04:42,209 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1791600567, now seen corresponding path program 1 times [2018-01-20 22:04:42,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:42,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:42,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:42,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:42,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:42,253 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:04:42,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:42,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:04:42,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:04:42,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:04:42,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:04:42,255 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 4 states. [2018-01-20 22:04:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:42,294 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-01-20 22:04:42,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:04:42,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-20 22:04:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:42,296 INFO L225 Difference]: With dead ends: 94 [2018-01-20 22:04:42,296 INFO L226 Difference]: Without dead ends: 91 [2018-01-20 22:04:42,297 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:04:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-20 22:04:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-20 22:04:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 22:04:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-20 22:04:42,304 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 22 [2018-01-20 22:04:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:42,304 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-20 22:04:42,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:04:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-20 22:04:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:04:42,305 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:42,306 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:42,306 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2138226282, now seen corresponding path program 1 times [2018-01-20 22:04:42,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:42,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:42,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:42,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:42,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:43,022 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 38 DAG size of output 23 [2018-01-20 22:04:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:43,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:04:43,219 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:04:43,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:43,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:04:43,441 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:04:43,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:04:43,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:43,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:43,459 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:04:43,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:54 [2018-01-20 22:04:43,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-01-20 22:04:43,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2018-01-20 22:04:43,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:04:43,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:04:43,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:04:43,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:69 [2018-01-20 22:04:43,838 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int) (main_~st~4.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~4.base 1))) (let ((.cse1 (store .cse0 main_~st~4.base 0))) (and (= 0 (select .cse0 main_~st~4.base)) (not (= 0 main_~n~4.base)) (= |c_#valid| (store .cse1 main_~n~4.base 0)) (not (= main_~st~4.base 0)) (= (select .cse1 main_~n~4.base) 1) (= 0 (select |c_old(#valid)| main_~n~4.base)))))) is different from true [2018-01-20 22:04:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-20 22:04:43,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:04:43,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-20 22:04:43,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-20 22:04:43,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-20 22:04:43,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=419, Unknown=2, NotChecked=40, Total=506 [2018-01-20 22:04:43,889 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 23 states. [2018-01-20 22:04:44,905 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 81 DAG size of output 38 [2018-01-20 22:04:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:45,618 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2018-01-20 22:04:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-20 22:04:45,622 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-01-20 22:04:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:45,625 INFO L225 Difference]: With dead ends: 169 [2018-01-20 22:04:45,625 INFO L226 Difference]: Without dead ends: 166 [2018-01-20 22:04:45,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=1098, Unknown=6, NotChecked=68, Total=1332 [2018-01-20 22:04:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-20 22:04:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 129. [2018-01-20 22:04:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 22:04:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-20 22:04:45,641 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 34 [2018-01-20 22:04:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:45,642 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-20 22:04:45,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-20 22:04:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-20 22:04:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-20 22:04:45,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:45,644 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:45,644 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash -232230565, now seen corresponding path program 1 times [2018-01-20 22:04:45,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:45,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:45,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:45,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:45,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:45,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:45,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:45,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:04:45,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:04:45,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:04:45,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:04:45,717 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 5 states. [2018-01-20 22:04:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:45,828 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-01-20 22:04:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:04:45,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-20 22:04:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:45,830 INFO L225 Difference]: With dead ends: 184 [2018-01-20 22:04:45,830 INFO L226 Difference]: Without dead ends: 181 [2018-01-20 22:04:45,830 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:04:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-20 22:04:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2018-01-20 22:04:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 22:04:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-20 22:04:45,843 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 40 [2018-01-20 22:04:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:45,843 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-20 22:04:45,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:04:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-20 22:04:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-20 22:04:45,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:45,845 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:45,845 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash 380991995, now seen corresponding path program 1 times [2018-01-20 22:04:45,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:45,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:45,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:45,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:45,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:45,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:45,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:04:45,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:04:45,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:04:45,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:04:45,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:04:45,925 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 5 states. [2018-01-20 22:04:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:45,998 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-01-20 22:04:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:04:46,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-01-20 22:04:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:46,002 INFO L225 Difference]: With dead ends: 181 [2018-01-20 22:04:46,002 INFO L226 Difference]: Without dead ends: 178 [2018-01-20 22:04:46,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:04:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-20 22:04:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 129. [2018-01-20 22:04:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 22:04:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2018-01-20 22:04:46,026 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 40 [2018-01-20 22:04:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:46,027 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2018-01-20 22:04:46,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:04:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2018-01-20 22:04:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:04:46,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:46,029 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:46,031 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash 423075683, now seen corresponding path program 2 times [2018-01-20 22:04:46,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:46,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:46,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:46,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:46,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:46,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:46,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:04:46,141 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:04:46,150 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:04:46,170 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:04:46,199 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:04:46,202 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:04:46,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:04:46,216 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:04:46,218 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:04:46,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-20 22:04:46,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 22:04:46,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:46,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:04:46,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,243 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:04:46,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2018-01-20 22:04:46,247 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:04:46,249 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:04:46,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:46,251 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:04:46,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-20 22:04:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:46,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:04:46,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-20 22:04:46,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:04:46,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:04:46,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-20 22:04:46,290 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 9 states. [2018-01-20 22:04:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:04:46,434 INFO L93 Difference]: Finished difference Result 192 states and 219 transitions. [2018-01-20 22:04:46,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:04:46,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-20 22:04:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:04:46,441 INFO L225 Difference]: With dead ends: 192 [2018-01-20 22:04:46,441 INFO L226 Difference]: Without dead ends: 157 [2018-01-20 22:04:46,442 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:04:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-20 22:04:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2018-01-20 22:04:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-20 22:04:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2018-01-20 22:04:46,451 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 46 [2018-01-20 22:04:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:04:46,451 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2018-01-20 22:04:46,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:04:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2018-01-20 22:04:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 22:04:46,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:04:46,453 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:04:46,453 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:04:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1822928984, now seen corresponding path program 1 times [2018-01-20 22:04:46,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:04:46,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:04:46,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:46,454 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:04:46,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:04:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:46,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:04:47,295 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 36 DAG size of output 27 [2018-01-20 22:04:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:04:47,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:04:47,667 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:04:47,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:04:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:04:47,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:04:47,741 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:04:47,743 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:04:47,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-20 22:04:47,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-20 22:04:47,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:47,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:04:47,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-20 22:04:47,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-20 22:04:47,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-20 22:04:47,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-20 22:04:47,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-20 22:04:47,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-20 22:04:47,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:47,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-20 22:04:47,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 57 [2018-01-20 22:04:48,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-01-20 22:04:48,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:48,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,037 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:04:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-01-20 22:04:48,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:48,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:04:48,069 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:04:48,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:98 [2018-01-20 22:04:48,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-01-20 22:04:48,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:48,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-20 22:04:48,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:48,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:04:48,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:104 [2018-01-20 22:04:48,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 85 [2018-01-20 22:04:48,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:48,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-01-20 22:04:48,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:48,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:48,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 85 [2018-01-20 22:04:48,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:49,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:49,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-01-20 22:04:49,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:49,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-20 22:04:49,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:275, output treesize:521 [2018-01-20 22:04:49,415 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 122 [2018-01-20 22:04:49,685 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 122 [2018-01-20 22:04:49,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:49,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 103 [2018-01-20 22:04:49,713 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:04:49,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:49,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:51,226 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:04:51,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:51,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 84 [2018-01-20 22:04:51,234 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:04:51,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:51,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:52,865 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:04:52,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-01-20 22:04:52,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-20 22:04:52,876 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:52,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:04:54,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 127 [2018-01-20 22:04:54,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-01-20 22:04:54,320 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:54,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 113 [2018-01-20 22:04:54,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-20 22:04:54,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:04:56,049 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:04:56,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-01-20 22:04:56,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:56,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 68 [2018-01-20 22:04:56,067 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:56,085 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-01-20 22:04:57,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,487 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 64 [2018-01-20 22:04:57,488 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:04:57,515 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:04:57,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:57,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 117 [2018-01-20 22:04:57,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-01-20 22:04:57,540 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:57,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 91 [2018-01-20 22:04:57,608 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:57,665 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:04:58,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2018-01-20 22:04:58,744 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:04:58,744 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:58,757 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:04:59,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:04:59,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 81 [2018-01-20 22:04:59,581 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:04:59,581 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-20 22:04:59,596 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:00,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-01-20 22:05:00,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 75 [2018-01-20 22:05:00,327 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:00,339 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:00,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-01-20 22:05:00,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2018-01-20 22:05:00,350 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:00,398 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:00,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2018-01-20 22:05:00,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:00,928 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 58 [2018-01-20 22:05:00,929 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:00,950 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:01,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:01,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:01,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:01,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 115 [2018-01-20 22:05:01,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:01,438 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 135 [2018-01-20 22:05:01,439 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:01,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2018-01-20 22:05:01,567 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:01,630 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:05:02,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 84 [2018-01-20 22:05:02,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:05:02,057 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,072 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 100 [2018-01-20 22:05:02,077 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:05:02,078 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,097 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:02,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-01-20 22:05:02,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:05:02,473 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,488 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-01-20 22:05:02,827 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:05:02,827 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:02,838 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:03,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:03,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:03,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:03,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2018-01-20 22:05:03,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:03,162 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 78 [2018-01-20 22:05:03,163 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:03,183 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:05:03,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 88 [2018-01-20 22:05:03,449 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:05:03,449 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:03,465 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:03,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 16 dim-2 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2018-01-20 22:05:03,712 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 36 variables, input treesize:697, output treesize:789 [2018-01-20 22:05:04,221 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 196 DAG size of output 177 [2018-01-20 22:05:04,664 WARN L143 SmtUtils]: Spent 246ms on a formula simplification that was a NOOP. DAG size: 183 [2018-01-20 22:05:04,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:04,691 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:04,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 89 [2018-01-20 22:05:04,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:05:04,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:04,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:09,488 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:09,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 74 [2018-01-20 22:05:09,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:09,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 24 [2018-01-20 22:05:09,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:09,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:13,455 INFO L682 Elim1Store]: detected equality via solver [2018-01-20 22:05:13,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2018-01-20 22:05:13,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:13,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:13,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-01-20 22:05:13,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:13,473 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:25,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:25,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2018-01-20 22:05:25,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-20 22:05:25,014 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:25,028 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:28,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:28,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:28,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:28,409 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 84 treesize of output 98 [2018-01-20 22:05:28,421 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 62 [2018-01-20 22:05:28,423 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:05:28,444 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:32,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:32,651 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 82 treesize of output 83 [2018-01-20 22:05:32,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:05:32,654 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:32,670 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:35,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-01-20 22:05:35,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-01-20 22:05:35,381 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:35,392 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:38,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:38,547 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 78 treesize of output 79 [2018-01-20 22:05:38,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-20 22:05:38,549 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:38,561 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:40,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:40,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 86 [2018-01-20 22:05:40,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-20 22:05:40,104 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:40,117 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:41,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2018-01-20 22:05:41,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 57 [2018-01-20 22:05:41,610 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-01-20 22:05:41,632 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:45,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-01-20 22:05:45,564 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 57 [2018-01-20 22:05:45,566 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-01-20 22:05:45,599 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:05:48,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:48,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:05:48,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 89 [2018-01-20 22:05:48,702 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2018-01-20 22:05:48,704 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:05:48,723 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:05:50,836 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 92 treesize of output 92 [2018-01-20 22:05:50,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-01-20 22:05:50,840 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-20 22:05:50,857 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-01-20 22:05:51,495 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-20 22:05:51,495 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:05:51,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:05:51 BoogieIcfgContainer [2018-01-20 22:05:51,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:05:51,497 INFO L168 Benchmark]: Toolchain (without parser) took 70842.99 ms. Allocated memory was 306.7 MB in the beginning and 610.8 MB in the end (delta: 304.1 MB). Free memory was 264.0 MB in the beginning and 496.4 MB in the end (delta: -232.4 MB). Peak memory consumption was 254.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:05:51,498 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:05:51,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.46 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:05:51,499 INFO L168 Benchmark]: Boogie Preprocessor took 41.69 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:05:51,499 INFO L168 Benchmark]: RCFGBuilder took 445.47 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 223.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:05:51,499 INFO L168 Benchmark]: TraceAbstraction took 70127.66 ms. Allocated memory was 306.7 MB in the beginning and 610.8 MB in the end (delta: 304.1 MB). Free memory was 221.5 MB in the beginning and 496.4 MB in the end (delta: -274.9 MB). Peak memory consumption was 211.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:05:51,501 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 306.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.46 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.69 ms. Allocated memory is still 306.7 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 445.47 ms. Allocated memory is still 306.7 MB. Free memory was 250.1 MB in the beginning and 223.5 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70127.66 ms. Allocated memory was 306.7 MB in the beginning and 610.8 MB in the end (delta: 304.1 MB). Free memory was 221.5 MB in the beginning and 496.4 MB in the end (delta: -274.9 MB). Peak memory consumption was 211.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L630] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={14:0}] [L630] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L631] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L632] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L633] FCALL root->parent = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, root={14:0}] [L634] COND FALSE !(__VERIFIER_nondet_int()) [L655] n = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, n={0:0}, root={14:0}] [L656] EXPR, FCALL malloc(sizeof(*s)) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}] [L656] struct StackItem* s = malloc(sizeof(*s)), *st; VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L657] FCALL s->next = ((void *)0) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L658] FCALL s->node = root VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}] [L659] COND TRUE s != ((void *)0) [L660] st = s VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}, s={15:0}] [L661] EXPR, FCALL s->next VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={15:0}, s={15:0}, s->next={0:0}] [L661] s = s->next [L662] EXPR, FCALL st->node VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={0:0}, root={14:0}, s={0:0}, s={15:0}, st->node={14:0}] [L662] n = st->node [L663] FCALL free(st) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={15:0}, s={0:0}] [L664] FCALL n->left VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, n->left={0:0}, root={14:0}, s={15:0}, s={0:0}] [L664] COND FALSE !(n->left) [L670] FCALL n->right VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, n->right={0:0}, root={14:0}, s={15:0}, s={0:0}] [L670] COND FALSE !(n->right) [L676] FCALL free(n) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={0:0}, s={15:0}] [L659] COND FALSE !(s != ((void *)0)) VAL [malloc(sizeof(*root))={14:0}, malloc(sizeof(*s))={15:0}, n={14:0}, root={14:0}, s={0:0}, s={15:0}] [L678] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 38 SDslu, 154 SDs, 0 SdLazy, 13 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 237. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 92 locations, 3 error locations. TIMEOUT Result, 69.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 592 SDtfs, 549 SDslu, 2458 SDs, 0 SdLazy, 1172 SolverSat, 22 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 152 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 273 ConstructedInterpolants, 11 QuantifiedInterpolants, 69351 SizeOfPredicates, 18 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 27/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-05-51-509.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-05-51-509.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-05-51-509.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-05-51-509.csv Completed graceful shutdown