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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:37:41,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:37:41,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:37:41,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:37:41,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:37:41,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:37:41,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:37:41,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:37:41,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:37:41,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:37:41,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:37:41,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:37:41,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:37:41,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:37:41,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:37:41,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:37:41,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:37:41,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:37:41,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:37:41,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:37:41,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:37:41,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:37:41,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:37:41,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:37:41,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:37:41,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:37:41,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:37:41,199 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:37:41,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:37:41,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:37:41,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:37:41,200 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:37:41,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:37:41,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:37:41,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:37:41,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:37:41,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:37:41,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:37:41,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:37:41,211 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:37:41,212 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:37:41,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:37:41,212 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:37:41,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:37:41,254 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:37:41,258 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:37:41,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:37:41,260 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:37:41,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_false-valid-free.i [2018-02-04 18:37:41,410 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:37:41,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:37:41,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:37:41,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:37:41,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:37:41,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe43571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41, skipping insertion in model container [2018-02-04 18:37:41,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,437 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:37:41,465 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:37:41,555 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:37:41,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:37:41,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41 WrapperNode [2018-02-04 18:37:41,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:37:41,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:37:41,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:37:41,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:37:41,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... [2018-02-04 18:37:41,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:37:41,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:37:41,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:37:41,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:37:41,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 18:37:41,660 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:37:41,660 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:37:41,660 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:37:41,660 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:37:41,660 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:37:41,660 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:37:41,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:37:41,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:37:41,813 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:37:41,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:37:41 BoogieIcfgContainer [2018-02-04 18:37:41,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:37:41,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:37:41,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:37:41,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:37:41,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:37:41" (1/3) ... [2018-02-04 18:37:41,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4995d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:37:41, skipping insertion in model container [2018-02-04 18:37:41,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:37:41" (2/3) ... [2018-02-04 18:37:41,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4995d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:37:41, skipping insertion in model container [2018-02-04 18:37:41,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:37:41" (3/3) ... [2018-02-04 18:37:41,818 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0158_1_false-valid-free.i [2018-02-04 18:37:41,826 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:37:41,834 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 18:37:41,862 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:37:41,862 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:37:41,862 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:37:41,862 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:37:41,863 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:37:41,863 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:37:41,863 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:37:41,863 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:37:41,864 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:37:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 18:37:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:37:41,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:41,891 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:41,891 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:41,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1472020876, now seen corresponding path program 1 times [2018-02-04 18:37:41,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:41,897 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:41,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:41,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:41,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:41,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:41,997 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:41,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:41,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:41,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:42,069 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-02-04 18:37:42,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:37:42,098 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-02-04 18:37:42,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,103 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-02-04 18:37:42,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:37:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:42,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:42,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:37:42,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:37:42,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:37:42,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:37:42,174 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 18:37:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:42,238 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 18:37:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:37:42,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 18:37:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:42,247 INFO L225 Difference]: With dead ends: 39 [2018-02-04 18:37:42,247 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 18:37:42,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:37:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 18:37:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 18:37:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 18:37:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-02-04 18:37:42,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 8 [2018-02-04 18:37:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:42,297 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-02-04 18:37:42,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:37:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-02-04 18:37:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:37:42,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:42,298 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:42,298 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1472020877, now seen corresponding path program 1 times [2018-02-04 18:37:42,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:42,298 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:42,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:42,319 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:42,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:42,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:42,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:42,335 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-02-04 18:37:42,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:37:42,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:42,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 18:37:42,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:37:42,402 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 2 xjuncts. [2018-02-04 18:37:42,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2018-02-04 18:37:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:42,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:42,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:37:42,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:37:42,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:37:42,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:37:42,453 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 4 states. [2018-02-04 18:37:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:42,501 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 18:37:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:37:42,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:37:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:42,502 INFO L225 Difference]: With dead ends: 29 [2018-02-04 18:37:42,502 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 18:37:42,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:37:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 18:37:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 18:37:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 18:37:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 18:37:42,506 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 8 [2018-02-04 18:37:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:42,506 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 18:37:42,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:37:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 18:37:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:37:42,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:42,507 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:42,507 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -151822659, now seen corresponding path program 1 times [2018-02-04 18:37:42,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:42,507 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:42,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,508 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:42,528 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:42,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:42,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:42,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:42,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:37:42,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:37:42,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 18:37:42,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 18:37:42,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:42,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 18:37:42,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:7 [2018-02-04 18:37:42,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 18:37:42,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 18:37:42,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-04 18:37:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:42,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:42,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:37:42,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:37:42,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:37:42,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:37:42,621 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-02-04 18:37:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:42,661 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-04 18:37:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:37:42,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 18:37:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:42,663 INFO L225 Difference]: With dead ends: 28 [2018-02-04 18:37:42,663 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 18:37:42,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:37:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 18:37:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 18:37:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 18:37:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 18:37:42,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 16 [2018-02-04 18:37:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:42,666 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 18:37:42,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:37:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 18:37:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 18:37:42,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:42,667 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:42,667 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:42,667 INFO L82 PathProgramCache]: Analyzing trace with hash -151822658, now seen corresponding path program 1 times [2018-02-04 18:37:42,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:42,667 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:42,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:42,689 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:42,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:42,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:42,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:42,731 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-02-04 18:37:42,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:37:42,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:37:42,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:37:42,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 18:37:42,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-02-04 18:37:42,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:42,753 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 24 treesize of output 16 [2018-02-04 18:37:42,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:9 [2018-02-04 18:37:42,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 18:37:42,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 18:37:42,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:42,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-02-04 18:37:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:42,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:42,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 18:37:42,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:37:42,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:37:42,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:37:42,784 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2018-02-04 18:37:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:42,833 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-02-04 18:37:42,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:37:42,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 18:37:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:42,834 INFO L225 Difference]: With dead ends: 27 [2018-02-04 18:37:42,834 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 18:37:42,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:37:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 18:37:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 18:37:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 18:37:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 18:37:42,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-02-04 18:37:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:42,836 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 18:37:42,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:37:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 18:37:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:37:42,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:42,838 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:42,838 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 127313054, now seen corresponding path program 1 times [2018-02-04 18:37:42,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:42,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:42,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:42,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:42,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:37:42,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:37:42,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:37:42,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:37:42,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:37:42,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:37:42,922 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-02-04 18:37:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:42,994 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 18:37:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:37:42,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 18:37:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:42,995 INFO L225 Difference]: With dead ends: 26 [2018-02-04 18:37:42,995 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 18:37:42,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:37:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 18:37:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 18:37:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 18:37:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 18:37:42,998 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-02-04 18:37:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:42,998 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 18:37:42,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:37:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 18:37:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:37:42,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:42,999 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:42,999 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 18:37:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 127313055, now seen corresponding path program 1 times [2018-02-04 18:37:43,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:43,000 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:43,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:43,001 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:37:43,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:37:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 18:37:43,045 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 18:37:43,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:37:43 BoogieIcfgContainer [2018-02-04 18:37:43,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:37:43,063 INFO L168 Benchmark]: Toolchain (without parser) took 1652.74 ms. Allocated memory was 413.1 MB in the beginning and 628.6 MB in the end (delta: 215.5 MB). Free memory was 370.0 MB in the beginning and 497.8 MB in the end (delta: -127.8 MB). Peak memory consumption was 87.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:43,065 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 413.1 MB. Free memory is still 376.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:37:43,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.25 ms. Allocated memory is still 413.1 MB. Free memory was 370.0 MB in the beginning and 359.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:43,065 INFO L168 Benchmark]: Boogie Preprocessor took 31.59 ms. Allocated memory is still 413.1 MB. Free memory was 359.3 MB in the beginning and 358.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:43,065 INFO L168 Benchmark]: RCFGBuilder took 199.74 ms. Allocated memory is still 413.1 MB. Free memory was 358.0 MB in the beginning and 338.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:43,065 INFO L168 Benchmark]: TraceAbstraction took 1248.84 ms. Allocated memory was 413.1 MB in the beginning and 628.6 MB in the end (delta: 215.5 MB). Free memory was 338.6 MB in the beginning and 497.8 MB in the end (delta: -159.1 MB). Peak memory consumption was 56.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:43,067 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.17 ms. Allocated memory is still 413.1 MB. Free memory is still 376.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.25 ms. Allocated memory is still 413.1 MB. Free memory was 370.0 MB in the beginning and 359.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.59 ms. Allocated memory is still 413.1 MB. Free memory was 359.3 MB in the beginning and 358.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 199.74 ms. Allocated memory is still 413.1 MB. Free memory was 358.0 MB in the beginning and 338.6 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1248.84 ms. Allocated memory was 413.1 MB in the beginning and 628.6 MB in the end (delta: 215.5 MB). Free memory was 338.6 MB in the beginning and 497.8 MB in the end (delta: -159.1 MB). Peak memory consumption was 56.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L622-L629] FCALL union { void *p0; struct { char c[2]; int p1; int p2; } str; } data; VAL [data={41:0}] [L630] EXPR, FCALL malloc(37U) VAL [data={41:0}, malloc(37U)={42:0}] [L630] FCALL data.p0 = malloc(37U) VAL [data={41:0}, malloc(37U)={42:0}] [L631] EXPR, FCALL data.p0 VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}] [L631] void *ptr = data.p0; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L635] FCALL data.str.p2 = 30 VAL [data={41:0}, malloc(37U)={42:0}, ptr={42:0}] [L637] EXPR, FCALL data.str.p2 VAL [data={41:0}, data.str.p2=30, malloc(37U)={42:0}, ptr={42:0}] [L637] COND FALSE !(25 > data.str.p2) [L640] EXPR, FCALL data.p0 VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}, ptr={42:0}] [L640] FCALL free(data.p0) VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}, ptr={42:0}] [L641] FCALL free(ptr) VAL [data={41:0}, malloc(37U)={42:0}, ptr={42:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 19 error locations. UNSAFE Result, 1.2s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 129 SDslu, 120 SDs, 0 SdLazy, 129 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 61 ConstructedInterpolants, 1 QuantifiedInterpolants, 3821 SizeOfPredicates, 10 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-37-43-074.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-37-43-074.csv Received shutdown request...