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_test3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:36,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:36,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:36,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:36,550 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:36,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:36,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:36,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:36,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:36,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:36,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:36,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:36,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:36,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:36,557 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:36,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:36,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:36,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:36,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:36,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:36,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:36,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:36,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:36,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:36,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:36,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:36,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:36,570 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:36,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:36,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:36,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48: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_NoArray.epf [2018-02-02 10:48:36,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:36,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:36,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:36,581 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:36,582 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:36,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:36,582 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:36,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:36,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:36,583 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:36,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:36,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:36,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:36,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:36,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:36,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:36,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:36,585 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:36,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:36,624 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:36,627 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:36,628 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:36,629 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48: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_test3_true-valid-memsafety_true-termination.i [2018-02-02 10:48:36,769 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:36,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:36,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:36,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:36,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:36,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:36" (1/1) ... [2018-02-02 10:48:36,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d135a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:36, skipping insertion in model container [2018-02-02 10:48:36,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:36" (1/1) ... [2018-02-02 10:48:36,789 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:36,833 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:36,920 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:36,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:36,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:36 WrapperNode [2018-02-02 10:48:36,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:36,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:36,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:36,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:36,946 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:36" (1/1) ... [2018-02-02 10:48:36,946 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:36" (1/1) ... [2018-02-02 10:48:36,956 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:36" (1/1) ... [2018-02-02 10:48:36,956 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:36" (1/1) ... [2018-02-02 10:48:36,958 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:36" (1/1) ... [2018-02-02 10:48:36,960 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:36" (1/1) ... [2018-02-02 10:48:36,961 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:36" (1/1) ... [2018-02-02 10:48:36,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:36,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:36,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:36,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:36,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48: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:48:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure h_safe [2018-02-02 10:48:37,002 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:37,003 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:37,003 INFO L128 BoogieDeclarations]: Found specification of procedure h_safe [2018-02-02 10:48:37,004 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:37,004 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:37,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:37,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:37,098 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:37,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:37 BoogieIcfgContainer [2018-02-02 10:48:37,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:37,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:37,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:37,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:37,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:36" (1/3) ... [2018-02-02 10:48:37,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d16b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:37, skipping insertion in model container [2018-02-02 10:48:37,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:36" (2/3) ... [2018-02-02 10:48:37,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d16b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:37, skipping insertion in model container [2018-02-02 10:48:37,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:37" (3/3) ... [2018-02-02 10:48:37,103 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test3_true-valid-memsafety_true-termination.i [2018-02-02 10:48:37,108 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:37,112 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:48:37,135 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:37,135 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:37,136 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:37,136 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:37,136 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:37,136 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:37,136 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:37,136 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:37,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-02 10:48:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:48:37,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,154 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:37,154 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash -36513995, now seen corresponding path program 1 times [2018-02-02 10:48:37,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48: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:48:37,324 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:37,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:37,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,327 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:37,327 INFO L182 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(= 0 |ldv_malloc_#res.offset|), 35#(= 0 |h_safe_#t~ret2.offset|), 36#(= 0 |h_safe_#res.offset|), 37#(= 0 |entry_point_#t~ret3.offset|), 38#(= 0 entry_point_~p~0.offset)] [2018-02-02 10:48:37,327 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:37,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:37,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:37,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:37,344 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-02-02 10:48:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,394 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-02-02 10:48:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:37,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 10:48:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,452 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:48:37,452 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:48:37,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:48:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-02 10:48:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:48:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-02 10:48:37,481 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2018-02-02 10:48:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,481 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-02 10:48:37,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-02 10:48:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:48:37,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,482 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:37,482 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash -36513994, now seen corresponding path program 1 times [2018-02-02 10:48:37,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,494 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:37,539 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:37,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:37,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,539 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:37,540 INFO L182 omatonBuilderFactory]: Interpolants [112#false, 113#(= 0 |ldv_malloc_#res.base|), 114#(= 0 |h_safe_#t~ret2.base|), 115#(= 0 |h_safe_#res.base|), 116#(= 0 |entry_point_#t~ret3.base|), 117#(= 0 entry_point_~p~0.base), 111#true] [2018-02-02 10:48:37,540 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:37,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:37,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:37,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:37,541 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2018-02-02 10:48:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,591 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-02 10:48:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:37,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 10:48:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,593 INFO L225 Difference]: With dead ends: 36 [2018-02-02 10:48:37,594 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:48:37,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:48:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-02-02 10:48:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:48:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-02 10:48:37,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-02 10:48:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,599 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-02 10:48:37,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-02 10:48:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:37,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,600 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:37,600 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash 133826739, now seen corresponding path program 1 times [2018-02-02 10:48:37,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,616 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:37,683 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:37,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:37,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,684 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:37,684 INFO L182 omatonBuilderFactory]: Interpolants [192#(= 0 |h_safe_#t~ret2.offset|), 193#(= 0 |h_safe_#res.offset|), 194#(= 0 |entry_point_#t~ret3.offset|), 195#(= 0 entry_point_~p~0.offset), 188#true, 189#false, 190#(= 0 |ldv_malloc_#t~malloc1.offset|), 191#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:48:37,684 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:37,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:37,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:37,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:37,685 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-02 10:48:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,727 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-02 10:48:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:37,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 10:48:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,729 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:48:37,729 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 10:48:37,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 10:48:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 10:48:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:48:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-02-02 10:48:37,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2018-02-02 10:48:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,733 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-02-02 10:48:37,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-02-02 10:48:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:37,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,734 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:37,734 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 133826740, now seen corresponding path program 1 times [2018-02-02 10:48:37,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,746 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:37,803 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:37,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:37,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,804 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:37,804 INFO L182 omatonBuilderFactory]: Interpolants [264#true, 265#false, 266#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 267#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 268#(= 1 (select |#valid| |h_safe_#t~ret2.base|)), 269#(= 1 (select |#valid| |h_safe_#res.base|)), 270#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 271#(= 1 (select |#valid| entry_point_~p~0.base))] [2018-02-02 10:48:37,804 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:37,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:37,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:37,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:37,805 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2018-02-02 10:48:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,883 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-02 10:48:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:37,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 10:48:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,884 INFO L225 Difference]: With dead ends: 34 [2018-02-02 10:48:37,884 INFO L226 Difference]: Without dead ends: 34 [2018-02-02 10:48:37,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-02 10:48:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-02-02 10:48:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:48:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-02 10:48:37,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-02-02 10:48:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,890 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-02 10:48:37,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-02 10:48:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:37,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,891 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:37,891 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -730055936, now seen corresponding path program 1 times [2018-02-02 10:48:37,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,902 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:37,941 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:37,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:37,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,942 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:37,942 INFO L182 omatonBuilderFactory]: Interpolants [332#true, 333#false, 334#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:37,942 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:37,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:37,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:37,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:37,942 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-02-02 10:48:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,966 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-02-02 10:48:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:37,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 10:48:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,967 INFO L225 Difference]: With dead ends: 35 [2018-02-02 10:48:37,967 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:48:37,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:48:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-02 10:48:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 10:48:37,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2018-02-02 10:48:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,970 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 10:48:37,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 10:48:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:48:37,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,971 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] [2018-02-02 10:48:37,971 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:37,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1161698987, now seen corresponding path program 1 times [2018-02-02 10:48:37,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,979 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:38,027 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:38,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:38,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:38,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:38,028 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:38,028 INFO L182 omatonBuilderFactory]: Interpolants [401#true, 402#false, 403#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 404#(and (= 0 |h_safe_#t~ret2.offset|) (= 0 |h_safe_#t~ret2.base|)), 405#(and (= 0 |h_safe_#res.offset|) (= 0 |h_safe_#res.base|)), 406#(and (= 0 |entry_point_#t~ret3.offset|) (= 0 |entry_point_#t~ret3.base|)), 407#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:48:38,028 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:38,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:38,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:38,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:38,029 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 7 states. [2018-02-02 10:48:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:38,040 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-02 10:48:38,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:38,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:48:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:38,041 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:48:38,041 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 10:48:38,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 10:48:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-02-02 10:48:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:48:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-02 10:48:38,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-02-02 10:48:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:38,044 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-02 10:48:38,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-02 10:48:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:48:38,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:38,045 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] [2018-02-02 10:48:38,045 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:38,045 INFO L82 PathProgramCache]: Analyzing trace with hash -241367810, now seen corresponding path program 1 times [2018-02-02 10:48:38,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:38,054 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:38,093 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:38,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:38,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:38,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:38,094 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:38,094 INFO L182 omatonBuilderFactory]: Interpolants [465#true, 466#false, 467#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 468#(not (= 0 |ldv_malloc_#res.base|)), 469#(not (= 0 |h_safe_#t~ret2.base|)), 470#(not (= 0 |h_safe_#res.base|)), 471#(not (= 0 |entry_point_#t~ret3.base|)), 472#(not (= 0 entry_point_~p~0.base))] [2018-02-02 10:48:38,094 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:38,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:38,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:38,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:38,095 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-02-02 10:48:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:38,120 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-02-02 10:48:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:38,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 10:48:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:38,120 INFO L225 Difference]: With dead ends: 24 [2018-02-02 10:48:38,120 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 10:48:38,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 10:48:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 10:48:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:48:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-02-02 10:48:38,124 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2018-02-02 10:48:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:38,124 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-02-02 10:48:38,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-02-02 10:48:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:38,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:38,124 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:38,124 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:48:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1102731031, now seen corresponding path program 1 times [2018-02-02 10:48:38,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:38,135 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:38,142 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:38,146 INFO L168 Benchmark]: Toolchain (without parser) took 1376.08 ms. Allocated memory was 408.4 MB in the beginning and 620.2 MB in the end (delta: 211.8 MB). Free memory was 365.3 MB in the beginning and 494.0 MB in the end (delta: -128.7 MB). Peak memory consumption was 83.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:38,147 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 408.4 MB. Free memory is still 370.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:38,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.25 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 352.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:38,147 INFO L168 Benchmark]: Boogie Preprocessor took 27.59 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 349.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:38,147 INFO L168 Benchmark]: RCFGBuilder took 135.60 ms. Allocated memory is still 408.4 MB. Free memory was 349.4 MB in the beginning and 335.4 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:48:38,147 INFO L168 Benchmark]: TraceAbstraction took 1045.98 ms. Allocated memory was 408.4 MB in the beginning and 620.2 MB in the end (delta: 211.8 MB). Free memory was 335.4 MB in the beginning and 494.0 MB in the end (delta: -158.6 MB). Peak memory consumption was 53.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:38,149 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.11 ms. Allocated memory is still 408.4 MB. Free memory is still 370.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.25 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 352.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.59 ms. Allocated memory is still 408.4 MB. Free memory was 352.1 MB in the beginning and 349.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 135.60 ms. Allocated memory is still 408.4 MB. Free memory was 349.4 MB in the beginning and 335.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1045.98 ms. Allocated memory was 408.4 MB in the beginning and 620.2 MB in the end (delta: 211.8 MB). Free memory was 335.4 MB in the beginning and 494.0 MB in the end (delta: -158.6 MB). Peak memory consumption was 53.2 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_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-38-154.csv Received shutdown request...