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_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:50,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:50,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:50,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:50,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:50,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:50,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:50,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:50,156 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:50,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:50,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:50,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:50,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:50,160 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:50,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:50,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:50,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:50,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:50,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:50,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:50,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:50,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:50,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:50,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:50,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:50,172 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:50,172 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:50,173 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:50,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:50,173 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:50,174 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:50,174 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:47:50,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:50,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:50,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:50,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:50,184 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:50,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:50,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:50,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:50,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:50,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:50,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:50,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:50,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:50,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:50,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:50,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:50,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:50,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:50,187 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:50,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:50,226 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:50,230 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:50,232 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:50,232 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:50,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-02 10:47:50,371 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:50,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:50,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:50,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:50,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:50,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a37773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,391 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:50,428 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:50,505 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:50,518 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:50,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50 WrapperNode [2018-02-02 10:47:50,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:50,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:50,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:50,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:50,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (1/1) ... [2018-02-02 10:47:50,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:50,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:50,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:50,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:50,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (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:47:50,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:50,582 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:50,582 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:50,582 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:50,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:50,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 10:47:50,583 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:50,584 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:50,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:50,584 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:50,763 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:50,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:50 BoogieIcfgContainer [2018-02-02 10:47:50,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:50,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:50,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:50,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:50,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:50" (1/3) ... [2018-02-02 10:47:50,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3b3e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:50" (2/3) ... [2018-02-02 10:47:50,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3b3e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:50, skipping insertion in model container [2018-02-02 10:47:50,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:50" (3/3) ... [2018-02-02 10:47:50,769 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-02-02 10:47:50,775 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:50,779 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 10:47:50,812 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:50,812 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:50,812 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:50,812 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:50,812 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:50,813 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:50,813 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:50,813 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:50,813 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-02 10:47:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:47:50,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:50,834 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:47:50,834 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash 3232357, now seen corresponding path program 1 times [2018-02-02 10:47:50,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:50,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:50,978 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:47:50,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:50,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:50,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:50,982 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:47:50,982 INFO L182 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(= 1 (select |#valid| |~#a6.base|))] [2018-02-02 10:47:50,982 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:47:50,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:50,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:50,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:50,997 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-02 10:47:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,153 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 10:47:51,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:51,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:47:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,164 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:47:51,164 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:47:51,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:47:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-02 10:47:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:47:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 10:47:51,202 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-02 10:47:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,202 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 10:47:51,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 10:47:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 10:47:51,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 10:47:51,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 3232358, now seen corresponding path program 1 times [2018-02-02 10:47:51,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,256 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:47:51,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:51,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,257 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:47:51,257 INFO L182 omatonBuilderFactory]: Interpolants [218#true, 219#false, 220#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-02 10:47:51,257 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:47:51,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:51,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:51,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:51,259 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-02 10:47:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,302 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-02 10:47:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:51,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 10:47:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,304 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:47:51,304 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:47:51,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:47:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-02 10:47:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:47:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-02 10:47:51,314 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-02 10:47:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,314 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-02 10:47:51,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-02 10:47:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,315 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,315 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -293037669, now seen corresponding path program 1 times [2018-02-02 10:47:51,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,405 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:47:51,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,406 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:47:51,406 INFO L182 omatonBuilderFactory]: Interpolants [440#true, 441#false, 442#(= 1 (select |#valid| |~#a6.base|)), 443#(= |#valid| |old(#valid)|), 444#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 445#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-02 10:47:51,406 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:47:51,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,407 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-02 10:47:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,564 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-02 10:47:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:51,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:47:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,566 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:47:51,566 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 10:47:51,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 10:47:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-02 10:47:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:47:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-02 10:47:51,577 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-02 10:47:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,577 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-02 10:47:51,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-02 10:47:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,578 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,578 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -293037668, now seen corresponding path program 1 times [2018-02-02 10:47:51,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,624 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:47:51,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:51,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,624 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:47:51,625 INFO L182 omatonBuilderFactory]: Interpolants [688#(<= 3 |entry_point_#t~ret9|), 689#(<= 3 entry_point_~ret~1), 684#true, 685#false, 686#(<= 3 probe2_6_~ret~0), 687#(<= 3 |probe2_6_#res|)] [2018-02-02 10:47:51,625 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:47:51,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,625 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-02 10:47:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,650 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-02 10:47:51,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:51,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:47:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,651 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:47:51,651 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:47:51,652 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:47:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:47:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 10:47:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:47:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-02 10:47:51,659 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-02 10:47:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,659 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-02 10:47:51,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-02 10:47:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,660 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,660 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2126392044, now seen corresponding path program 1 times [2018-02-02 10:47:51,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,720 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:47:51,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,721 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:47:51,721 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= 0 probe2_6_~p~0.offset) (= 0 probe2_6_~p~0.base)), 924#true, 925#false, 926#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 927#(and (= 0 |probe2_6_#t~ret4.offset|) (= 0 |probe2_6_#t~ret4.base|))] [2018-02-02 10:47:51,721 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:47:51,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:51,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:51,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:51,722 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-02 10:47:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,737 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 10:47:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:51,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 10:47:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,738 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:47:51,738 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:47:51,738 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:47:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:47:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 10:47:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:47:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-02 10:47:51,741 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-02 10:47:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,742 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-02 10:47:51,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-02 10:47:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:47:51,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,743 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1815899569, now seen corresponding path program 1 times [2018-02-02 10:47:51,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,795 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:47:51,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:51,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,796 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:47:51,796 INFO L182 omatonBuilderFactory]: Interpolants [1079#true, 1080#false, 1081#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1082#(not (= 0 |ldv_malloc_#res.base|)), 1083#(not (= 0 |probe2_6_#t~ret4.base|)), 1084#(not (= 0 probe2_6_~p~0.base))] [2018-02-02 10:47:51,796 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:47:51,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,797 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-02 10:47:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,818 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-02 10:47:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:51,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:47:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,819 INFO L225 Difference]: With dead ends: 69 [2018-02-02 10:47:51,819 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 10:47:51,819 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:47:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 10:47:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 10:47:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 10:47:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 10:47:51,822 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-02 10:47:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,823 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 10:47:51,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 10:47:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:47:51,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,823 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash -510641866, now seen corresponding path program 1 times [2018-02-02 10:47:51,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,875 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:47:51,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,876 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:47:51,876 INFO L182 omatonBuilderFactory]: Interpolants [1225#true, 1226#false, 1227#(= 0 |ldv_malloc_#t~malloc1.offset|), 1228#(= 0 |ldv_malloc_#res.offset|), 1229#(= 0 |probe2_6_#t~ret4.offset|), 1230#(= 0 probe2_6_~p~0.offset)] [2018-02-02 10:47:51,876 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:47:51,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,877 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-02 10:47:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:51,894 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-02 10:47:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:51,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:47:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:51,895 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:47:51,896 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:47:51,896 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:47:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:47:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 10:47:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 10:47:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-02 10:47:51,900 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-02 10:47:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:51,900 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-02 10:47:51,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-02 10:47:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:47:51,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:51,901 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:51,901 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash -510641865, now seen corresponding path program 1 times [2018-02-02 10:47:51,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:51,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:51,957 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:47:51,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:51,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:51,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:51,958 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:47:51,958 INFO L182 omatonBuilderFactory]: Interpolants [1369#true, 1370#false, 1371#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1372#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1373#(= 1 (select |#valid| |probe2_6_#t~ret4.base|)), 1374#(= 1 (select |#valid| probe2_6_~p~0.base))] [2018-02-02 10:47:51,959 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:47:51,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:51,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:51,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:51,959 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-02 10:47:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:52,035 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-02 10:47:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:52,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:47:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:52,036 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:47:52,036 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:47:52,037 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:47:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:47:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 10:47:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:47:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 10:47:52,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-02 10:47:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:52,040 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 10:47:52,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 10:47:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:47:52,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:52,041 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:52,041 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe2_6Err1RequiresViolation, probe2_6Err0RequiresViolation, probe2_6Err2RequiresViolation, probe2_6Err3RequiresViolation]=== [2018-02-02 10:47:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1858419564, now seen corresponding path program 1 times [2018-02-02 10:47:52,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:52,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:52,066 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:47:52,069 INFO L168 Benchmark]: Toolchain (without parser) took 1698.14 ms. Allocated memory was 402.1 MB in the beginning and 615.5 MB in the end (delta: 213.4 MB). Free memory was 358.6 MB in the beginning and 444.6 MB in the end (delta: -86.0 MB). Peak memory consumption was 127.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,071 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.1 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:52,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.78 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 345.4 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:47:52,071 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 342.8 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:47:52,071 INFO L168 Benchmark]: RCFGBuilder took 217.66 ms. Allocated memory is still 402.1 MB. Free memory was 342.8 MB in the beginning and 320.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,072 INFO L168 Benchmark]: TraceAbstraction took 1304.07 ms. Allocated memory was 402.1 MB in the beginning and 615.5 MB in the end (delta: 213.4 MB). Free memory was 320.3 MB in the beginning and 444.6 MB in the end (delta: -124.4 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:52,073 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.16 ms. Allocated memory is still 402.1 MB. Free memory is still 363.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.78 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 345.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 342.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 217.66 ms. Allocated memory is still 402.1 MB. Free memory was 342.8 MB in the beginning and 320.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1304.07 ms. Allocated memory was 402.1 MB in the beginning and 615.5 MB in the end (delta: 213.4 MB). Free memory was 320.3 MB in the beginning and 444.6 MB in the end (delta: -124.4 MB). Peak memory consumption was 89.0 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_test6_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-52-079.csv Received shutdown request...