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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:17:13,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:17:13,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:17:13,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:17:13,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:17:13,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:17:13,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:17:13,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:17:13,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:17:13,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:17:13,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:17:13,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:17:13,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:17:13,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:17:13,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:17:13,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:17:13,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:17:13,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:17:13,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:17:13,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:17:13,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:17:13,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:17:13,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:17:13,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:17:13,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:17:13,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:17:13,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:17:13,651 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:17:13,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:17:13,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:17:13,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:17:13,652 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:17:13,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:17:13,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:17:13,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:17:13,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:17:13,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:17:13,664 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:17:13,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:17:13,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:17:13,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:17:13,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:17:13,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:17:13,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:17:13,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:17:13,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:17:13,667 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:17:13,667 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:17:13,667 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:17:13,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:17:13,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:17:13,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:17:13,668 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:17:13,668 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:17:13,668 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:17:13,668 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:17:13,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:17:13,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:17:13,669 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:17:13,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:17:13,669 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:17:13,670 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:17:13,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:17:13,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:17:13,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:17:13,670 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:17:13,671 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:17:13,671 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:17:13,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:17:13,716 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:17:13,719 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:17:13,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:17:13,720 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:17:13,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-24 17:17:13,910 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:17:13,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:17:13,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:17:13,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:17:13,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:17:13,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:17:13" (1/1) ... [2018-01-24 17:17:13,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6356c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:13, skipping insertion in model container [2018-01-24 17:17:13,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:17:13" (1/1) ... [2018-01-24 17:17:13,942 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:17:13,994 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:17:14,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:17:14,125 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:17:14,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14 WrapperNode [2018-01-24 17:17:14,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:17:14,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:17:14,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:17:14,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:17:14,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (1/1) ... [2018-01-24 17:17:14,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:17:14,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:17:14,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:17:14,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:17:14,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (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-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 17:17:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:17:14,216 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:17:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:17:14,217 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:17:14,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:17:14,473 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:17:14,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:17:14 BoogieIcfgContainer [2018-01-24 17:17:14,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:17:14,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:17:14,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:17:14,477 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:17:14,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:17:13" (1/3) ... [2018-01-24 17:17:14,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450bf49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:17:14, skipping insertion in model container [2018-01-24 17:17:14,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:17:14" (2/3) ... [2018-01-24 17:17:14,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450bf49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:17:14, skipping insertion in model container [2018-01-24 17:17:14,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:17:14" (3/3) ... [2018-01-24 17:17:14,480 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-24 17:17:14,490 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:17:14,498 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 17:17:14,549 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:17:14,549 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:17:14,549 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:17:14,549 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:17:14,550 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:17:14,550 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:17:14,550 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:17:14,550 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:17:14,551 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:17:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-24 17:17:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:17:14,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:14,581 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:17:14,581 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-24 17:17:14,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:14,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:14,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:14,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:14,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:14,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:14,782 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-24 17:17:14,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:14,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:17:14,784 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:14,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:17:14,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:17:14,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:17:14,806 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-24 17:17:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:15,074 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 17:17:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:17:15,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 17:17:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:15,144 INFO L225 Difference]: With dead ends: 178 [2018-01-24 17:17:15,144 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 17:17:15,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:17:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 17:17:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-24 17:17:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 17:17:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-24 17:17:15,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-24 17:17:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:15,195 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-24 17:17:15,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:17:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-24 17:17:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:17:15,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:15,197 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:17:15,198 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-24 17:17:15,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:15,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:15,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:15,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:15,332 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-24 17:17:15,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:15,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:17:15,332 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:15,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:17:15,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:17:15,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:17:15,335 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-24 17:17:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:15,390 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-24 17:17:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:17:15,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 17:17:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:15,392 INFO L225 Difference]: With dead ends: 136 [2018-01-24 17:17:15,393 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 17:17:15,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:17:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 17:17:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-24 17:17:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 17:17:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-24 17:17:15,405 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-24 17:17:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:15,405 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-24 17:17:15,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:17:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-24 17:17:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:17:15,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:15,406 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-24 17:17:15,406 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-24 17:17:15,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:15,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:15,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:15,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:15,492 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-24 17:17:15,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:15,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:17:15,493 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:15,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:17:15,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:17:15,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:17:15,493 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-24 17:17:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:15,561 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 17:17:15,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:17:15,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:17:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:15,563 INFO L225 Difference]: With dead ends: 75 [2018-01-24 17:17:15,563 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 17:17:15,564 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:17:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 17:17:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 17:17:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 17:17:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 17:17:15,573 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 17:17:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:15,573 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 17:17:15,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:17:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 17:17:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:17:15,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:15,575 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-24 17:17:15,575 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-24 17:17:15,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:15,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:15,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:15,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:15,657 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-24 17:17:15,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:15,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:17:15,658 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:15,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:17:15,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:17:15,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:17:15,659 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-24 17:17:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:15,771 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 17:17:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:17:15,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:17:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:15,773 INFO L225 Difference]: With dead ends: 71 [2018-01-24 17:17:15,773 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 17:17:15,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:17:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 17:17:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 17:17:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 17:17:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 17:17:15,781 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-24 17:17:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:15,782 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 17:17:15,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:17:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 17:17:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:17:15,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:15,783 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-24 17:17:15,783 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-24 17:17:15,784 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:15,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:15,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:15,785 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:15,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:16,112 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-24 17:17:16,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:16,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:17:16,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:16,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:17:16,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:17:16,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:17:16,114 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-24 17:17:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:16,351 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-24 17:17:16,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:17:16,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 17:17:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:16,354 INFO L225 Difference]: With dead ends: 130 [2018-01-24 17:17:16,354 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 17:17:16,355 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:17:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 17:17:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-24 17:17:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 17:17:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-24 17:17:16,364 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-24 17:17:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:16,365 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-24 17:17:16,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:17:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-24 17:17:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:17:16,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:16,366 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:17:16,366 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-24 17:17:16,367 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:16,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:16,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:16,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:16,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:16,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:16,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:16,684 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:16,685 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:17:16,686 INFO L201 CegarAbsIntRunner]: [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [103], [104], [106], [108], [119], [123], [124], [125], [127], [128] [2018-01-24 17:17:16,728 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:17:16,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:17:16,878 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:17:16,879 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-24 17:17:16,903 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:17:16,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:16,904 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 17:17:16,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:16,914 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:16,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:17,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 17:17:17,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:17,043 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 17 treesize of output 16 [2018-01-24 17:17:17,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:17,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:17,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:17:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:17,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:18,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:18,065 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:18,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:18,069 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:18,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:18,101 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 17 treesize of output 16 [2018-01-24 17:17:18,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:18,115 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 20 treesize of output 19 [2018-01-24 17:17:18,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:18,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:18,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:17:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:18,145 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:18,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:18,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 32 [2018-01-24 17:17:18,771 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:18,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:17:18,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:17:18,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 17:17:18,772 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-24 17:17:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:19,222 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-24 17:17:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:17:19,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-24 17:17:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:19,224 INFO L225 Difference]: With dead ends: 135 [2018-01-24 17:17:19,224 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 17:17:19,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 17:17:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 17:17:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 17:17:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 17:17:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 17:17:19,231 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-24 17:17:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:19,232 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 17:17:19,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:17:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 17:17:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:17:19,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:19,233 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 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-24 17:17:19,233 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-24 17:17:19,233 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:19,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:19,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:19,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:19,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:19,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 17:17:19,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:19,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:17:19,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:19,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:17:19,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:17:19,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:17:19,355 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-24 17:17:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:19,491 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-24 17:17:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:17:19,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-24 17:17:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:19,493 INFO L225 Difference]: With dead ends: 104 [2018-01-24 17:17:19,493 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 17:17:19,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:17:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 17:17:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-24 17:17:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 17:17:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-24 17:17:19,502 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-24 17:17:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:19,502 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-24 17:17:19,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:17:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-24 17:17:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:17:19,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:19,504 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 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-24 17:17:19,504 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-24 17:17:19,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:19,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:19,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:19,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:19,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:19,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:19,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:19,580 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:19,580 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 17:17:19,580 INFO L201 CegarAbsIntRunner]: [3], [7], [10], [28], [32], [37], [40], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [123], [124], [125], [127], [128], [129] [2018-01-24 17:17:19,582 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:17:19,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:17:19,689 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:17:19,689 INFO L268 AbstractInterpreter]: Visited 29 different actions 42 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-24 17:17:19,691 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:17:19,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:19,691 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 17:17:19,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:19,700 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:19,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:19,759 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:19,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:19,818 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:19,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:19,822 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:19,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 17:17:19,916 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 17:17:19,972 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 17:17:19,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-24 17:17:19,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:19,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:17:19,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:17:19,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:17:19,973 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-24 17:17:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:20,024 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-24 17:17:20,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:17:20,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-24 17:17:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:20,026 INFO L225 Difference]: With dead ends: 137 [2018-01-24 17:17:20,026 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 17:17:20,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:17:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 17:17:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-24 17:17:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 17:17:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-24 17:17:20,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-24 17:17:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:20,037 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-24 17:17:20,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:17:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-24 17:17:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 17:17:20,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:20,039 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-01-24 17:17:20,039 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-24 17:17:20,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:20,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:20,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:20,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 17:17:20,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:17:20,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:17:20,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:17:20,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:17:20,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:17:20,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:17:20,160 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-24 17:17:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:20,190 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-24 17:17:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:17:20,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-24 17:17:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:20,193 INFO L225 Difference]: With dead ends: 168 [2018-01-24 17:17:20,193 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 17:17:20,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:17:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 17:17:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-24 17:17:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 17:17:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-24 17:17:20,204 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-24 17:17:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:20,204 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-24 17:17:20,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:17:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-24 17:17:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 17:17:20,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:20,206 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-24 17:17:20,206 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-24 17:17:20,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:20,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:20,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:20,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:20,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:20,294 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:20,294 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 17:17:20,295 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [21], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-24 17:17:20,296 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:17:20,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:17:20,421 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:17:20,421 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 17:17:20,422 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:17:20,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:20,423 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:20,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:20,434 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:20,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:20,525 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:20,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:20,617 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:20,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:20,622 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:20,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:20,667 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:20,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:20,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-24 17:17:20,696 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:20,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:17:20,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:17:20,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:17:20,697 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 11 states. [2018-01-24 17:17:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:20,756 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-01-24 17:17:20,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:17:20,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 17:17:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:20,759 INFO L225 Difference]: With dead ends: 172 [2018-01-24 17:17:20,759 INFO L226 Difference]: Without dead ends: 101 [2018-01-24 17:17:20,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:17:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-24 17:17:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-24 17:17:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 17:17:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-24 17:17:20,770 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 44 [2018-01-24 17:17:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:20,770 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-24 17:17:20,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:17:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-24 17:17:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 17:17:20,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:20,772 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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-24 17:17:20,772 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash -108654543, now seen corresponding path program 2 times [2018-01-24 17:17:20,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:20,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:20,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:20,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:20,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:20,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:20,877 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:20,877 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:17:20,877 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:17:20,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:20,878 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:20,884 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:17:20,885 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:17:20,896 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:20,905 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:20,907 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:20,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:20,970 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:21,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:21,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:21,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:17:21,075 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:17:21,092 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:21,112 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:21,126 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:21,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:21,137 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:21,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:21,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 19 [2018-01-24 17:17:21,174 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:21,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:17:21,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:17:21,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:17:21,176 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 13 states. [2018-01-24 17:17:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:21,247 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-01-24 17:17:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:17:21,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-24 17:17:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:21,248 INFO L225 Difference]: With dead ends: 176 [2018-01-24 17:17:21,249 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 17:17:21,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:17:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 17:17:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-01-24 17:17:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 17:17:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-24 17:17:21,258 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2018-01-24 17:17:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:21,258 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-24 17:17:21,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:17:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-24 17:17:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 17:17:21,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:21,260 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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-24 17:17:21,260 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 3 times [2018-01-24 17:17:21,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:21,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:21,261 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:17:21,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:21,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:21,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:21,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:21,379 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:21,379 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:17:21,379 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:17:21,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:21,380 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:21,389 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:17:21,389 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:17:21,404 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:21,412 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:21,414 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:21,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:21,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:17:21,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:17:21,516 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-24 17:17:21,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:17:21,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:17:21,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 17:17:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 3 not checked. [2018-01-24 17:17:21,551 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 17:17:21,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:21,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:21,733 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:17:21,733 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:17:21,749 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:21,763 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:21,776 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:21,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:21,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:17:21,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:17:21,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:17:21,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:21,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:17:21,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 17:17:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 3 not checked. [2018-01-24 17:17:21,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-24 17:17:21,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:21,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 9, 8] total 18 [2018-01-24 17:17:21,907 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:21,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:17:21,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:17:21,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2018-01-24 17:17:21,909 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 17 states. [2018-01-24 17:17:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:22,362 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2018-01-24 17:17:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 17:17:22,362 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-01-24 17:17:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:22,364 INFO L225 Difference]: With dead ends: 209 [2018-01-24 17:17:22,364 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:17:22,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 192 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=776, Unknown=2, NotChecked=58, Total=992 [2018-01-24 17:17:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:17:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2018-01-24 17:17:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 17:17:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-01-24 17:17:22,375 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 52 [2018-01-24 17:17:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:22,375 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-01-24 17:17:22,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:17:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-01-24 17:17:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 17:17:22,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:22,376 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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-24 17:17:22,376 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126724, now seen corresponding path program 1 times [2018-01-24 17:17:22,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:22,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:22,378 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:17:22,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:22,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:22,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:22,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:22,516 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:22,517 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-24 17:17:22,517 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [22], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-24 17:17:22,518 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:17:22,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:17:22,619 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:17:22,619 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 17:17:22,621 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:17:22,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:22,621 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:22,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:22,631 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:22,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:22,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:22,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:22,812 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:22,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:22,815 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:17:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:22,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:22,876 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:22,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:22,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 21 [2018-01-24 17:17:22,907 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:22,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:17:22,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:17:22,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:17:22,908 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 17 states. [2018-01-24 17:17:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:22,974 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-01-24 17:17:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:17:22,975 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-01-24 17:17:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:22,976 INFO L225 Difference]: With dead ends: 200 [2018-01-24 17:17:22,976 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 17:17:22,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 17:17:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 17:17:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-24 17:17:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 17:17:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-01-24 17:17:22,983 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 56 [2018-01-24 17:17:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:22,983 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-01-24 17:17:22,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:17:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-01-24 17:17:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 17:17:22,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:22,984 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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-24 17:17:22,984 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash -429538227, now seen corresponding path program 2 times [2018-01-24 17:17:22,984 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:22,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:22,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:17:22,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:22,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:23,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:23,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:23,094 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:23,094 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:17:23,095 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:17:23,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:23,095 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:23,103 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:17:23,103 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:17:23,115 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:23,125 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:23,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:23,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:23,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:23,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:23,310 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:23,314 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:17:23,314 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:17:23,331 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:23,353 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:17:23,369 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:23,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:17:23,382 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:23,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:23,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 22 [2018-01-24 17:17:23,453 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:23,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:17:23,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:17:23,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:17:23,454 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 19 states. [2018-01-24 17:17:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:17:23,537 INFO L93 Difference]: Finished difference Result 204 states and 235 transitions. [2018-01-24 17:17:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:17:23,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-01-24 17:17:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:17:23,539 INFO L225 Difference]: With dead ends: 204 [2018-01-24 17:17:23,540 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 17:17:23,540 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 217 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=270, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:17:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 17:17:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-01-24 17:17:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 17:17:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-01-24 17:17:23,551 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 60 [2018-01-24 17:17:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:17:23,552 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-01-24 17:17:23,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:17:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-01-24 17:17:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 17:17:23,553 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:17:23,553 INFO L322 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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-24 17:17:23,553 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-24 17:17:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 3 times [2018-01-24 17:17:23,553 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:17:23,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:23,554 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 17:17:23,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:17:23,555 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:17:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:17:23,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:17:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:17:23,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:23,746 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:17:23,747 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:17:23,747 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:17:23,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:23,747 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:17:23,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:17:23,754 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:17:23,767 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:23,773 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:23,776 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:23,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:23,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 17:17:23,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:23,815 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 23 treesize of output 22 [2018-01-24 17:17:23,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:23,817 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 25 treesize of output 24 [2018-01-24 17:17:23,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:23,834 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 22 treesize of output 21 [2018-01-24 17:17:23,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:23,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:23,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:17:24,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-24 17:17:24,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:24,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-01-24 17:17:24,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:24,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:24,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 17:17:24,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:24,101 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 29 treesize of output 28 [2018-01-24 17:17:24,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:24,120 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 2 xjuncts. [2018-01-24 17:17:24,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 17:17:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 17:17:24,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:24,316 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 17:17:34,056 WARN L146 SmtUtils]: Spent 9595ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-24 17:17:34,066 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:17:37,296 WARN L146 SmtUtils]: Spent 1136ms on a formula simplification. DAG size of input: 73 DAG size of output 40 [2018-01-24 17:17:37,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 17:17:37,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:37,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:17:37,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:37,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-24 17:17:37,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:17:37,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:37,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:37,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:37,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:17:38,407 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-24 17:17:38,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:17:38,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:38,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:17:38,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:38,470 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 17:17:38,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:17:38,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:38,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:38,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:17:38,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:17:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 17:17:40,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:17:40,972 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:17:40,975 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 17:17:40,975 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 17:17:40,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:41,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 17:17:41,021 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:17:41,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:17:41,030 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 23 treesize of output 22 [2018-01-24 17:17:41,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 17:17:41,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 17:17:41,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,061 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 25 treesize of output 24 [2018-01-24 17:17:41,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:41,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:17:41,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-01-24 17:17:41,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-01-24 17:17:41,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:17:41,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-24 17:17:41,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,273 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 29 treesize of output 28 [2018-01-24 17:17:41,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:41,297 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 2 xjuncts. [2018-01-24 17:17:41,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-24 17:17:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 17:17:41,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:17:41,420 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 17:17:47,687 WARN L146 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 17:17:47,695 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:17:55,990 WARN L143 SmtUtils]: Spent 4024ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 17:17:55,995 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:17:56,007 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:17:56,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 17:17:56,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:56,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-24 17:17:56,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:17:56,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:56,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:56,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:17:56,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:56,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:17:56,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:17:57,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:17:57,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:57,093 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 17:17:57,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:17:57,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:57,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:17:57,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:17:57,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:17:57,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:17:57,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:17:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-24 17:17:57,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:17:57,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 36 [2018-01-24 17:17:57,942 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:17:57,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 17:17:57,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 17:17:57,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1132, Unknown=8, NotChecked=0, Total=1260 [2018-01-24 17:17:57,943 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 23 states. [2018-01-24 17:18:18,492 WARN L143 SmtUtils]: Spent 14122ms on a formula simplification that was a NOOP. DAG size: 52 Received shutdown request... [2018-01-24 17:18:20,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 17:18:20,605 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:18:20,609 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:18:20,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:18:20 BoogieIcfgContainer [2018-01-24 17:18:20,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:18:20,611 INFO L168 Benchmark]: Toolchain (without parser) took 66700.31 ms. Allocated memory was 302.5 MB in the beginning and 599.8 MB in the end (delta: 297.3 MB). Free memory was 261.6 MB in the beginning and 552.9 MB in the end (delta: -291.4 MB). Peak memory consumption was 247.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:18:20,611 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:18:20,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.10 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:18:20,612 INFO L168 Benchmark]: Boogie Preprocessor took 33.42 ms. Allocated memory is still 302.5 MB. Free memory was 247.6 MB in the beginning and 246.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 17:18:20,612 INFO L168 Benchmark]: RCFGBuilder took 306.47 ms. Allocated memory is still 302.5 MB. Free memory was 246.6 MB in the beginning and 224.7 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:18:20,612 INFO L168 Benchmark]: TraceAbstraction took 66135.08 ms. Allocated memory was 302.5 MB in the beginning and 599.8 MB in the end (delta: 297.3 MB). Free memory was 224.7 MB in the beginning and 552.9 MB in the end (delta: -328.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 5.3 GB. [2018-01-24 17:18:20,614 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.10 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 247.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.42 ms. Allocated memory is still 302.5 MB. Free memory was 247.6 MB in the beginning and 246.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 306.47 ms. Allocated memory is still 302.5 MB. Free memory was 246.6 MB in the beginning and 224.7 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66135.08 ms. Allocated memory was 302.5 MB in the beginning and 599.8 MB in the end (delta: 297.3 MB). Free memory was 224.7 MB in the beginning and 552.9 MB in the end (delta: -328.2 MB). Peak memory consumption was 210.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 116 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.602736 RENAME_VARIABLES(MILLISECONDS) : 0.591523 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.544820 PROJECTAWAY(MILLISECONDS) : 0.388259 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001088 DISJOIN(MILLISECONDS) : 2.488495 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.639960 ADD_EQUALITY(MILLISECONDS) : 0.064315 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017197 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 226 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.066143 RENAME_VARIABLES(MILLISECONDS) : 0.191429 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.361632 PROJECTAWAY(MILLISECONDS) : 0.090827 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001188 DISJOIN(MILLISECONDS) : 0.354951 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.236714 ADD_EQUALITY(MILLISECONDS) : 0.038087 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013774 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 105 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 102 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 199 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.337624 RENAME_VARIABLES(MILLISECONDS) : 0.135077 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.292161 PROJECTAWAY(MILLISECONDS) : 0.070569 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001234 DISJOIN(MILLISECONDS) : 0.349754 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.172601 ADD_EQUALITY(MILLISECONDS) : 0.019927 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.035113 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 139 #UNFREEZE : 0 #CONJOIN : 139 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 199 LocStat_NO_SUPPORTING_DISEQUALITIES : 29 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.514746 RENAME_VARIABLES(MILLISECONDS) : 0.104657 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.209893 PROJECTAWAY(MILLISECONDS) : 0.039557 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001340 DISJOIN(MILLISECONDS) : 0.287514 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.129720 ADD_EQUALITY(MILLISECONDS) : 0.022366 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011819 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 119 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (123states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 56. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 66.0s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 986 SDtfs, 685 SDslu, 4645 SDs, 0 SdLazy, 1841 SolverSat, 157 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1694 GetRequests, 1403 SyntacticMatches, 44 SemanticMatches, 246 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2317 ImplicationChecksByTransitivity, 52.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 123 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2049 ConstructedInterpolants, 144 QuantifiedInterpolants, 761468 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2440 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 47 InterpolantComputations, 9 PerfectInterpolantSequences, 938/2315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-18-20-626.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-18-20-626.csv Completed graceful shutdown