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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:46,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:46,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:46,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:46,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:46,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:46,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:46,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:46,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:46,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:46,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:46,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:46,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:46,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:46,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:46,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:46,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:46,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:46,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:46,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:46,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:46,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:46,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:46,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:46,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:46,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:46,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:46,182 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:46,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:46,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:46,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:46,183 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:48:46,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:46,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:46,194 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:46,194 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:46,194 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:46,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:46,195 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:46,196 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:46,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:46,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:46,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:46,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:46,199 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:46,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:46,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:46,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:46,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:46,201 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:46,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:46,243 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:46,246 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:46,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:46,248 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:46,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i [2018-02-02 10:48:46,399 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:46,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:46,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:46,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:46,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:46,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46, skipping insertion in model container [2018-02-02 10:48:46,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,423 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:46,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:46,540 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:46,552 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:46,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46 WrapperNode [2018-02-02 10:48:46,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:46,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:46,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:46,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:46,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (1/1) ... [2018-02-02 10:48:46,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:46,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:46,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:46,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:46,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (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-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-02-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-02-02 10:48:46,624 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:46,625 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:46,625 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-02-02 10:48:46,626 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-02-02 10:48:46,626 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:46,626 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:46,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:46,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:46,724 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:46,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:46 BoogieIcfgContainer [2018-02-02 10:48:46,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:46,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:46,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:46,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:46,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:46" (1/3) ... [2018-02-02 10:48:46,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc89e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:46, skipping insertion in model container [2018-02-02 10:48:46,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:46" (2/3) ... [2018-02-02 10:48:46,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc89e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:46, skipping insertion in model container [2018-02-02 10:48:46,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:46" (3/3) ... [2018-02-02 10:48:46,729 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test8_true-valid-memsafety_true-termination.i [2018-02-02 10:48:46,735 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:46,739 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:48:46,769 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:46,769 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:46,769 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:46,769 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:46,769 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:46,769 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:46,769 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:46,769 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:46,770 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-02 10:48:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:48:46,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:46,786 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-02 10:48:46,786 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 132716426, now seen corresponding path program 1 times [2018-02-02 10:48:46,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:46,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:46,945 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-02 10:48:46,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:46,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:46,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:46,948 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 37#(= 0 |ldv_malloc_#res.offset|), 38#(= 0 |alloc_8_#t~ret2.offset|), 39#(= ~a8.offset 0)] [2018-02-02 10:48:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:46,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:46,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:46,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:46,959 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-02-02 10:48:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,087 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 10:48:47,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:47,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:48:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,095 INFO L225 Difference]: With dead ends: 41 [2018-02-02 10:48:47,095 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:48:47,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:48:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 10:48:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:48:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-02 10:48:47,129 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-02-02 10:48:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,130 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-02 10:48:47,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-02 10:48:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:48:47,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,131 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-02 10:48:47,131 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 132716427, now seen corresponding path program 1 times [2018-02-02 10:48:47,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,187 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-02 10:48:47,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:47,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,188 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-02 10:48:47,189 INFO L182 omatonBuilderFactory]: Interpolants [122#true, 123#false, 124#(= 0 |ldv_malloc_#res.base|), 125#(= 0 |alloc_8_#t~ret2.base|), 126#(= 0 ~a8.base)] [2018-02-02 10:48:47,189 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-02 10:48:47,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:47,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:47,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:47,191 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-02-02 10:48:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,241 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 10:48:47,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:47,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:48:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,243 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:48:47,243 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:48:47,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:48:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 10:48:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 10:48:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 10:48:47,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-02 10:48:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,250 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 10:48:47,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 10:48:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:47,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,251 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,252 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806264, now seen corresponding path program 1 times [2018-02-02 10:48:47,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,311 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-02 10:48:47,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:47,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,311 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-02 10:48:47,311 INFO L182 omatonBuilderFactory]: Interpolants [210#true, 211#false, 212#(= 0 |ldv_malloc_#t~malloc1.offset|), 213#(= 0 |ldv_malloc_#res.offset|), 214#(= 0 |alloc_8_#t~ret2.offset|), 215#(= ~a8.offset 0)] [2018-02-02 10:48:47,311 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-02 10:48:47,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:47,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:47,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:47,312 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-02-02 10:48:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,342 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 10:48:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:47,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:48:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,343 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:48:47,343 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:48:47,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:48:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 10:48:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:48:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 10:48:47,347 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-02-02 10:48:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,348 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 10:48:47,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 10:48:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:47,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,348 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,348 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806263, now seen corresponding path program 1 times [2018-02-02 10:48:47,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,401 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-02 10:48:47,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:47,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,401 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-02 10:48:47,401 INFO L182 omatonBuilderFactory]: Interpolants [304#(= 1 (select |#valid| |alloc_8_#t~ret2.base|)), 305#(= 1 (select |#valid| ~a8.base)), 300#true, 301#false, 302#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 303#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:48:47,402 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-02 10:48:47,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:47,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:47,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:47,402 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-02 10:48:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,454 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-02 10:48:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:47,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:48:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,454 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:48:47,455 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:48:47,455 INFO L554 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-02-02 10:48:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:48:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-02 10:48:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:48:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 10:48:47,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2018-02-02 10:48:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,459 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 10:48:47,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 10:48:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:47,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,460 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1070854066, now seen corresponding path program 1 times [2018-02-02 10:48:47,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,501 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-02 10:48:47,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:47,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,502 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-02 10:48:47,502 INFO L182 omatonBuilderFactory]: Interpolants [375#true, 376#false, 377#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:47,503 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-02 10:48:47,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:47,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:47,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:47,503 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2018-02-02 10:48:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,524 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 10:48:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:47,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 10:48:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,525 INFO L225 Difference]: With dead ends: 39 [2018-02-02 10:48:47,525 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:48:47,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-02-02 10:48:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:48:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 10:48:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 10:48:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-02 10:48:47,532 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2018-02-02 10:48:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,532 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-02 10:48:47,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-02 10:48:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:48:47,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,533 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,533 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash -980957032, now seen corresponding path program 1 times [2018-02-02 10:48:47,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,590 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-02 10:48:47,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:47,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,591 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-02 10:48:47,591 INFO L182 omatonBuilderFactory]: Interpolants [452#true, 453#false, 454#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 455#(and (= 0 |alloc_8_#t~ret2.base|) (= 0 |alloc_8_#t~ret2.offset|)), 456#(and (= ~a8.offset 0) (= 0 ~a8.base)), 457#(or (not (= 0 ~a8.base)) (not (= ~a8.offset 0)))] [2018-02-02 10:48:47,591 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-02 10:48:47,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:47,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:47,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:47,592 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-02 10:48:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,659 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-02-02 10:48:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:47,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:48:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,661 INFO L225 Difference]: With dead ends: 37 [2018-02-02 10:48:47,661 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:48:47,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:48:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-02-02 10:48:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:48:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-02 10:48:47,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-02-02 10:48:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,664 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-02 10:48:47,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-02 10:48:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:47,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,665 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,665 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1127655280, now seen corresponding path program 1 times [2018-02-02 10:48:47,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,710 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-02 10:48:47,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:47,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:47,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:47,711 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-02 10:48:47,712 INFO L182 omatonBuilderFactory]: Interpolants [528#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 529#(not (= 0 |ldv_malloc_#res.base|)), 530#(not (= 0 |alloc_8_#t~ret2.base|)), 531#(not (= 0 ~a8.base)), 532#(= 0 ~a8.base), 526#true, 527#false] [2018-02-02 10:48:47,712 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-02 10:48:47,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:47,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:47,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:47,712 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-02-02 10:48:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:47,763 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-02 10:48:47,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:47,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:48:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:47,764 INFO L225 Difference]: With dead ends: 27 [2018-02-02 10:48:47,764 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 10:48:47,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 10:48:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-02 10:48:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:48:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-02-02 10:48:47,766 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 25 [2018-02-02 10:48:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:47,766 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-02-02 10:48:47,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-02-02 10:48:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:48:47,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:47,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:47,767 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:48:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1553172630, now seen corresponding path program 1 times [2018-02-02 10:48:47,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:47,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:47,789 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:48:47,792 INFO L168 Benchmark]: Toolchain (without parser) took 1392.86 ms. Allocated memory was 400.6 MB in the beginning and 608.7 MB in the end (delta: 208.1 MB). Free memory was 357.3 MB in the beginning and 471.6 MB in the end (delta: -114.3 MB). Peak memory consumption was 93.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:47,793 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 400.6 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:47,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.14 ms. Allocated memory is still 400.6 MB. Free memory was 357.3 MB in the beginning and 345.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:47,794 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:47,794 INFO L168 Benchmark]: RCFGBuilder took 138.45 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 328.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:47,794 INFO L168 Benchmark]: TraceAbstraction took 1066.49 ms. Allocated memory was 400.6 MB in the beginning and 608.7 MB in the end (delta: 208.1 MB). Free memory was 328.2 MB in the beginning and 471.6 MB in the end (delta: -143.4 MB). Peak memory consumption was 64.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:47,795 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 400.6 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.14 ms. Allocated memory is still 400.6 MB. Free memory was 357.3 MB in the beginning and 345.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.49 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 138.45 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 328.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1066.49 ms. Allocated memory was 400.6 MB in the beginning and 608.7 MB in the end (delta: 208.1 MB). Free memory was 328.2 MB in the beginning and 471.6 MB in the end (delta: -143.4 MB). Peak memory consumption was 64.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-47-800.csv Received shutdown request...