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_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:19:21,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:19:21,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:19:21,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:19:21,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:19:21,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:19:21,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:19:21,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:19:21,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:19:21,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:19:21,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:19:21,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:19:21,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:19:21,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:19:21,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:19:21,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:19:21,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:19:21,207 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:19:21,208 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:19:21,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:19:21,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:19:21,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:19:21,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:19:21,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:19:21,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:19:21,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:19:21,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:19:21,213 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:19:21,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:19:21,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:19:21,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:19:21,214 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_Array.epf [2018-02-02 10:19:21,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:19:21,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:19:21,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:19:21,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:19:21,225 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:19:21,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:19:21,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:19:21,226 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:19:21,227 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:19:21,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:19:21,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:19:21,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:19:21,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:19:21,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:19:21,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:19:21,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:21,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:19:21,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:19:21,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:19:21,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:19:21,273 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:19:21,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:19:21,274 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:19:21,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-02 10:19:21,424 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:19:21,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:19:21,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:21,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:19:21,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:19:21,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21, skipping insertion in model container [2018-02-02 10:19:21,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,451 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:21,489 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:21,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:21,585 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:21,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21 WrapperNode [2018-02-02 10:19:21,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:21,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:19:21,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:19:21,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:19:21,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (1/1) ... [2018-02-02 10:19:21,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:19:21,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:19:21,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:19:21,624 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:19:21,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (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:19:21,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:19:21,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:19:21,663 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:19:21,663 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:19:21,663 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:19:21,663 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:19:21,663 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:19:21,663 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:19:21,663 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:19:21,664 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:19:21,832 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:19:21,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:21 BoogieIcfgContainer [2018-02-02 10:19:21,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:19:21,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:19:21,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:19:21,837 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:19:21,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:19:21" (1/3) ... [2018-02-02 10:19:21,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c819c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:21, skipping insertion in model container [2018-02-02 10:19:21,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:21" (2/3) ... [2018-02-02 10:19:21,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c819c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:21, skipping insertion in model container [2018-02-02 10:19:21,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:21" (3/3) ... [2018-02-02 10:19:21,839 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-02 10:19:21,846 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:19:21,851 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-02 10:19:21,888 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:19:21,889 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:19:21,889 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:19:21,889 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:19:21,889 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:19:21,889 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:19:21,889 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:19:21,889 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:19:21,890 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:19:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-02-02 10:19:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:19:21,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:21,912 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:21,912 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-02-02 10:19:21,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:21,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,051 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:19:22,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:19:22,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,056 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:19:22,056 INFO L182 omatonBuilderFactory]: Interpolants [48#(= |#valid| |old(#valid)|), 46#true, 47#false] [2018-02-02 10:19:22,056 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:19:22,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:19:22,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:19:22,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:22,067 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-02-02 10:19:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,190 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-02 10:19:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:19:22,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:19:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,199 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:19:22,200 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 10:19:22,201 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:19:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 10:19:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-02-02 10:19:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:19:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-02-02 10:19:22,226 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-02-02 10:19:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,226 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-02-02 10:19:22,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:19:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-02-02 10:19:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:22,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,228 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,228 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-02-02 10:19:22,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,285 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:19:22,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:22,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,286 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:19:22,286 INFO L182 omatonBuilderFactory]: Interpolants [176#(not (= 0 entry_point_~array~0.base)), 171#true, 172#false, 173#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 174#(not (= 0 |ldv_malloc_#res.base|)), 175#(not (= 0 |entry_point_#t~ret2.base|))] [2018-02-02 10:19:22,286 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:19:22,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:22,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:22,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:22,288 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-02-02 10:19:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,361 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-02-02 10:19:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:22,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:19:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,363 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:19:22,363 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:19:22,364 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:19:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:19:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-02-02 10:19:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:19:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-02 10:19:22,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-02-02 10:19:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,371 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-02 10:19:22,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-02 10:19:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:19:22,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,372 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,372 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-02-02 10:19:22,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,424 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:19:22,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:22,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,425 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:19:22,425 INFO L182 omatonBuilderFactory]: Interpolants [309#true, 310#false, 311#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 312#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 313#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:19:22,425 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:19:22,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:22,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:22,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:22,426 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-02-02 10:19:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,448 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 10:19:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:22,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:19:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,449 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:19:22,449 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:19:22,450 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:19:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:19:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 10:19:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:19:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 10:19:22,453 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-02 10:19:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,453 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 10:19:22,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 10:19:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:19:22,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,454 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,454 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-02-02 10:19:22,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,508 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:19:22,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:22,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,509 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:19:22,509 INFO L182 omatonBuilderFactory]: Interpolants [400#true, 401#false, 402#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 403#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 404#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 405#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:19:22,509 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:19:22,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:22,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:22,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:22,510 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-02-02 10:19:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,579 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-02 10:19:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:22,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:19:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,580 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:19:22,580 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:19:22,580 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:19:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:19:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 10:19:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 10:19:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-02 10:19:22,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-02-02 10:19:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,583 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-02 10:19:22,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-02 10:19:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:19:22,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,583 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-02-02 10:19:22,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,624 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:19:22,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:22,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,625 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:19:22,625 INFO L182 omatonBuilderFactory]: Interpolants [503#true, 504#false, 505#(<= 10 entry_point_~len~0), 506#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:19:22,625 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:19:22,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:22,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:22,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:22,626 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-02-02 10:19:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,651 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-02-02 10:19:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:19:22,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:19:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,652 INFO L225 Difference]: With dead ends: 68 [2018-02-02 10:19:22,652 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 10:19:22,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 10:19:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-02-02 10:19:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:19:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-02 10:19:22,655 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-02-02 10:19:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,655 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-02 10:19:22,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-02 10:19:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:19:22,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,656 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] [2018-02-02 10:19:22,656 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-02-02 10:19:22,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:22,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:22,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:19:22,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,692 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:19:22,692 INFO L182 omatonBuilderFactory]: Interpolants [624#false, 625#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 626#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 627#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset)), 623#true] [2018-02-02 10:19:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:22,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:22,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:22,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:22,692 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-02-02 10:19:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:22,701 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-02-02 10:19:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:22,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 10:19:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:22,702 INFO L225 Difference]: With dead ends: 62 [2018-02-02 10:19:22,702 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 10:19:22,702 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:19:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 10:19:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-02-02 10:19:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:19:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-02 10:19:22,705 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-02-02 10:19:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:22,705 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-02 10:19:22,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-02 10:19:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:19:22,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:22,706 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:22,706 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-02-02 10:19:22,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:22,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:22,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:22,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:22,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:22,829 INFO L182 omatonBuilderFactory]: Interpolants [740#true, 741#false, 742#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 743#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 744#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 745#(= 1 (select |#valid| entry_point_~array~0.base)), 746#(= |#valid| |old(#valid)|), 747#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 748#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:19:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:22,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:22,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:22,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:22,830 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-02 10:19:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:23,029 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-02-02 10:19:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:23,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:19:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:23,031 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:19:23,031 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:19:23,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:19:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-02-02 10:19:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:19:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-02 10:19:23,040 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-02 10:19:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:23,040 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-02 10:19:23,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-02 10:19:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:19:23,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:23,041 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:23,041 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-02-02 10:19:23,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:23,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:23,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:23,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:19:23,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:23,320 INFO L182 omatonBuilderFactory]: Interpolants [880#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 881#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 882#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 883#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 884#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 873#true, 874#false, 875#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 876#(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))), 877#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 878#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 879#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1))] [2018-02-02 10:19:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:23,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:19:23,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:19:23,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:23,321 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 12 states. [2018-02-02 10:19:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:23,676 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-02 10:19:23,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:19:23,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 10:19:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:23,677 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:19:23,677 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:19:23,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:19:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:19:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 52. [2018-02-02 10:19:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:19:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-02 10:19:23,681 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 28 [2018-02-02 10:19:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:23,681 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-02 10:19:23,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:19:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-02 10:19:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:19:23,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:23,682 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:19:23,682 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 652258778, now seen corresponding path program 1 times [2018-02-02 10:19:23,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:23,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:23,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:23,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:23,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:23,707 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:19:23,708 INFO L182 omatonBuilderFactory]: Interpolants [1047#true, 1048#false, 1049#(= entry_point_~i~0 0), 1050#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 10:19:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:19:23,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:23,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:23,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:23,709 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 4 states. [2018-02-02 10:19:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:23,729 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-02-02 10:19:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:23,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:19:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:23,730 INFO L225 Difference]: With dead ends: 60 [2018-02-02 10:19:23,730 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 10:19:23,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 10:19:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-02 10:19:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:19:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-02-02 10:19:23,734 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 29 [2018-02-02 10:19:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:23,735 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-02-02 10:19:23,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-02-02 10:19:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:19:23,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:23,736 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, 1, 1] [2018-02-02 10:19:23,736 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:19:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash -244587327, now seen corresponding path program 1 times [2018-02-02 10:19:23,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:19:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:19:23,772 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:19:23,780 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 10:19:23,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:19:23 BoogieIcfgContainer [2018-02-02 10:19:23,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:19:23,790 INFO L168 Benchmark]: Toolchain (without parser) took 2366.04 ms. Allocated memory was 394.8 MB in the beginning and 619.7 MB in the end (delta: 224.9 MB). Free memory was 351.5 MB in the beginning and 472.3 MB in the end (delta: -120.8 MB). Peak memory consumption was 104.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:23,791 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:19:23,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.55 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 338.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:19:23,791 INFO L168 Benchmark]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 394.8 MB. Free memory was 338.3 MB in the beginning and 336.9 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:19:23,792 INFO L168 Benchmark]: RCFGBuilder took 209.04 ms. Allocated memory is still 394.8 MB. Free memory was 336.9 MB in the beginning and 318.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:23,792 INFO L168 Benchmark]: TraceAbstraction took 1956.09 ms. Allocated memory was 394.8 MB in the beginning and 619.7 MB in the end (delta: 224.9 MB). Free memory was 318.3 MB in the beginning and 472.3 MB in the end (delta: -153.9 MB). Peak memory consumption was 71.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:23,793 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.15 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.55 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 338.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.98 ms. Allocated memory is still 394.8 MB. Free memory was 338.3 MB in the beginning and 336.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.04 ms. Allocated memory is still 394.8 MB. Free memory was 336.9 MB in the beginning and 318.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1956.09 ms. Allocated memory was 394.8 MB in the beginning and 619.7 MB in the end (delta: 224.9 MB). Free memory was 318.3 MB in the beginning and 472.3 MB in the end (delta: -153.9 MB). Peak memory consumption was 71.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1458]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1458. Possible FailurePath: [L1459] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; [L1443] int j; VAL [array={42:0}, i=0, len=10] [L1444] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1445] COND TRUE i=0) VAL [array={42:0}, i=0, j=-1, len=10, p={0:0}] [L1459] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. UNSAFE Result, 1.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 364 SDtfs, 327 SDslu, 985 SDs, 0 SdLazy, 576 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 13/20 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 130 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 20363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 13/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-19-23-799.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-19-23-799.csv Received shutdown request...