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_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:08,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:08,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:08,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:08,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:08,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:08,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:08,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:08,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:08,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:08,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:08,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:08,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:08,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:08,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:08,408 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:08,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:08,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:08,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:08,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:08,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:08,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:08,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:08,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:08,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:08,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:08,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:08,419 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:08,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:08,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:08,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:08,420 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:48:08,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:08,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:08,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:08,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:08,432 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:08,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:08,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:08,433 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:08,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:08,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:08,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:08,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:08,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:08,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:08,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:08,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:08,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:08,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:08,438 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:08,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:08,476 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:08,480 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:08,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:08,482 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:08,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 10:48:08,616 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:08,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:08,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:08,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:08,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:08,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08, skipping insertion in model container [2018-02-02 10:48:08,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,644 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:08,681 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:08,772 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:08,786 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:08,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08 WrapperNode [2018-02-02 10:48:08,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:08,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:08,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:08,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:08,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:08,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:08,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:08,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:08,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (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:48:08,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:08,860 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:08,861 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:08,862 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:09,081 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:09,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:09 BoogieIcfgContainer [2018-02-02 10:48:09,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:09,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:09,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:09,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:09,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:08" (1/3) ... [2018-02-02 10:48:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48632052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:09, skipping insertion in model container [2018-02-02 10:48:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (2/3) ... [2018-02-02 10:48:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48632052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:09, skipping insertion in model container [2018-02-02 10:48:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:09" (3/3) ... [2018-02-02 10:48:09,088 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-02 10:48:09,093 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:09,098 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 10:48:09,121 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:09,121 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:09,121 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:09,122 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:09,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:09,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:09,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:09,122 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:09,122 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-02 10:48:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:09,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,142 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:09,142 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-02 10:48:09,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,224 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:09,302 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:48:09,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:09,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,306 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:48:09,306 INFO L182 omatonBuilderFactory]: Interpolants [85#true, 86#false, 87#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:09,306 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:48:09,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:09,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:09,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:09,386 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-02 10:48:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,522 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-02 10:48:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:09,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 10:48:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,533 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:48:09,533 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:48:09,534 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:48:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:48:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-02 10:48:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:48:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-02 10:48:09,567 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-02 10:48:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,568 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-02 10:48:09,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-02 10:48:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:09,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,569 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:09,569 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-02 10:48:09,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,585 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:09,637 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:48:09,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:09,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,638 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:48:09,639 INFO L182 omatonBuilderFactory]: Interpolants [304#true, 305#false, 306#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 307#(and (= 0 |entry_point_#t~ret12.base|) (= 0 |entry_point_#t~ret12.offset|)), 308#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:48:09,639 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:48:09,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:09,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:09,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:09,641 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-02 10:48:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,664 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 10:48:09,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:09,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:48:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,665 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:48:09,665 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:48:09,665 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:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:48:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:48:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:48:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-02 10:48:09,671 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-02 10:48:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,672 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-02 10:48:09,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-02 10:48:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:09,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,673 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:09,673 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-02 10:48:09,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,689 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:09,729 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:48:09,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:09,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,730 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:48:09,730 INFO L182 omatonBuilderFactory]: Interpolants [480#(not (= entry_point_~array~0.base 0)), 475#true, 476#false, 477#(not (= |ldv_malloc_#t~malloc2.base| 0)), 478#(not (= |ldv_malloc_#res.base| 0)), 479#(not (= |entry_point_#t~ret12.base| 0))] [2018-02-02 10:48:09,730 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:48:09,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:09,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:09,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:09,730 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-02 10:48:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,758 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-02 10:48:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:09,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:48:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,760 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:48:09,760 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:48:09,760 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:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:48:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 10:48:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:48:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:48:09,766 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-02 10:48:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,767 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:48:09,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:48:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:09,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,768 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:09,768 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-02 10:48:09,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:09,840 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:48:09,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:09,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,841 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:48:09,841 INFO L182 omatonBuilderFactory]: Interpolants [645#true, 646#false, 647#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 648#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 649#(= 1 (select |#valid| |entry_point_#t~ret12.base|)), 650#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:48:09,841 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:48:09,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:09,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:09,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:09,842 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-02 10:48:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,928 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:48:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:09,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 10:48:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,929 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:48:09,929 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:48:09,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:48:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 10:48:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:48:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 10:48:09,938 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-02 10:48:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,939 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 10:48:09,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 10:48:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:48:09,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,940 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:09,940 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-02 10:48:09,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,962 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:10,167 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:48:10,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:10,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:10,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,168 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:48:10,168 INFO L182 omatonBuilderFactory]: Interpolants [816#(<= 1 |entry_point_#t~ret11|), 817#(and (<= entry_point_~len~0 16777215) (<= 1 entry_point_~len~0)), 818#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 819#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 820#(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|))), 821#(and (<= 4 (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)), 822#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base))), 823#(and (= entry_point_~array~0.offset 0) (<= 4 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~2 0)), 813#true, 814#false, 815#(<= 1 |ldv_positive_#res|)] [2018-02-02 10:48:10,169 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:48:10,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:10,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:10,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:10,169 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-02 10:48:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,391 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-02 10:48:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:10,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-02 10:48:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,392 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:48:10,392 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:48:10,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:48:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-02 10:48:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:48:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 10:48:10,395 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-02 10:48:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,396 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 10:48:10,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 10:48:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:48:10,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:10,397 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-02 10:48:10,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,412 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:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:10,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:10,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,617 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:48:10,617 INFO L182 omatonBuilderFactory]: Interpolants [1008#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1009#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1010#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1011#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1001#true, 1002#false, 1003#(<= entry_point_~len~0 16777215), 1004#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1005#(or (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|))), 1006#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 4294967296) |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1007#(or (<= (+ (select |#length| |entry_point_#t~ret12.base|) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret12.base|)) (= 0 |entry_point_#t~ret12.offset|)))] [2018-02-02 10:48:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:10,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:10,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:10,618 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 11 states. [2018-02-02 10:48:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,872 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 10:48:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:10,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-02 10:48:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,873 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:48:10,873 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:48:10,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:48:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:48:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:48:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:48:10,879 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-02 10:48:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,879 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:48:10,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:48:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:48:10,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,880 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:10,880 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-02 10:48:10,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,894 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:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:10,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:10,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:10,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:10,938 INFO L182 omatonBuilderFactory]: Interpolants [1190#true, 1191#false, 1192#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1193#(and (= 0 |alloc_17_#t~ret4.offset|) (= 0 |alloc_17_#t~ret4.base|)), 1194#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:48:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:10,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:10,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:10,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:10,939 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-02 10:48:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,975 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-02 10:48:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:10,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 10:48:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,977 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:48:10,977 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:48:10,977 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:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:48:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-02 10:48:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:48:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-02 10:48:10,982 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-02 10:48:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,982 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-02 10:48:10,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-02 10:48:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:10,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,985 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:10,985 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-02 10:48:10,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,996 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:11,031 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:11,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:11,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:11,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,032 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:48:11,032 INFO L182 omatonBuilderFactory]: Interpolants [1363#true, 1364#false, 1365#(= 1 (select |#valid| entry_point_~array~0.base)), 1366#(= |#valid| |old(#valid)|), 1367#(= 1 (select |#valid| |free_17_#in~array.base|)), 1368#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:48:11,032 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:11,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:11,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:11,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:11,033 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-02 10:48:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,172 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-02 10:48:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:11,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:48:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,173 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:48:11,173 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:48:11,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:48:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-02 10:48:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:48:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 10:48:11,179 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-02 10:48:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,180 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 10:48:11,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 10:48:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:11,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,181 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,181 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-02 10:48:11,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,192 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:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:11,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:11,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:11,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,249 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:48:11,250 INFO L182 omatonBuilderFactory]: Interpolants [1609#true, 1610#false, 1611#(<= 1 |ldv_positive_#res|), 1612#(<= 1 |entry_point_#t~ret11|), 1613#(<= 1 entry_point_~len~0), 1614#(and (= alloc_17_~i~0 0) (= alloc_17_~len |alloc_17_#in~len|)), 1615#(<= |alloc_17_#in~len| 0)] [2018-02-02 10:48:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:11,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:11,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:11,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:11,250 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-02 10:48:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,296 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-02 10:48:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:11,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-02 10:48:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,297 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:48:11,297 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:48:11,298 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:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:48:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-02 10:48:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:48:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-02 10:48:11,303 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-02 10:48:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,304 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-02 10:48:11,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-02 10:48:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:48:11,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,305 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,305 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-02 10:48:11,307 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,322 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:11,328 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:11,332 INFO L168 Benchmark]: Toolchain (without parser) took 2715.58 ms. Allocated memory was 405.3 MB in the beginning and 637.5 MB in the end (delta: 232.3 MB). Free memory was 359.2 MB in the beginning and 440.5 MB in the end (delta: -81.3 MB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:11,333 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 405.3 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:11,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.83 ms. Allocated memory is still 405.3 MB. Free memory was 359.2 MB in the beginning and 346.0 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:11,335 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 405.3 MB. Free memory was 346.0 MB in the beginning and 344.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:11,336 INFO L168 Benchmark]: RCFGBuilder took 258.19 ms. Allocated memory is still 405.3 MB. Free memory was 343.3 MB in the beginning and 318.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:11,336 INFO L168 Benchmark]: TraceAbstraction took 2249.23 ms. Allocated memory was 405.3 MB in the beginning and 637.5 MB in the end (delta: 232.3 MB). Free memory was 318.0 MB in the beginning and 440.5 MB in the end (delta: -122.5 MB). Peak memory consumption was 109.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:11,338 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.17 ms. Allocated memory is still 405.3 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.83 ms. Allocated memory is still 405.3 MB. Free memory was 359.2 MB in the beginning and 346.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 405.3 MB. Free memory was 346.0 MB in the beginning and 344.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.19 ms. Allocated memory is still 405.3 MB. Free memory was 343.3 MB in the beginning and 318.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2249.23 ms. Allocated memory was 405.3 MB in the beginning and 637.5 MB in the end (delta: 232.3 MB). Free memory was 318.0 MB in the beginning and 440.5 MB in the end (delta: -122.5 MB). Peak memory consumption was 109.7 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_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-11-347.csv Received shutdown request...