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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:15:25,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:15:25,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:15:25,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:15:25,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:15:25,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:15:25,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:15:25,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:15:25,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:15:25,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:15:25,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:15:25,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:15:25,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:15:25,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:15:25,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:15:25,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:15:25,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:15:25,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:15:25,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:15:25,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:15:25,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:15:25,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:15:25,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:15:25,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:15:25,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:15:25,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:15:25,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:15:25,515 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:15:25,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:15:25,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:15:25,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:15:25,516 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:15:25,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:15:25,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:15:25,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:15:25,527 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:15:25,527 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:15:25,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:15:25,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:15:25,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:15:25,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:15:25,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:15:25,529 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:15:25,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:15:25,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:15:25,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:15:25,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:15:25,565 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:15:25,568 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:15:25,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:15:25,570 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:15:25,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-02-04 03:15:25,722 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:15:25,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:15:25,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:25,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:15:25,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:15:25,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25, skipping insertion in model container [2018-02-04 03:15:25,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,749 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:25,787 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:25,876 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:25,889 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:25,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25 WrapperNode [2018-02-04 03:15:25,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:25,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:15:25,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:15:25,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:15:25,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (1/1) ... [2018-02-04 03:15:25,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:15:25,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:15:25,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:15:25,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:15:25,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (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-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 03:15:25,956 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-04 03:15:25,957 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:15:25,957 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 03:15:25,957 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:15:25,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:15:26,117 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:15:26,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:26 BoogieIcfgContainer [2018-02-04 03:15:26,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:15:26,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:15:26,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:15:26,120 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:15:26,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:15:25" (1/3) ... [2018-02-04 03:15:26,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ac9e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:26, skipping insertion in model container [2018-02-04 03:15:26,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:25" (2/3) ... [2018-02-04 03:15:26,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ac9e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:26, skipping insertion in model container [2018-02-04 03:15:26,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:26" (3/3) ... [2018-02-04 03:15:26,123 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-02-04 03:15:26,128 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:15:26,133 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 03:15:26,163 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:15:26,163 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:15:26,163 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:15:26,163 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:15:26,163 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:15:26,163 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:15:26,163 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:15:26,163 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:15:26,164 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:15:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 03:15:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:15:26,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:26,179 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-04 03:15:26,179 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2071706780, now seen corresponding path program 1 times [2018-02-04 03:15:26,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:26,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:26,366 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-04 03:15:26,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:26,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:26,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:26,370 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-04 03:15:26,371 INFO L182 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 61#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 62#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset))] [2018-02-04 03:15:26,371 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-04 03:15:26,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:15:26,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:15:26,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:26,387 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-02-04 03:15:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:26,491 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 03:15:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:26,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 03:15:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:26,498 INFO L225 Difference]: With dead ends: 61 [2018-02-04 03:15:26,499 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 03:15:26,500 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-04 03:15:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 03:15:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 03:15:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 03:15:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 03:15:26,524 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-02-04 03:15:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:26,524 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 03:15:26,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:15:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 03:15:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:15:26,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:26,525 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-04 03:15:26,525 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -776458562, now seen corresponding path program 1 times [2018-02-04 03:15:26,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:26,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:26,584 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-04 03:15:26,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:26,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:26,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:26,585 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-04 03:15:26,585 INFO L182 omatonBuilderFactory]: Interpolants [180#true, 181#false, 182#(= 0 |ldv_malloc_#t~malloc1.offset|), 183#(= 0 |ldv_malloc_#res.offset|), 184#(= 0 |probe1_6_#t~ret4.offset|), 185#(= 0 probe1_6_~p~0.offset)] [2018-02-04 03:15:26,585 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-04 03:15:26,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:26,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:26,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:26,587 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-02-04 03:15:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:26,625 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-02-04 03:15:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:15:26,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:15:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:26,627 INFO L225 Difference]: With dead ends: 55 [2018-02-04 03:15:26,627 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 03:15:26,628 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-04 03:15:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 03:15:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 03:15:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 03:15:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 03:15:26,633 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2018-02-04 03:15:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:26,634 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 03:15:26,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 03:15:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:15:26,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:26,635 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-04 03:15:26,635 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -776458561, now seen corresponding path program 1 times [2018-02-04 03:15:26,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:26,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:26,705 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-04 03:15:26,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:26,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:26,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:26,707 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-04 03:15:26,707 INFO L182 omatonBuilderFactory]: Interpolants [298#true, 299#false, 300#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 301#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 302#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 303#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-04 03:15:26,707 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-04 03:15:26,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:26,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:26,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:26,708 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 03:15:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:26,784 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-02-04 03:15:26,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:26,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 03:15:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:26,785 INFO L225 Difference]: With dead ends: 56 [2018-02-04 03:15:26,785 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 03:15:26,785 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-04 03:15:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 03:15:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-04 03:15:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 03:15:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 03:15:26,790 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 25 [2018-02-04 03:15:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:26,790 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 03:15:26,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 03:15:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:15:26,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:26,791 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-04 03:15:26,791 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1521421354, now seen corresponding path program 1 times [2018-02-04 03:15:26,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:26,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:26,881 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-04 03:15:26,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:26,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:15:26,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:26,882 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-04 03:15:26,882 INFO L182 omatonBuilderFactory]: Interpolants [416#true, 417#false, 418#(= |#valid| |old(#valid)|), 419#(and (= |#valid| (store |old(#valid)| |entry_point_~#a7~0.base| (select |#valid| |entry_point_~#a7~0.base|))) (= (select |old(#valid)| |entry_point_~#a7~0.base|) 0))] [2018-02-04 03:15:26,882 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-04 03:15:26,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:15:26,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:15:26,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:15:26,883 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-02-04 03:15:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:26,957 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 03:15:26,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:26,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-04 03:15:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:26,959 INFO L225 Difference]: With dead ends: 64 [2018-02-04 03:15:26,959 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:15:26,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:15:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 03:15:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 03:15:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 03:15:26,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 25 [2018-02-04 03:15:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:26,967 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 03:15:26,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:15:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 03:15:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:15:26,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:26,968 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, 1, 1] [2018-02-04 03:15:26,968 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1580819832, now seen corresponding path program 1 times [2018-02-04 03:15:26,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:26,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:27,018 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-04 03:15:27,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:27,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:15:27,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:27,019 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-04 03:15:27,020 INFO L182 omatonBuilderFactory]: Interpolants [536#true, 537#false, 538#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 539#(not (= 0 |ldv_malloc_#res.base|)), 540#(not (= 0 |probe1_6_#t~ret4.base|)), 541#(not (= 0 probe1_6_~p~0.base))] [2018-02-04 03:15:27,020 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-04 03:15:27,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:27,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:27,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:27,021 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2018-02-04 03:15:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:27,047 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 03:15:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:27,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 03:15:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:27,049 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:15:27,049 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:15:27,049 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-04 03:15:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:15:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 03:15:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 03:15:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-02-04 03:15:27,053 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 27 [2018-02-04 03:15:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:27,053 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-02-04 03:15:27,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-02-04 03:15:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:15:27,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:27,054 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:27,054 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash -693357389, now seen corresponding path program 1 times [2018-02-04 03:15:27,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:27,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:27,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-04 03:15:27,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:27,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:15:27,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:27,170 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-04 03:15:27,171 INFO L182 omatonBuilderFactory]: Interpolants [644#true, 645#false, 646#(= 1 (select |#valid| |entry_point_~#a7~0.base|)), 647#(= 1 (select |#valid| |probe1_6_#in~a.base|)), 648#(= 1 (select |#valid| probe1_6_~a.base)), 649#(= |#valid| |old(#valid)|), 650#(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|)), 651#(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-04 03:15:27,171 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-04 03:15:27,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:15:27,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:15:27,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:15:27,172 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 8 states. [2018-02-04 03:15:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:27,387 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-02-04 03:15:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:15:27,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 03:15:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:27,388 INFO L225 Difference]: With dead ends: 55 [2018-02-04 03:15:27,388 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 03:15:27,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:15:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 03:15:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-04 03:15:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 03:15:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 03:15:27,393 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 31 [2018-02-04 03:15:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:27,394 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 03:15:27,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:15:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 03:15:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:15:27,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:27,395 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, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:27,395 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -693357388, now seen corresponding path program 1 times [2018-02-04 03:15:27,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:27,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:27,523 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-04 03:15:27,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:27,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:15:27,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:27,524 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-04 03:15:27,524 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (= (select |#valid| probe1_6_~a.base) 1) (= probe1_6_~a.offset 0) (= 4 (select |#length| probe1_6_~a.base))), 769#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 770#(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|))), 771#(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|))))), 772#(and (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0)), 764#true, 765#false, 766#(and (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= 0 |entry_point_~#a7~0.offset|) (= 4 (select |#length| |entry_point_~#a7~0.base|))), 767#(and (= (select |#valid| |probe1_6_#in~a.base|) 1) (= 4 (select |#length| |probe1_6_#in~a.base|)) (= 0 |probe1_6_#in~a.offset|))] [2018-02-04 03:15:27,524 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-04 03:15:27,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:15:27,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:15:27,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:15:27,525 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 9 states. [2018-02-04 03:15:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:27,749 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 03:15:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:27,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 03:15:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:27,751 INFO L225 Difference]: With dead ends: 50 [2018-02-04 03:15:27,751 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 03:15:27,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:15:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 03:15:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-02-04 03:15:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 03:15:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 03:15:27,754 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 31 [2018-02-04 03:15:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:27,755 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 03:15:27,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:15:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 03:15:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:15:27,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:27,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:27,756 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1580514095, now seen corresponding path program 1 times [2018-02-04 03:15:27,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:27,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:27,952 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-04 03:15:27,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:27,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:15:27,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:27,952 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-04 03:15:27,953 INFO L182 omatonBuilderFactory]: Interpolants [881#true, 882#false, 883#(= |#valid| |old(#valid)|), 884#(and (= 0 (select |old(#valid)| |entry_point_~#a7~0.base|)) (= (select |#valid| |entry_point_~#a7~0.base|) 1) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|)))), 885#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 886#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 887#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= (store |#valid| |probe1_6_#t~ret4.base| 0) |old(#valid)|)), 888#(and (= |old(#valid)| (store |#valid| probe1_6_~p~0.base 0)) (not (= 0 probe1_6_~p~0.base))), 889#(and (= (select (store |#valid| |entry_point_~#a7~0.base| 0) |entry_point_~#a7~0.base|) (select |old(#valid)| |entry_point_~#a7~0.base|)) (= |old(#valid)| (store |#valid| |entry_point_~#a7~0.base| (select |old(#valid)| |entry_point_~#a7~0.base|))))] [2018-02-04 03:15:27,953 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-04 03:15:27,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:15:27,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:15:27,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:15:27,953 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 9 states. [2018-02-04 03:15:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:28,080 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-02-04 03:15:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:15:28,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 03:15:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:28,080 INFO L225 Difference]: With dead ends: 58 [2018-02-04 03:15:28,080 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 03:15:28,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:15:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 03:15:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 03:15:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 03:15:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 03:15:28,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 35 [2018-02-04 03:15:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:28,083 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 03:15:28,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:15:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 03:15:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:15:28,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:28,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:28,083 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 720787466, now seen corresponding path program 1 times [2018-02-04 03:15:28,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:28,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:28,120 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-04 03:15:28,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:28,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:28,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:28,120 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-04 03:15:28,121 INFO L182 omatonBuilderFactory]: Interpolants [1000#true, 1001#false, 1002#(= 0 |probe1_6_#res|), 1003#(= 0 |entry_point_#t~ret8|), 1004#(= entry_point_~ret~1 0)] [2018-02-04 03:15:28,121 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-04 03:15:28,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:15:28,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:15:28,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:28,121 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-02-04 03:15:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:28,134 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-02-04 03:15:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:28,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 03:15:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:28,136 INFO L225 Difference]: With dead ends: 46 [2018-02-04 03:15:28,136 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 03:15:28,136 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-04 03:15:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 03:15:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 03:15:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 03:15:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-02-04 03:15:28,139 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-02-04 03:15:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:28,139 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-02-04 03:15:28,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:15:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-02-04 03:15:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:15:28,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:28,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:28,140 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 03:15:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1114160435, now seen corresponding path program 1 times [2018-02-04 03:15:28,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:28,181 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:15:28,190 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:15:28,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:28 BoogieIcfgContainer [2018-02-04 03:15:28,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:15:28,199 INFO L168 Benchmark]: Toolchain (without parser) took 2476.71 ms. Allocated memory was 400.0 MB in the beginning and 627.6 MB in the end (delta: 227.5 MB). Free memory was 354.0 MB in the beginning and 445.6 MB in the end (delta: -91.6 MB). Peak memory consumption was 135.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:28,200 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:15:28,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.18 ms. Allocated memory is still 400.0 MB. Free memory was 354.0 MB in the beginning and 340.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:28,200 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 400.0 MB. Free memory was 340.8 MB in the beginning and 339.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:28,201 INFO L168 Benchmark]: RCFGBuilder took 197.38 ms. Allocated memory is still 400.0 MB. Free memory was 339.5 MB in the beginning and 319.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:28,201 INFO L168 Benchmark]: TraceAbstraction took 2080.41 ms. Allocated memory was 400.0 MB in the beginning and 627.6 MB in the end (delta: 227.5 MB). Free memory was 319.6 MB in the beginning and 445.6 MB in the end (delta: -126.0 MB). Peak memory consumption was 101.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:28,201 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.14 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.18 ms. Allocated memory is still 400.0 MB. Free memory was 354.0 MB in the beginning and 340.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 400.0 MB. Free memory was 340.8 MB in the beginning and 339.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 197.38 ms. Allocated memory is still 400.0 MB. Free memory was 339.5 MB in the beginning and 319.6 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2080.41 ms. Allocated memory was 400.0 MB in the beginning and 627.6 MB in the end (delta: 227.5 MB). Free memory was 319.6 MB in the beginning and 445.6 MB in the end (delta: -126.0 MB). Peak memory consumption was 101.6 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: 1473]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1473. Possible FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={7:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_malloc(sizeof(int))={6:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=3] [L1447] CALL, EXPR f6() [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, f6()=0, p={6:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1450] CALL, EXPR g6() [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, g6()=0, p={6:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, p={6:0}, ret=0] [L1467] EXPR probe1_6(&a7) VAL [a7={7:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); [L1468] COND TRUE ret==0 VAL [a7={7:0}, ret=0] [L1469] RET, FCALL disconnect_2_6(&a7) VAL [a7={7:0}, ret=0] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 55 locations, 5 error locations. UNSAFE Result, 2.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 420 SDtfs, 155 SDslu, 1215 SDs, 0 SdLazy, 698 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 28198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-15-28-206.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-15-28-206.csv Received shutdown request...