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_Array.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:24:36,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:24:36,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:24:36,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:24:36,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:24:36,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:24:36,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:24:36,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:24:36,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:24:36,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:24:36,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:24:36,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:24:36,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:24:36,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:24:36,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:24:36,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:24:36,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:24:36,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:24:36,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:24:36,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:24:36,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:24:36,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:24:36,567 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:24:36,568 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:24:36,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:24:36,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:24:36,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:24:36,570 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:24:36,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:24:36,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:24:36,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:24:36,571 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_Array.epf [2018-02-02 10:24:36,581 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:24:36,581 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:24:36,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:24:36,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:24:36,583 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:24:36,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:24:36,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:24:36,583 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:24:36,583 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:24:36,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:24:36,584 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:24:36,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:24:36,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:24:36,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:24:36,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:24:36,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:24:36,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:24:36,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:24:36,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:24:36,625 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:24:36,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:24:36,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:24:36,629 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:24:36,629 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:24:36,782 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:24:36,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:24:36,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:36,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:24:36,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:24:36,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36, skipping insertion in model container [2018-02-02 10:24:36,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,800 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:36,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:24:36,923 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:36,934 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:24:36,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36 WrapperNode [2018-02-02 10:24:36,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:24:36,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:24:36,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:24:36,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:24:36,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (1/1) ... [2018-02-02 10:24:36,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:24:36,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:24:36,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:24:36,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:24:36,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (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:24:37,001 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:24:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:24:37,002 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:24:37,002 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:24:37,002 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:24:37,002 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:24:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:24:37,095 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:24:37,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:37 BoogieIcfgContainer [2018-02-02 10:24:37,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:24:37,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:24:37,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:24:37,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:24:37,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:24:36" (1/3) ... [2018-02-02 10:24:37,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff35516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:37, skipping insertion in model container [2018-02-02 10:24:37,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:36" (2/3) ... [2018-02-02 10:24:37,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff35516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:37, skipping insertion in model container [2018-02-02 10:24:37,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:37" (3/3) ... [2018-02-02 10:24:37,101 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test8_true-valid-memsafety_true-termination.i [2018-02-02 10:24:37,106 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:24:37,112 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:24:37,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:24:37,134 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:24:37,134 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:24:37,134 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:24:37,135 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:24:37,135 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:24:37,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:24:37,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:24:37,136 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:24:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-02 10:24:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:24:37,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,151 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:24:37,151 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash 132716426, now seen corresponding path program 1 times [2018-02-02 10:24:37,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,303 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:24:37,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:24:37,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,307 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:24:37,307 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:24:37,307 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:24:37,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:37,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:37,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:37,321 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-02-02 10:24:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:37,458 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 10:24:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:37,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:24:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:37,466 INFO L225 Difference]: With dead ends: 41 [2018-02-02 10:24:37,466 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:24:37,467 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:24:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:24:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 10:24:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:24:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-02 10:24:37,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-02-02 10:24:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:37,496 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-02 10:24:37,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-02 10:24:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:24:37,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,497 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:24:37,497 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 132716427, now seen corresponding path program 1 times [2018-02-02 10:24:37,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,549 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:24:37,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:24:37,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,550 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:24:37,551 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:24:37,551 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:24:37,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:24:37,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:24:37,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:24:37,553 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-02-02 10:24:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:37,634 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 10:24:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:24:37,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:24:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:37,636 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:24:37,636 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:24:37,637 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:24:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:24:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 10:24:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 10:24:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 10:24:37,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-02-02 10:24:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:37,644 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 10:24:37,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:24:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 10:24:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:24:37,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,645 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:24:37,645 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806264, now seen corresponding path program 1 times [2018-02-02 10:24:37,647 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,714 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:24:37,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:37,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,715 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:24:37,715 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:24:37,715 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:24:37,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:37,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:37,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:37,716 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-02-02 10:24:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:37,759 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 10:24:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:37,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:24:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:37,760 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:24:37,760 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:24:37,760 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:24:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:24:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 10:24:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:24:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 10:24:37,764 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-02-02 10:24:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:37,764 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 10:24:37,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 10:24:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:24:37,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,764 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:24:37,765 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806263, now seen corresponding path program 1 times [2018-02-02 10:24:37,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,819 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:24:37,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:24:37,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,820 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:24:37,820 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:24:37,820 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:24:37,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:37,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:37,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:37,822 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-02 10:24:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:37,868 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-02 10:24:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:37,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 10:24:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:37,870 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:24:37,870 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:24:37,870 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:24:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:24:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-02 10:24:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:24:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 10:24:37,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2018-02-02 10:24:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:37,873 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 10:24:37,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 10:24:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:24:37,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,873 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:24:37,874 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1070854066, now seen corresponding path program 1 times [2018-02-02 10:24:37,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,904 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:24:37,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:24:37,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,905 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:24:37,905 INFO L182 omatonBuilderFactory]: Interpolants [375#true, 376#false, 377#(= |#valid| |old(#valid)|)] [2018-02-02 10:24:37,905 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:24:37,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:24:37,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:24:37,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:24:37,906 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2018-02-02 10:24:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:37,923 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 10:24:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:24:37,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 10:24:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:37,924 INFO L225 Difference]: With dead ends: 39 [2018-02-02 10:24:37,924 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:24:37,925 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:24:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:24:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 10:24:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 10:24:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-02 10:24:37,930 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2018-02-02 10:24:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:37,930 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-02 10:24:37,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:24:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-02 10:24:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:24:37,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:37,931 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:24:37,931 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash -980957032, now seen corresponding path program 1 times [2018-02-02 10:24:37,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:37,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:37,974 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:24:37,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:37,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:24:37,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:37,979 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:24:37,979 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:24:37,979 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:24:37,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:24:37,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:24:37,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:24:37,979 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-02 10:24:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:38,026 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-02-02 10:24:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:24:38,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:24:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:38,027 INFO L225 Difference]: With dead ends: 37 [2018-02-02 10:24:38,027 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:24:38,027 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:24:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:24:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-02-02 10:24:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:24:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-02 10:24:38,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-02-02 10:24:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:38,029 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-02 10:24:38,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:24:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-02 10:24:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:24:38,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:38,030 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:24:38,030 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1127655280, now seen corresponding path program 1 times [2018-02-02 10:24:38,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:38,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:38,080 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:24:38,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:38,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:24:38,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:38,080 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:24:38,081 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:24:38,081 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:24:38,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:24:38,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:24:38,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:24:38,081 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-02-02 10:24:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:38,119 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-02 10:24:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:24:38,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:24:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:38,120 INFO L225 Difference]: With dead ends: 27 [2018-02-02 10:24:38,121 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 10:24:38,121 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:24:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 10:24:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-02 10:24:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:24:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-02-02 10:24:38,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 25 [2018-02-02 10:24:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:38,124 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-02-02 10:24:38,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:24:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-02-02 10:24:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:24:38,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:38,125 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:24:38,125 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:24:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1553172630, now seen corresponding path program 1 times [2018-02-02 10:24:38,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:38,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:38,249 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:24:38,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:38,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:24:38,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:38,249 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:24:38,249 INFO L182 omatonBuilderFactory]: Interpolants [593#true, 594#false, 595#(= |#valid| |old(#valid)|), 596#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 597#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 598#(and (= 0 (select |old(#valid)| |alloc_8_#t~ret2.base|)) (not (= 0 |alloc_8_#t~ret2.base|)) (= (store |#valid| |alloc_8_#t~ret2.base| (select |old(#valid)| |alloc_8_#t~ret2.base|)) |old(#valid)|)), 599#(and (= (store |#valid| ~a8.base (select |old(#valid)| ~a8.base)) |old(#valid)|) (not (= 0 ~a8.base)) (= 0 (select |old(#valid)| ~a8.base))), 600#(= (store (store |#valid| ~a8.base 0) ~a8.base (select |old(#valid)| ~a8.base)) |old(#valid)|), 601#(or (= 0 ~a8.base) (= |#valid| (store |old(#valid)| ~a8.base 0)))] [2018-02-02 10:24:38,250 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:24:38,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:24:38,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:24:38,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:24:38,250 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 9 states. [2018-02-02 10:24:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:38,418 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2018-02-02 10:24:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:24:38,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 10:24:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:38,418 INFO L225 Difference]: With dead ends: 26 [2018-02-02 10:24:38,418 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:24:38,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:24:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:24:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:24:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:24:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:24:38,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-02-02 10:24:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:38,419 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:24:38,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:24:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:24:38,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:24:38,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:38 BoogieIcfgContainer [2018-02-02 10:24:38,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:24:38,423 INFO L168 Benchmark]: Toolchain (without parser) took 1640.04 ms. Allocated memory was 410.0 MB in the beginning and 640.2 MB in the end (delta: 230.2 MB). Free memory was 366.9 MB in the beginning and 609.5 MB in the end (delta: -242.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:38,423 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 410.0 MB. Free memory is still 373.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:38,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.67 ms. Allocated memory is still 410.0 MB. Free memory was 366.9 MB in the beginning and 355.0 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:24:38,424 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 410.0 MB. Free memory was 353.6 MB in the beginning and 352.3 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:24:38,424 INFO L168 Benchmark]: RCFGBuilder took 129.98 ms. Allocated memory is still 410.0 MB. Free memory was 352.3 MB in the beginning and 338.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:38,424 INFO L168 Benchmark]: TraceAbstraction took 1326.04 ms. Allocated memory was 410.0 MB in the beginning and 640.2 MB in the end (delta: 230.2 MB). Free memory was 338.3 MB in the beginning and 609.5 MB in the end (delta: -271.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:38,424 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.12 ms. Allocated memory is still 410.0 MB. Free memory is still 373.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.67 ms. Allocated memory is still 410.0 MB. Free memory was 366.9 MB in the beginning and 355.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.62 ms. Allocated memory is still 410.0 MB. Free memory was 353.6 MB in the beginning and 352.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 129.98 ms. Allocated memory is still 410.0 MB. Free memory was 352.3 MB in the beginning and 338.3 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1326.04 ms. Allocated memory was 410.0 MB in the beginning and 640.2 MB in the end (delta: 230.2 MB). Free memory was 338.3 MB in the beginning and 609.5 MB in the end (delta: -271.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1450]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 32 locations, 3 error locations. SAFE Result, 1.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 131 SDslu, 486 SDs, 0 SdLazy, 274 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 12081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! 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_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-24-38-429.csv 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_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-24-38-429.csv Received shutdown request...