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/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:49:35,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:49:35,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:49:35,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:49:35,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:49:35,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:49:35,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:49:35,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:49:35,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:49:35,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:49:35,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:49:35,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:49:35,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:49:35,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:49:35,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:49:35,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:49:35,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:49:35,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:49:35,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:49:35,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:49:35,720 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:49:35,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:49:35,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:49:35,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:49:35,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:49:35,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:49:35,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:49:35,724 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:49:35,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:49:35,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:49:35,724 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:49:35,725 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:49:35,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:49:35,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:49:35,735 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:49:35,735 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:49:35,736 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:49:35,736 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:49:35,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:49:35,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:49:35,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:49:35,738 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:49:35,738 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:49:35,738 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:49:35,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:49:35,775 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:49:35,778 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:49:35,779 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:49:35,780 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:49:35,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:49:35,918 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:49:35,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:49:35,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:49:35,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:49:35,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:49:35,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:49:35" (1/1) ... [2018-02-02 10:49:35,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14155446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:35, skipping insertion in model container [2018-02-02 10:49:35,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:49:35" (1/1) ... [2018-02-02 10:49:35,944 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:49:35,984 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:49:36,094 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:49:36,108 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:49:36,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36 WrapperNode [2018-02-02 10:49:36,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:49:36,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:49:36,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:49:36,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:49:36,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... [2018-02-02 10:49:36,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:49:36,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:49:36,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:49:36,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:49:36,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:49:36,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:49:36,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:49:36,192 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:49:36,192 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:49:36,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:49:36,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:49:36,193 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:49:36,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:49:36,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:49:36,537 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:49:36,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:49:36 BoogieIcfgContainer [2018-02-02 10:49:36,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:49:36,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:49:36,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:49:36,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:49:36,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:49:35" (1/3) ... [2018-02-02 10:49:36,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe6d817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:49:36, skipping insertion in model container [2018-02-02 10:49:36,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:36" (2/3) ... [2018-02-02 10:49:36,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe6d817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:49:36, skipping insertion in model container [2018-02-02 10:49:36,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:49:36" (3/3) ... [2018-02-02 10:49:36,546 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:49:36,554 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:49:36,561 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 10:49:36,592 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:49:36,592 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:49:36,593 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:49:36,593 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:49:36,593 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:49:36,593 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:49:36,593 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:49:36,593 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:49:36,594 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:49:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-02-02 10:49:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:49:36,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:36,613 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:36,613 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-02-02 10:49:36,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:36,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:36,741 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:49:36,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:36,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:49:36,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:36,745 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:49:36,745 INFO L182 omatonBuilderFactory]: Interpolants [116#true, 117#false, 118#(= 1 (select |#valid| |main_#t~malloc0.base|)), 119#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:49:36,745 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:49:36,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:49:36,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:49:36,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:49:36,758 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-02-02 10:49:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:36,968 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 10:49:36,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:49:36,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:49:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:36,976 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:49:36,976 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:49:36,977 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:49:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:49:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-02-02 10:49:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:49:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 10:49:37,005 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-02-02 10:49:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,005 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 10:49:37,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:49:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 10:49:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:49:37,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,006 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,006 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-02-02 10:49:37,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:37,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:37,059 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:49:37,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:37,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:49:37,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:37,060 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:49:37,060 INFO L182 omatonBuilderFactory]: Interpolants [352#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 353#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0)), 350#true, 351#false] [2018-02-02 10:49:37,060 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:49:37,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:49:37,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:49:37,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:49:37,061 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-02-02 10:49:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:37,142 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 10:49:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:49:37,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:49:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:37,143 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:49:37,143 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:49:37,144 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:49:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:49:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-02 10:49:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:49:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 10:49:37,148 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-02-02 10:49:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,149 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 10:49:37,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:49:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 10:49:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:49:37,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,149 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-02-02 10:49:37,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:37,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:37,197 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:49:37,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:37,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:49:37,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:37,198 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:49:37,198 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(= 1 (select |#valid| main_~head~0.base)), 570#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:49:37,198 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:49:37,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:49:37,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:49:37,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:49:37,199 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-02-02 10:49:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:37,316 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-02-02 10:49:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:49:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:49:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:37,317 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:49:37,317 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:49:37,318 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:49:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:49:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 10:49:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:49:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 10:49:37,323 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-02-02 10:49:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,323 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 10:49:37,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:49:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 10:49:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:49:37,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,324 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-02-02 10:49:37,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:37,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:37,399 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:49:37,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:37,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:49:37,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:37,400 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:49:37,400 INFO L182 omatonBuilderFactory]: Interpolants [756#true, 757#false, 758#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 759#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 760#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:49:37,401 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:49:37,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:49:37,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:49:37,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:49:37,402 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-02-02 10:49:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:37,508 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-02 10:49:37,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:49:37,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:49:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:37,511 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:49:37,511 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:49:37,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:49:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-02-02 10:49:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:49:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-02-02 10:49:37,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-02-02 10:49:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,515 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-02-02 10:49:37,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:49:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-02-02 10:49:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:49:37,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,515 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,515 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-02-02 10:49:37,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:37,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:37,572 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:49:37,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:37,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:49:37,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:37,573 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:49:37,573 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 979#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 980#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:49:37,573 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:49:37,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:49:37,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:49:37,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:49:37,574 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-02-02 10:49:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:37,753 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-02 10:49:37,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:49:37,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:49:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:37,755 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:49:37,755 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:49:37,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:49:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:49:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-02-02 10:49:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:49:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-02-02 10:49:37,761 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-02-02 10:49:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,761 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-02-02 10:49:37,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:49:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-02-02 10:49:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:49:37,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,762 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,762 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-02-02 10:49:37,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:37,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:37,801 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:49:37,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:37,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:49:37,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:37,803 INFO L182 omatonBuilderFactory]: Interpolants [1232#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1233#(= 1 (select |#valid| |main_#t~mem7.base|)), 1229#true, 1230#false, 1231#(= 1 (select |#valid| |main_#t~malloc5.base|))] [2018-02-02 10:49:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:37,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:49:37,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:49:37,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:49:37,804 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-02-02 10:49:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:37,980 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-02 10:49:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:49:37,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:49:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:37,981 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:49:37,981 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:49:37,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:49:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-02-02 10:49:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 10:49:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 10:49:37,985 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-02-02 10:49:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:37,986 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 10:49:37,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:49:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 10:49:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:49:37,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:37,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:37,987 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:49:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-02-02 10:49:37,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:38,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:38,014 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:49:38,017 INFO L168 Benchmark]: Toolchain (without parser) took 2098.63 ms. Allocated memory was 393.2 MB in the beginning and 619.2 MB in the end (delta: 226.0 MB). Free memory was 349.7 MB in the beginning and 573.4 MB in the end (delta: -223.7 MB). Peak memory consumption was 2.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:38,019 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:49:38,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.34 ms. Allocated memory is still 393.2 MB. Free memory was 349.7 MB in the beginning and 337.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:38,019 INFO L168 Benchmark]: Boogie Preprocessor took 34.83 ms. Allocated memory is still 393.2 MB. Free memory was 337.7 MB in the beginning and 336.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:38,019 INFO L168 Benchmark]: RCFGBuilder took 387.30 ms. Allocated memory is still 393.2 MB. Free memory was 336.3 MB in the beginning and 303.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:38,020 INFO L168 Benchmark]: TraceAbstraction took 1477.87 ms. Allocated memory was 393.2 MB in the beginning and 619.2 MB in the end (delta: 226.0 MB). Free memory was 303.2 MB in the beginning and 573.4 MB in the end (delta: -270.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:49:38,021 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.18 ms. Allocated memory is still 393.2 MB. Free memory is still 356.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.34 ms. Allocated memory is still 393.2 MB. Free memory was 349.7 MB in the beginning and 337.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.83 ms. Allocated memory is still 393.2 MB. Free memory was 337.7 MB in the beginning and 336.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 387.30 ms. Allocated memory is still 393.2 MB. Free memory was 336.3 MB in the beginning and 303.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1477.87 ms. Allocated memory was 393.2 MB in the beginning and 619.2 MB in the end (delta: 226.0 MB). Free memory was 303.2 MB in the beginning and 573.4 MB in the end (delta: -270.2 MB). There was no memory consumed. 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/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-49-38-027.csv Received shutdown request...