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/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:40:23,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:40:23,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:40:23,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:40:23,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:40:23,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:40:23,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:40:23,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:40:23,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:40:23,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:40:23,799 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:40:23,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:40:23,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:40:23,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:40:23,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:40:23,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:40:23,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:40:23,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:40:23,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:40:23,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:40:23,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:40:23,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:40:23,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:40:23,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:40:23,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:40:23,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:40:23,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:40:23,812 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:40:23,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:40:23,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:40:23,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:40:23,813 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:40:23,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:40:23,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:40:23,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:40:23,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:40:23,823 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:40:23,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:40:23,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:40:23,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:40:23,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:40:23,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:40:23,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:40:23,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:40:23,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:23,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:40:23,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:40:23,825 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:40:23,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:40:23,856 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:40:23,858 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:40:23,859 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:40:23,860 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:40:23,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-02-02 10:40:23,981 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:40:23,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:40:23,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:23,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:40:23,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:40:23,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:23" (1/1) ... [2018-02-02 10:40:23,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd3f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:23, skipping insertion in model container [2018-02-02 10:40:23,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:23" (1/1) ... [2018-02-02 10:40:24,000 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:24,028 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:24,120 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:24,139 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:24,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24 WrapperNode [2018-02-02 10:40:24,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:24,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:40:24,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:40:24,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:40:24,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (1/1) ... [2018-02-02 10:40:24,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:40:24,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:40:24,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:40:24,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:40:24,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (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:40:24,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:40:24,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:40:24,219 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:40:24,219 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:40:24,219 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:40:24,219 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:40:24,219 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:40:24,219 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:40:24,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:40:24,605 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:40:24,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:24 BoogieIcfgContainer [2018-02-02 10:40:24,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:40:24,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:40:24,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:40:24,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:40:24,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:40:23" (1/3) ... [2018-02-02 10:40:24,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:24, skipping insertion in model container [2018-02-02 10:40:24,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:24" (2/3) ... [2018-02-02 10:40:24,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:24, skipping insertion in model container [2018-02-02 10:40:24,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:24" (3/3) ... [2018-02-02 10:40:24,612 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-02-02 10:40:24,619 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:40:24,625 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 10:40:24,651 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:40:24,651 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:40:24,651 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:40:24,652 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:40:24,652 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:40:24,652 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:40:24,652 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:40:24,652 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:40:24,653 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:40:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-02-02 10:40:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:40:24,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:24,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:24,671 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-02-02 10:40:24,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:24,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:24,793 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:40:24,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:24,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:24,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:24,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:40:24,796 INFO L182 omatonBuilderFactory]: Interpolants [134#true, 135#false, 136#(= 1 (select |#valid| |main_#t~malloc15.base|)), 137#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:40:24,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:40:24,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:24,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:24,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:24,810 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-02-02 10:40:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,092 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-02-02 10:40:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:25,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:40:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,102 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:40:25,103 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:40:25,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:40:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 10:40:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:40:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 10:40:25,139 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-02-02 10:40:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,140 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 10:40:25,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 10:40:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:40:25,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,141 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,141 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-02-02 10:40:25,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,195 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:40:25,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:25,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:25,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:25,196 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:40:25,196 INFO L182 omatonBuilderFactory]: Interpolants [427#true, 428#false, 429#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 430#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8))] [2018-02-02 10:40:25,196 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:40:25,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:25,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:25,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:25,198 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-02-02 10:40:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,290 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 10:40:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:25,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:40:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,292 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:40:25,292 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:40:25,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:40:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 10:40:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:40:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 10:40:25,301 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-02-02 10:40:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,301 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 10:40:25,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 10:40:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:40:25,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,302 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,302 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-02-02 10:40:25,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,339 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:40:25,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:25,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:25,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:25,340 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:40:25,341 INFO L182 omatonBuilderFactory]: Interpolants [683#true, 684#false, 685#(= 1 (select |#valid| |main_#t~malloc18.base|)), 686#(= 1 (select |#valid| main_~list2~0.base))] [2018-02-02 10:40:25,341 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:40:25,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:25,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:25,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:25,341 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-02-02 10:40:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,469 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-02-02 10:40:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:25,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:40:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,471 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:40:25,471 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:40:25,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:40:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-02 10:40:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:40:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-02 10:40:25,476 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-02-02 10:40:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,477 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-02 10:40:25,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-02 10:40:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:40:25,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,477 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-02-02 10:40:25,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:25,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:25,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:25,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:25,541 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:40:25,541 INFO L182 omatonBuilderFactory]: Interpolants [951#true, 952#false, 953#(and (= 0 |main_#t~malloc18.offset|) (= 8 (select |#length| |main_#t~malloc18.base|))), 954#(and (= (select |#length| main_~list2~0.base) 8) (= main_~list2~0.offset 0))] [2018-02-02 10:40:25,541 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:40:25,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:25,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:25,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:25,542 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-02-02 10:40:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,630 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 10:40:25,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:25,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:40:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,631 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:40:25,631 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:40:25,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:40:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 10:40:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:40:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:40:25,635 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-02-02 10:40:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,636 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:40:25,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:40:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:40:25,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,636 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,636 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-02-02 10:40:25,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,691 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:40:25,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:25,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:25,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:25,692 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:40:25,692 INFO L182 omatonBuilderFactory]: Interpolants [1207#true, 1208#false, 1209#(= 1 (select |#valid| |append_#t~malloc0.base|)), 1210#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 10:40:25,692 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:40:25,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:25,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:25,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:25,693 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-02-02 10:40:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,764 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 10:40:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:25,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:40:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,765 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:40:25,765 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:40:25,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:40:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:40:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:40:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 10:40:25,770 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-02-02 10:40:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,770 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 10:40:25,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 10:40:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:40:25,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,771 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,771 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-02-02 10:40:25,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,827 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:40:25,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:25,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:25,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:25,828 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:40:25,828 INFO L182 omatonBuilderFactory]: Interpolants [1451#true, 1452#false, 1453#(and (= 9 (select |#length| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)), 1454#(and (= append_~node~0.offset 0) (= (select |#length| append_~node~0.base) 9))] [2018-02-02 10:40:25,828 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:40:25,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:40:25,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:40:25,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:40:25,828 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 10:40:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:25,912 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 10:40:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:40:25,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:40:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:25,913 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:40:25,913 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:40:25,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:40:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:40:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:40:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 10:40:25,917 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-02-02 10:40:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:25,917 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 10:40:25,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:40:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 10:40:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:40:25,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:25,918 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:25,918 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:40:25,918 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-02-02 10:40:25,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:25,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:25,942 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:40:25,955 INFO L168 Benchmark]: Toolchain (without parser) took 1973.95 ms. Allocated memory was 404.2 MB in the beginning and 639.1 MB in the end (delta: 234.9 MB). Free memory was 361.1 MB in the beginning and 609.4 MB in the end (delta: -248.2 MB). Peak memory consumption was 145.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:25,956 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:25,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:25,957 INFO L168 Benchmark]: Boogie Preprocessor took 32.13 ms. Allocated memory is still 404.2 MB. Free memory was 350.3 MB in the beginning and 347.7 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:40:25,957 INFO L168 Benchmark]: RCFGBuilder took 426.23 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 312.2 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:25,957 INFO L168 Benchmark]: TraceAbstraction took 1348.50 ms. Allocated memory was 404.2 MB in the beginning and 639.1 MB in the end (delta: 234.9 MB). Free memory was 312.2 MB in the beginning and 609.4 MB in the end (delta: -297.2 MB). Peak memory consumption was 96.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:25,959 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.10 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.13 ms. Allocated memory is still 404.2 MB. Free memory was 350.3 MB in the beginning and 347.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 426.23 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 312.2 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1348.50 ms. Allocated memory was 404.2 MB in the beginning and 639.1 MB in the end (delta: 234.9 MB). Free memory was 312.2 MB in the beginning and 609.4 MB in the end (delta: -297.2 MB). Peak memory consumption was 96.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-40-25-963.csv Received shutdown request...