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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:20:38,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:20:38,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:20:38,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:20:38,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:20:38,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:20:38,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:20:38,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:20:38,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:20:38,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:20:38,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:20:38,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:20:38,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:20:38,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:20:38,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:20:38,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:20:38,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:20:38,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:20:38,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:20:38,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:20:38,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:20:38,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:20:38,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:20:38,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:20:38,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:20:38,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:20:38,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:20:38,178 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:20:38,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:20:38,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:20:38,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:20:38,179 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:20:38,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:20:38,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:20:38,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:20:38,190 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:20:38,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:20:38,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:20:38,190 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:20:38,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:20:38,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:20:38,191 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:20:38,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:20:38,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:20:38,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:20:38,192 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:20:38,192 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:20:38,192 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:20:38,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:20:38,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:20:38,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:20:38,193 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:20:38,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:20:38,194 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:20:38,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:20:38,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:20:38,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:20:38,194 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:20:38,195 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:20:38,196 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:20:38,196 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:20:38,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:20:38,241 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:20:38,245 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:20:38,246 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:20:38,247 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:20:38,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-30 00:20:38,421 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:20:38,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:20:38,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:38,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:20:38,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:20:38,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acb6c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38, skipping insertion in model container [2018-01-30 00:20:38,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,454 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:38,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:38,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:38,625 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:38,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38 WrapperNode [2018-01-30 00:20:38,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:38,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:20:38,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:20:38,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:20:38,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... [2018-01-30 00:20:38,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:20:38,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:20:38,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:20:38,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:20:38,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (1/1) ... No working directory specified, using /storage/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-01-30 00:20:38,708 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:20:38,708 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:20:38,708 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:20:38,708 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-01-30 00:20:38,709 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-01-30 00:20:38,709 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:20:38,709 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:20:38,709 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:20:38,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:20:38,829 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:20:38,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:38 BoogieIcfgContainer [2018-01-30 00:20:38,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:20:38,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:20:38,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:20:38,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:20:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:20:38" (1/3) ... [2018-01-30 00:20:38,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dde4ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:38, skipping insertion in model container [2018-01-30 00:20:38,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:38" (2/3) ... [2018-01-30 00:20:38,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dde4ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:38, skipping insertion in model container [2018-01-30 00:20:38,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:38" (3/3) ... [2018-01-30 00:20:38,836 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-30 00:20:38,842 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:20:38,849 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-30 00:20:38,895 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:20:38,895 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:20:38,895 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:20:38,896 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:20:38,896 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:20:38,896 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:20:38,896 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:20:38,896 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:20:38,897 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:20:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-30 00:20:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:20:38,922 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:38,923 INFO L350 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-01-30 00:20:38,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 589716733, now seen corresponding path program 1 times [2018-01-30 00:20:38,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:38,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:38,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:38,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:38,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:39,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:39,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:39,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:20:39,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:39,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:39,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:39,185 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 5 states. [2018-01-30 00:20:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:39,336 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-30 00:20:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:20:39,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:20:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:39,347 INFO L225 Difference]: With dead ends: 50 [2018-01-30 00:20:39,347 INFO L226 Difference]: Without dead ends: 46 [2018-01-30 00:20:39,349 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-30 00:20:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-01-30 00:20:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 00:20:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-30 00:20:39,382 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 24 [2018-01-30 00:20:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:39,383 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-30 00:20:39,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-30 00:20:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:20:39,384 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:39,384 INFO L350 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-01-30 00:20:39,384 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash 589716734, now seen corresponding path program 1 times [2018-01-30 00:20:39,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:39,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:39,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:39,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:39,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:39,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:39,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:20:39,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:39,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:39,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:39,479 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2018-01-30 00:20:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:39,569 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-30 00:20:39,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:20:39,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:20:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:39,571 INFO L225 Difference]: With dead ends: 49 [2018-01-30 00:20:39,571 INFO L226 Difference]: Without dead ends: 48 [2018-01-30 00:20:39,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-30 00:20:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-01-30 00:20:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 00:20:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-30 00:20:39,585 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 24 [2018-01-30 00:20:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:39,585 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-30 00:20:39,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-30 00:20:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:20:39,587 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:39,587 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:39,587 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1335001013, now seen corresponding path program 1 times [2018-01-30 00:20:39,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:39,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:39,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:39,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:39,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:39,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:39,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:39,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:39,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:39,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:39,667 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-01-30 00:20:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:39,759 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-30 00:20:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:39,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:20:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:39,761 INFO L225 Difference]: With dead ends: 47 [2018-01-30 00:20:39,761 INFO L226 Difference]: Without dead ends: 46 [2018-01-30 00:20:39,762 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:20:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-30 00:20:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-30 00:20:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-30 00:20:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-30 00:20:39,771 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 25 [2018-01-30 00:20:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:39,771 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-30 00:20:39,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-30 00:20:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:20:39,772 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:39,773 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:39,773 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1335001012, now seen corresponding path program 1 times [2018-01-30 00:20:39,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:39,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:39,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:39,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:39,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:39,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:39,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:39,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:39,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:39,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:39,865 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-01-30 00:20:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:39,974 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-30 00:20:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:39,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:20:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:39,975 INFO L225 Difference]: With dead ends: 49 [2018-01-30 00:20:39,975 INFO L226 Difference]: Without dead ends: 48 [2018-01-30 00:20:39,976 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-30 00:20:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-01-30 00:20:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-30 00:20:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-30 00:20:39,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2018-01-30 00:20:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:39,983 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-30 00:20:39,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-30 00:20:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:20:39,984 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:39,984 INFO L350 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] [2018-01-30 00:20:39,984 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1508562692, now seen corresponding path program 1 times [2018-01-30 00:20:39,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:39,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:39,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:39,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:39,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:40,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:40,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:20:40,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:20:40,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:20:40,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:40,035 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 3 states. [2018-01-30 00:20:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:40,070 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-30 00:20:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:20:40,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-30 00:20:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:40,072 INFO L225 Difference]: With dead ends: 48 [2018-01-30 00:20:40,072 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 00:20:40,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 00:20:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-30 00:20:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:20:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-01-30 00:20:40,084 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 29 [2018-01-30 00:20:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:40,084 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-01-30 00:20:40,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:20:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-01-30 00:20:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:20:40,086 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:40,086 INFO L350 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] [2018-01-30 00:20:40,086 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1947867538, now seen corresponding path program 1 times [2018-01-30 00:20:40,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:40,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:40,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:40,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:40,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:40,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:40,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:40,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:40,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:40,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:40,152 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 7 states. [2018-01-30 00:20:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:40,262 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-01-30 00:20:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:20:40,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-30 00:20:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:40,264 INFO L225 Difference]: With dead ends: 55 [2018-01-30 00:20:40,264 INFO L226 Difference]: Without dead ends: 46 [2018-01-30 00:20:40,265 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:20:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-30 00:20:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-30 00:20:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-30 00:20:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-30 00:20:40,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-01-30 00:20:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:40,272 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-30 00:20:40,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-30 00:20:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:20:40,273 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:40,273 INFO L350 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] [2018-01-30 00:20:40,273 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1865426420, now seen corresponding path program 1 times [2018-01-30 00:20:40,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:40,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:40,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:40,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:40,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:40,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:40,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:40,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:40,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:40,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:40,367 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 6 states. [2018-01-30 00:20:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:40,438 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-01-30 00:20:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:40,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 00:20:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:40,440 INFO L225 Difference]: With dead ends: 50 [2018-01-30 00:20:40,440 INFO L226 Difference]: Without dead ends: 32 [2018-01-30 00:20:40,440 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-30 00:20:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-30 00:20:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-30 00:20:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2018-01-30 00:20:40,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 30 [2018-01-30 00:20:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:40,445 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2018-01-30 00:20:40,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2018-01-30 00:20:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:20:40,446 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:40,446 INFO L350 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] [2018-01-30 00:20:40,446 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 00:20:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1695992538, now seen corresponding path program 1 times [2018-01-30 00:20:40,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:40,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:40,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:40,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:40,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:40,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:40,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:20:40,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:20:40,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:20:40,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:20:40,614 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand 9 states. [2018-01-30 00:20:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:40,817 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-01-30 00:20:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:20:40,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-30 00:20:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:40,818 INFO L225 Difference]: With dead ends: 32 [2018-01-30 00:20:40,818 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:20:40,819 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:20:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:20:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:20:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:20:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:20:40,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-30 00:20:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:40,820 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:20:40,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:20:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:20:40,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:20:40,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:20:41,019 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 30 DAG size of output 18 [2018-01-30 00:20:41,128 INFO L399 ceAbstractionStarter]: For program point L1441''(line 1441) no Hoare annotation was computed. [2018-01-30 00:20:41,129 INFO L399 ceAbstractionStarter]: For program point free_8Err1RequiresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,129 INFO L399 ceAbstractionStarter]: For program point free_8Err0RequiresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,129 INFO L395 ceAbstractionStarter]: At program point free_8ENTRY(lines 1440 1442) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (let ((.cse0 (not (= 0 ~a8.offset)))) (and (or .cse0 (not (= (select |old(#valid)| ~a8.base) 1))) (or .cse0 (not (= 0 ~a8.base)))))) [2018-01-30 00:20:41,129 INFO L399 ceAbstractionStarter]: For program point free_8EXIT(lines 1440 1442) no Hoare annotation was computed. [2018-01-30 00:20:41,129 INFO L399 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:41,130 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-30 00:20:41,131 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:41,131 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:41,131 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-30 00:20:41,132 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,132 INFO L399 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-30 00:20:41,132 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,132 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1452) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:41,132 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L395 ceAbstractionStarter]: At program point alloc_8ENTRY(lines 1436 1438) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-30 00:20:41,133 INFO L399 ceAbstractionStarter]: For program point alloc_8EXIT(lines 1436 1438) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L399 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L399 ceAbstractionStarter]: For program point alloc_8FINAL(lines 1436 1438) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L399 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1452) the Hoare annotation is: true [2018-01-30 00:20:41,133 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,133 INFO L395 ceAbstractionStarter]: At program point L1(lines 1 1452) the Hoare annotation is: (and (= ~a8.offset 0) (= 0 ~a8.base)) [2018-01-30 00:20:41,134 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,134 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1450 1452) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-30 00:20:41,134 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,134 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,134 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-30 00:20:41,134 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1448) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-30 00:20:41,134 INFO L399 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1448) no Hoare annotation was computed. [2018-01-30 00:20:41,135 INFO L395 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: (let ((.cse1 (select |#valid| ~a8.base)) (.cse2 (= 0 ~a8.base))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (= ~a8.offset 0))) (or (and .cse4 (= 1 .cse1)) (and .cse4 .cse2))))) (or (and (= |#valid| |old(#valid)|) .cse3) (and (not .cse2) .cse3))))) (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and .cse0 (= (store |old(#valid)| ~a8.base .cse1) |#valid|) (= (select |old(#valid)| ~a8.base) 0)) (and .cse0 .cse2)))) [2018-01-30 00:20:41,135 INFO L399 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-30 00:20:41,135 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1448) no Hoare annotation was computed. [2018-01-30 00:20:41,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:20:41 BoogieIcfgContainer [2018-01-30 00:20:41,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:20:41,143 INFO L168 Benchmark]: Toolchain (without parser) took 2721.40 ms. Allocated memory was 308.3 MB in the beginning and 481.8 MB in the end (delta: 173.5 MB). Free memory was 265.0 MB in the beginning and 367.3 MB in the end (delta: -102.3 MB). Peak memory consumption was 71.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:41,144 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:41,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.77 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 251.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:41,145 INFO L168 Benchmark]: Boogie Preprocessor took 31.48 ms. Allocated memory is still 308.3 MB. Free memory is still 251.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:41,145 INFO L168 Benchmark]: RCFGBuilder took 164.53 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 236.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:41,145 INFO L168 Benchmark]: TraceAbstraction took 2309.95 ms. Allocated memory was 308.3 MB in the beginning and 481.8 MB in the end (delta: 173.5 MB). Free memory was 236.1 MB in the beginning and 367.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 42.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:41,148 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 308.3 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.77 ms. Allocated memory is still 308.3 MB. Free memory was 265.0 MB in the beginning and 251.1 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.48 ms. Allocated memory is still 308.3 MB. Free memory is still 251.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 164.53 ms. Allocated memory is still 308.3 MB. Free memory was 251.1 MB in the beginning and 236.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2309.95 ms. Allocated memory was 308.3 MB in the beginning and 481.8 MB in the end (delta: 173.5 MB). Free memory was 236.1 MB in the beginning and 367.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 42.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1450]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 39 locations, 3 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 275 SDtfs, 157 SDslu, 690 SDs, 0 SdLazy, 289 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 10 PreInvPairs, 11 NumberOfFragments, 220 HoareAnnotationTreeSize, 10 FomulaSimplifications, 76 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 17592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-20-41-156.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-20-41-156.csv Received shutdown request...