java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:58,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:58,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:58,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:58,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:58,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:58,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:58,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:58,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:58,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:58,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:58,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:58,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:58,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:58,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:58,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:58,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:58,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:58,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:58,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:58,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:58,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:58,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:58,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:58,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:58,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:58,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:58,533 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:58,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:58,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:58,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:58,534 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:47:58,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:58,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:58,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:58,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:58,545 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:58,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:58,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:58,546 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:58,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:58,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:58,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:58,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:58,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:58,548 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:58,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:58,586 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:58,589 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:58,590 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:58,591 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:58,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-02 10:47:58,725 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:58,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:58,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:58,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:58,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:58,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58, skipping insertion in model container [2018-02-02 10:47:58,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,753 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:58,789 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:58,876 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:58,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:58,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58 WrapperNode [2018-02-02 10:47:58,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:58,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:58,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:58,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:58,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... [2018-02-02 10:47:58,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:58,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:58,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:58,932 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:58,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:58,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:58,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:58,980 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:58,980 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-02-02 10:47:58,981 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-02-02 10:47:58,981 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:58,981 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:58,981 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-02-02 10:47:58,982 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-02-02 10:47:58,982 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:58,982 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:58,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:58,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:59,255 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:59,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:59 BoogieIcfgContainer [2018-02-02 10:47:59,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:59,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:59,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:59,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:59,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:58" (1/3) ... [2018-02-02 10:47:59,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7a850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:59, skipping insertion in model container [2018-02-02 10:47:59,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:58" (2/3) ... [2018-02-02 10:47:59,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7a850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:59, skipping insertion in model container [2018-02-02 10:47:59,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:59" (3/3) ... [2018-02-02 10:47:59,261 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-02 10:47:59,266 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:59,272 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-02 10:47:59,305 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:59,305 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:59,305 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:59,305 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:59,305 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:59,305 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:59,306 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:59,306 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:59,306 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-02-02 10:47:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:47:59,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:59,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:59,329 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:47:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1784809794, now seen corresponding path program 1 times [2018-02-02 10:47:59,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:59,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:59,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:59,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,499 INFO L182 omatonBuilderFactory]: Interpolants [101#true, 102#false, 103#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:59,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:59,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:59,516 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-02-02 10:47:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:59,807 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2018-02-02 10:47:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:59,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:47:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:59,816 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:47:59,816 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:47:59,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:47:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2018-02-02 10:47:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:47:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-02 10:47:59,851 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2018-02-02 10:47:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:59,852 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-02 10:47:59,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-02 10:47:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:47:59,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:59,854 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:47:59,854 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:47:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1808064800, now seen corresponding path program 1 times [2018-02-02 10:47:59,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:59,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:59,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:59,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,926 INFO L182 omatonBuilderFactory]: Interpolants [352#(not (= 0 |ldv_malloc_#res.base|)), 353#(not (= 0 |entry_point_#t~ret9.base|)), 354#(not (= 0 entry_point_~a10~0.base)), 349#true, 350#false, 351#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:47:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:59,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:59,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:59,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:59,928 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-02-02 10:48:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:00,025 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-02-02 10:48:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:00,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:48:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:00,026 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:48:00,026 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:48:00,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:48:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2018-02-02 10:48:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:48:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-02 10:48:00,033 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 18 [2018-02-02 10:48:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:00,034 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-02 10:48:00,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-02 10:48:00,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:00,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:00,035 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:00,035 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:48:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1556713239, now seen corresponding path program 1 times [2018-02-02 10:48:00,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:00,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:00,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:00,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:00,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:00,088 INFO L182 omatonBuilderFactory]: Interpolants [598#true, 599#false, 600#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 601#(and (= 0 |entry_point_#t~ret9.base|) (= 0 |entry_point_#t~ret9.offset|)), 602#(and (= entry_point_~a10~0.base 0) (= 0 entry_point_~a10~0.offset))] [2018-02-02 10:48:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:00,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:00,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:00,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:00,089 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 5 states. [2018-02-02 10:48:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:00,148 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-02-02 10:48:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:00,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:48:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:00,149 INFO L225 Difference]: With dead ends: 99 [2018-02-02 10:48:00,150 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:48:00,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:48:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-02 10:48:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:48:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-02 10:48:00,156 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 19 [2018-02-02 10:48:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:00,156 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-02 10:48:00,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-02 10:48:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:48:00,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:00,157 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:00,157 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:48:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash 256564149, now seen corresponding path program 1 times [2018-02-02 10:48:00,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:00,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:00,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:48:00,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,214 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 801#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 802#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 803#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 804#(= 1 (select |#valid| entry_point_~a10~0.base)), 805#(= |#valid| |old(#valid)|), 799#true] [2018-02-02 10:48:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:00,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:00,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:00,215 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 7 states. [2018-02-02 10:48:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:00,463 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 10:48:00,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:00,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:48:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:00,464 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:48:00,465 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:48:00,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:48:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-02-02 10:48:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:48:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-02 10:48:00,471 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 21 [2018-02-02 10:48:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:00,472 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-02 10:48:00,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-02 10:48:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:48:00,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:00,473 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:00,473 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:48:00,473 INFO L82 PathProgramCache]: Analyzing trace with hash 256564150, now seen corresponding path program 1 times [2018-02-02 10:48:00,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:00,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:00,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:48:00,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,676 INFO L182 omatonBuilderFactory]: Interpolants [1024#false, 1025#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1026#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 1027#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 1028#(and (<= 4 (select |#length| |entry_point_#t~ret9.base|)) (= 0 |entry_point_#t~ret9.offset|)), 1029#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 1030#(= |old(#length)| |#length|), 1023#true] [2018-02-02 10:48:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:00,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:00,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:00,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:00,676 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 8 states. [2018-02-02 10:48:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:01,061 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-02-02 10:48:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:01,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 10:48:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:01,062 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:48:01,063 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:48:01,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:48:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-02 10:48:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:48:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2018-02-02 10:48:01,073 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 21 [2018-02-02 10:48:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:01,073 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2018-02-02 10:48:01,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2018-02-02 10:48:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:01,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:01,074 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:01,074 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-02 10:48:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900695, now seen corresponding path program 1 times [2018-02-02 10:48:01,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:01,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:01,099 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:48:01,103 INFO L168 Benchmark]: Toolchain (without parser) took 2376.93 ms. Allocated memory was 403.7 MB in the beginning and 632.8 MB in the end (delta: 229.1 MB). Free memory was 360.5 MB in the beginning and 542.7 MB in the end (delta: -182.1 MB). Peak memory consumption was 47.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:01,104 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:01,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.40 ms. Allocated memory is still 403.7 MB. Free memory was 360.5 MB in the beginning and 347.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:01,105 INFO L168 Benchmark]: Boogie Preprocessor took 32.02 ms. Allocated memory is still 403.7 MB. Free memory was 347.3 MB in the beginning and 346.0 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:48:01,105 INFO L168 Benchmark]: RCFGBuilder took 324.57 ms. Allocated memory is still 403.7 MB. Free memory was 346.0 MB in the beginning and 317.4 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:01,105 INFO L168 Benchmark]: TraceAbstraction took 1845.57 ms. Allocated memory was 403.7 MB in the beginning and 632.8 MB in the end (delta: 229.1 MB). Free memory was 317.4 MB in the beginning and 542.7 MB in the end (delta: -225.3 MB). Peak memory consumption was 3.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:01,107 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.40 ms. Allocated memory is still 403.7 MB. Free memory was 360.5 MB in the beginning and 347.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.02 ms. Allocated memory is still 403.7 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 324.57 ms. Allocated memory is still 403.7 MB. Free memory was 346.0 MB in the beginning and 317.4 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1845.57 ms. Allocated memory was 403.7 MB in the beginning and 632.8 MB in the end (delta: 229.1 MB). Free memory was 317.4 MB in the beginning and 542.7 MB in the end (delta: -225.3 MB). Peak memory consumption was 3.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-01-112.csv Received shutdown request...