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_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:39,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:39,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:39,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:39,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:39,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:39,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:39,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:39,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:39,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:39,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:39,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:39,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:39,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:39,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:39,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:39,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:39,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:39,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:39,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:39,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:39,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:39,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:39,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:39,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:39,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:39,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:39,618 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:39,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:39,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:39,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:39,618 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:39,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:39,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:39,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:39,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:39,628 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:39,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:39,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:39,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:39,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:39,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:39,631 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:39,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:39,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:39,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:39,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:39,668 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:39,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-02 10:48:39,794 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:39,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:39,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:39,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:39,800 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:39,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:39" (1/1) ... [2018-02-02 10:48:39,802 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:39, skipping insertion in model container [2018-02-02 10:48:39,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:39" (1/1) ... [2018-02-02 10:48:39,812 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:39,846 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:39,934 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:39,945 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:39,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:39 WrapperNode [2018-02-02 10:48:39,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:39,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:39,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:39,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:39,965 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:39" (1/1) ... [2018-02-02 10:48:39,965 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:39" (1/1) ... [2018-02-02 10:48:39,973 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:39" (1/1) ... [2018-02-02 10:48:39,974 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:39" (1/1) ... [2018-02-02 10:48:39,976 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:39" (1/1) ... [2018-02-02 10:48:39,978 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:39" (1/1) ... [2018-02-02 10:48:39,979 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:39" (1/1) ... [2018-02-02 10:48:39,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:39,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:39,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:39,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:39,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:39" (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:40,019 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:40,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:40,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:40,020 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:40,020 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:40,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:40,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:40,020 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:40,020 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:40,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:40,136 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:40,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:40 BoogieIcfgContainer [2018-02-02 10:48:40,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:40,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:40,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:40,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:40,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:39" (1/3) ... [2018-02-02 10:48:40,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3a30ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:40, skipping insertion in model container [2018-02-02 10:48:40,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:39" (2/3) ... [2018-02-02 10:48:40,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3a30ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:40, skipping insertion in model container [2018-02-02 10:48:40,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:40" (3/3) ... [2018-02-02 10:48:40,142 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-02 10:48:40,148 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:40,154 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:48:40,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:40,192 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:40,192 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:40,192 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:40,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:40,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:40,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:40,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:40,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 10:48:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:48:40,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,227 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,228 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-02 10:48:40,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,305 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:40,360 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:40,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:40,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:40,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,363 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:40,363 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:40,363 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:40,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:40,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:40,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:40,378 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-02 10:48:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,504 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-02 10:48:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:40,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:48:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,511 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:48:40,511 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:48:40,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:48:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-02 10:48:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 10:48:40,539 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-02 10:48:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,540 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 10:48:40,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 10:48:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:48:40,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,541 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:40,541 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-02 10:48:40,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,560 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:40,601 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:40,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:40,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:40,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,601 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:40,602 INFO L182 omatonBuilderFactory]: Interpolants [112#(not (= 0 |ldv_malloc_#res.base|)), 113#(not (= 0 |entry_point_#t~ret2.base|)), 114#(not (= 0 entry_point_~p~0.base)), 109#true, 110#false, 111#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:48:40,602 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:40,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:40,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:40,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:40,603 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-02 10:48:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,636 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-02 10:48:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:40,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:48:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,638 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:48:40,638 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:48:40,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:48:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-02 10:48:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:48:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 10:48:40,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-02 10:48:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,643 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 10:48:40,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 10:48:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:40,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,644 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,644 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-02 10:48:40,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,659 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:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:40,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:40,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,694 INFO L182 omatonBuilderFactory]: Interpolants [184#true, 185#false, 186#(= 0 |ldv_malloc_#res.offset|), 187#(= 0 |entry_point_#t~ret3.offset|), 188#(= 0 entry_point_~q~0.offset)] [2018-02-02 10:48:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:40,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:40,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,695 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-02 10:48:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,730 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 10:48:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:40,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:48:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,731 INFO L225 Difference]: With dead ends: 32 [2018-02-02 10:48:40,731 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:48:40,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:48:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-02 10:48:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 10:48:40,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-02 10:48:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,736 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 10:48:40,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 10:48:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:48:40,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,737 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,737 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-02 10:48:40,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,751 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:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:40,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:40,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,782 INFO L182 omatonBuilderFactory]: Interpolants [256#(= 0 entry_point_~q~0.base), 252#true, 253#false, 254#(= 0 |ldv_malloc_#res.base|), 255#(= 0 |entry_point_#t~ret3.base|)] [2018-02-02 10:48:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:40,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,783 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-02 10:48:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,799 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-02 10:48:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:40,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:48:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,800 INFO L225 Difference]: With dead ends: 36 [2018-02-02 10:48:40,800 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:48:40,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:48:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-02 10:48:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-02 10:48:40,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-02 10:48:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,805 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-02 10:48:40,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-02 10:48:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:48:40,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,806 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,806 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-02 10:48:40,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,819 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:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:40,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:40,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,858 INFO L182 omatonBuilderFactory]: Interpolants [324#true, 325#false, 326#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 327#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 328#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 10:48:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:40,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:40,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,859 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-02-02 10:48:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,867 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-02 10:48:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:40,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 10:48:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,868 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:48:40,868 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:48:40,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:48:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 10:48:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 10:48:40,870 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-02 10:48:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,870 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 10:48:40,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 10:48:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:40,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,871 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,871 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-02 10:48:40,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,883 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:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:40,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:40,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,924 INFO L182 omatonBuilderFactory]: Interpolants [393#true, 394#false, 395#(= 0 |ldv_malloc_#t~malloc1.offset|), 396#(= 0 |ldv_malloc_#res.offset|), 397#(= 0 |entry_point_#t~ret2.offset|), 398#(= 0 entry_point_~p~0.offset)] [2018-02-02 10:48:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:40,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:40,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:40,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:40,924 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-02 10:48:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,938 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 10:48:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:40,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:48:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,939 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:48:40,939 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:48:40,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:48:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 10:48:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 10:48:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-02 10:48:40,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-02 10:48:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,941 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-02 10:48:40,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-02 10:48:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:40,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,942 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,942 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:40,942 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-02 10:48:40,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,955 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:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:41,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:41,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:48:41,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:41,071 INFO L182 omatonBuilderFactory]: Interpolants [464#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 465#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 466#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 467#(= 1 (select |#valid| entry_point_~p~0.base)), 468#(= |#valid| |old(#valid)|), 469#(and (= |#valid| |old(#valid)|) (= 0 |ldv_malloc_#res.base|)), 470#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 |entry_point_#t~ret3.base|)), 471#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 entry_point_~q~0.base)), 462#true, 463#false] [2018-02-02 10:48:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:41,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:41,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:41,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:41,072 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-02 10:48:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:41,147 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-02 10:48:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:41,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 10:48:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:41,148 INFO L225 Difference]: With dead ends: 31 [2018-02-02 10:48:41,148 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:48:41,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:48:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 10:48:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:48:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 10:48:41,152 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-02 10:48:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:41,152 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 10:48:41,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 10:48:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:48:41,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:41,153 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:41,153 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-02 10:48:41,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:41,164 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:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:41,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:41,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,202 INFO L182 omatonBuilderFactory]: Interpolants [536#true, 537#false, 538#(= 0 |ldv_malloc_#t~malloc1.offset|), 539#(= 0 |ldv_malloc_#res.offset|), 540#(= 0 |entry_point_#t~ret3.offset|), 541#(= 0 entry_point_~q~0.offset)] [2018-02-02 10:48:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:41,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:41,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:41,203 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-02 10:48:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:41,221 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 10:48:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:41,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:48:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:41,222 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:48:41,222 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:48:41,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:48:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 10:48:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 10:48:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-02 10:48:41,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-02 10:48:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:41,227 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-02 10:48:41,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-02 10:48:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:48:41,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:41,228 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:41,228 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-02 10:48:41,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:41,240 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:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:41,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:41,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,268 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 609#(= 1 (select |#valid| entry_point_~q~0.base)), 604#true, 605#false, 606#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 607#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:48:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:48:41,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:41,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:41,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:41,269 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-02 10:48:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:41,314 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-02 10:48:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:41,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:48:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:41,315 INFO L225 Difference]: With dead ends: 29 [2018-02-02 10:48:41,315 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 10:48:41,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 10:48:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 10:48:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:48:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-02 10:48:41,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-02 10:48:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:41,318 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-02 10:48:41,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-02 10:48:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:41,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:41,319 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:41,319 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-02 10:48:41,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:41,334 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:41,340 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:41,345 INFO L168 Benchmark]: Toolchain (without parser) took 1550.38 ms. Allocated memory was 403.2 MB in the beginning and 615.5 MB in the end (delta: 212.3 MB). Free memory was 357.2 MB in the beginning and 463.6 MB in the end (delta: -106.4 MB). Peak memory consumption was 105.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:41,346 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:41,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.51 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 344.0 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:41,347 INFO L168 Benchmark]: Boogie Preprocessor took 28.09 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 341.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:41,347 INFO L168 Benchmark]: RCFGBuilder took 156.11 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 326.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:41,347 INFO L168 Benchmark]: TraceAbstraction took 1208.07 ms. Allocated memory was 403.2 MB in the beginning and 615.5 MB in the end (delta: 212.3 MB). Free memory was 326.8 MB in the beginning and 463.6 MB in the end (delta: -136.8 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:41,348 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 403.2 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.51 ms. Allocated memory is still 403.2 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.09 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 341.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 156.11 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 326.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1208.07 ms. Allocated memory was 403.2 MB in the beginning and 615.5 MB in the end (delta: 212.3 MB). Free memory was 326.8 MB in the beginning and 463.6 MB in the end (delta: -136.8 MB). Peak memory consumption was 75.5 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_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-41-353.csv Received shutdown request...