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_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:29:17,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:29:17,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:29:17,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:29:17,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:29:17,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:29:17,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:29:17,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:29:17,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:29:17,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:29:17,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:29:17,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:29:17,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:29:17,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:29:17,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:29:17,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:29:17,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:29:17,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:29:17,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:29:17,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:29:17,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:29:17,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:29:17,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:29:17,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:29:17,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:29:17,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:29:17,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:29:17,361 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:29:17,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:29:17,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:29:17,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:29:17,362 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 16:29:17,371 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:29:17,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:29:17,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:29:17,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:29:17,373 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:29:17,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:29:17,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:29:17,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:29:17,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:29:17,410 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:29:17,412 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:29:17,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:29:17,413 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:29:17,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 16:29:17,543 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:29:17,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:29:17,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:29:17,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:29:17,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:29:17,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,551 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 04:29:17, skipping insertion in model container [2018-02-04 16:29:17,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,561 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:29:17,595 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:29:17,679 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:29:17,693 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:29:17,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17 WrapperNode [2018-02-04 16:29:17,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:29:17,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:29:17,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:29:17,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:29:17,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (1/1) ... [2018-02-04 16:29:17,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:29:17,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:29:17,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:29:17,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:29:17,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (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 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:29:17,765 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:29:17,765 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:29:17,766 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:29:17,767 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:29:17,767 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:29:17,904 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:29:17,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:29:17 BoogieIcfgContainer [2018-02-04 16:29:17,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:29:17,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:29:17,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:29:17,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:29:17,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:29:17" (1/3) ... [2018-02-04 16:29:17,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ee958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:29:17, skipping insertion in model container [2018-02-04 16:29:17,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:17" (2/3) ... [2018-02-04 16:29:17,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ee958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:29:17, skipping insertion in model container [2018-02-04 16:29:17,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:29:17" (3/3) ... [2018-02-04 16:29:17,909 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-02-04 16:29:17,915 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:29:17,919 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 16:29:17,955 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:29:17,955 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:29:17,955 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:29:17,955 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:29:17,956 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:29:17,956 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:29:17,956 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:29:17,956 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:29:17,957 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:29:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 16:29:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 16:29:17,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:17,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 16:29:17,978 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 3053611, now seen corresponding path program 1 times [2018-02-04 16:29:18,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,111 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 16:29:18,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:29:18,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,114 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 16:29:18,114 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| |~#a6.base|)), 62#true, 63#false] [2018-02-04 16:29:18,114 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 16:29:18,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:29:18,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:29:18,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:29:18,125 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-02-04 16:29:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,190 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 16:29:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:29:18,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 16:29:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,246 INFO L225 Difference]: With dead ends: 68 [2018-02-04 16:29:18,246 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 16:29:18,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 16:29:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 16:29:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-02-04 16:29:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:29:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-02-04 16:29:18,268 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 4 [2018-02-04 16:29:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,268 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-02-04 16:29:18,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:29:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-02-04 16:29:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 16:29:18,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 16:29:18,269 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 3053612, now seen corresponding path program 1 times [2018-02-04 16:29:18,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,320 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 16:29:18,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:29:18,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,321 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 16:29:18,321 INFO L182 omatonBuilderFactory]: Interpolants [197#true, 198#false, 199#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-04 16:29:18,321 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 16:29:18,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:29:18,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:29:18,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:29:18,322 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 3 states. [2018-02-04 16:29:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,375 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-04 16:29:18,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:29:18,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 16:29:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,377 INFO L225 Difference]: With dead ends: 110 [2018-02-04 16:29:18,377 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 16:29:18,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 16:29:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 16:29:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-02-04 16:29:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 16:29:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-02-04 16:29:18,387 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 4 [2018-02-04 16:29:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,387 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-02-04 16:29:18,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:29:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-02-04 16:29:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:29:18,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,389 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] [2018-02-04 16:29:18,389 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1645066521, now seen corresponding path program 1 times [2018-02-04 16:29:18,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,466 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 16:29:18,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:18,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,467 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 16:29:18,467 INFO L182 omatonBuilderFactory]: Interpolants [411#true, 412#false, 413#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 414#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|)), 415#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset))] [2018-02-04 16:29:18,468 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 16:29:18,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:29:18,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:29:18,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:18,468 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 5 states. [2018-02-04 16:29:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,489 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-04 16:29:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:29:18,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 16:29:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,492 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:29:18,492 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 16:29:18,492 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 16:29:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 16:29:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-02-04 16:29:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:29:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-02-04 16:29:18,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 24 [2018-02-04 16:29:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,496 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-02-04 16:29:18,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:29:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-02-04 16:29:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:29:18,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,497 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] [2018-02-04 16:29:18,497 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash 995391925, now seen corresponding path program 1 times [2018-02-04 16:29:18,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,556 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 16:29:18,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:29:18,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,557 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 16:29:18,557 INFO L182 omatonBuilderFactory]: Interpolants [570#true, 571#false, 572#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 573#(not (= 0 |ldv_malloc_#res.base|)), 574#(not (= 0 |probe1_6_#t~ret4.base|)), 575#(not (= 0 probe1_6_~p~0.base))] [2018-02-04 16:29:18,557 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 16:29:18,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:18,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:18,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:18,558 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2018-02-04 16:29:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,585 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-04 16:29:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:29:18,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 16:29:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,587 INFO L225 Difference]: With dead ends: 76 [2018-02-04 16:29:18,587 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 16:29:18,587 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 16:29:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 16:29:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 16:29:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 16:29:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-02-04 16:29:18,591 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 24 [2018-02-04 16:29:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,592 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-02-04 16:29:18,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-02-04 16:29:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 16:29:18,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,592 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] [2018-02-04 16:29:18,592 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763835, now seen corresponding path program 1 times [2018-02-04 16:29:18,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,641 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 16:29:18,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:18,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,642 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 16:29:18,642 INFO L182 omatonBuilderFactory]: Interpolants [730#true, 731#false, 732#(= 0 |ldv_malloc_#t~malloc1.offset|), 733#(= 0 |ldv_malloc_#res.offset|), 734#(= 0 |probe1_6_#t~ret4.offset|), 735#(= 0 probe1_6_~p~0.offset)] [2018-02-04 16:29:18,642 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 16:29:18,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:18,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:18,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:18,643 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-02-04 16:29:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,665 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-04 16:29:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:29:18,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 16:29:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,666 INFO L225 Difference]: With dead ends: 75 [2018-02-04 16:29:18,667 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 16:29:18,667 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 16:29:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 16:29:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 16:29:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 16:29:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-04 16:29:18,672 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 26 [2018-02-04 16:29:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,672 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-04 16:29:18,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-04 16:29:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 16:29:18,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,673 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:18,673 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1433763836, now seen corresponding path program 1 times [2018-02-04 16:29:18,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,735 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 16:29:18,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:18,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,736 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 16:29:18,736 INFO L182 omatonBuilderFactory]: Interpolants [888#true, 889#false, 890#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 891#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 892#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 893#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-04 16:29:18,736 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 16:29:18,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:18,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:18,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:18,737 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 6 states. [2018-02-04 16:29:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,799 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-04 16:29:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:29:18,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 16:29:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,801 INFO L225 Difference]: With dead ends: 74 [2018-02-04 16:29:18,801 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 16:29:18,801 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 16:29:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 16:29:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 16:29:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 16:29:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-04 16:29:18,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 26 [2018-02-04 16:29:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,806 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-04 16:29:18,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-04 16:29:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 16:29:18,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,807 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 16:29:18,807 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash -772946127, now seen corresponding path program 1 times [2018-02-04 16:29:18,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:29:18,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:18,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:29:18,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:18,842 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 16:29:18,842 INFO L182 omatonBuilderFactory]: Interpolants [1044#true, 1045#false, 1046#(= |#valid| |old(#valid)|)] [2018-02-04 16:29:18,843 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 16:29:18,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:29:18,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:29:18,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:29:18,843 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 3 states. [2018-02-04 16:29:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:18,883 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 16:29:18,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:29:18,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-04 16:29:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:18,886 INFO L225 Difference]: With dead ends: 77 [2018-02-04 16:29:18,886 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 16:29:18,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-04 16:29:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 16:29:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 16:29:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:29:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 16:29:18,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2018-02-04 16:29:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:18,890 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 16:29:18,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:29:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 16:29:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:29:18,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:18,896 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] [2018-02-04 16:29:18,896 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706416, now seen corresponding path program 1 times [2018-02-04 16:29:18,898 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:18,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:19,017 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 16:29:19,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:19,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:29:19,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:19,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 16:29:19,018 INFO L182 omatonBuilderFactory]: Interpolants [1185#true, 1186#false, 1187#(= 1 (select |#valid| |~#a6.base|)), 1188#(= 1 (select |#valid| |probe1_6_#in~a.base|)), 1189#(= 1 (select |#valid| probe1_6_~a.base)), 1190#(= |#valid| |old(#valid)|), 1191#(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|)), 1192#(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 16:29:19,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 16:29:19,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:29:19,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:29:19,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:29:19,019 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2018-02-04 16:29:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:19,236 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 16:29:19,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:29:19,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 16:29:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:19,237 INFO L225 Difference]: With dead ends: 65 [2018-02-04 16:29:19,237 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 16:29:19,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:29:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 16:29:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-04 16:29:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:29:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 16:29:19,241 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 32 [2018-02-04 16:29:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:19,242 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 16:29:19,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:29:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 16:29:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:29:19,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:19,243 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] [2018-02-04 16:29:19,243 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1279706417, now seen corresponding path program 1 times [2018-02-04 16:29:19,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:19,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:19,406 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 16:29:19,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:19,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 16:29:19,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:19,407 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 16:29:19,407 INFO L182 omatonBuilderFactory]: Interpolants [1331#true, 1332#false, 1333#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|))), 1334#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|)) (= (select |#valid| |~#a6.base|) 1)), 1335#(and (= (select |#valid| |probe1_6_#in~a.base|) 1) (= 4 (select |#length| |probe1_6_#in~a.base|)) (= 0 |probe1_6_#in~a.offset|)), 1336#(and (= (select |#valid| probe1_6_~a.base) 1) (= probe1_6_~a.offset 0) (= 4 (select |#length| probe1_6_~a.base))), 1337#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1338#(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|))), 1339#(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|))))), 1340#(and (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0))] [2018-02-04 16:29:19,407 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 16:29:19,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:29:19,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:29:19,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:29:19,408 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-02-04 16:29:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:19,797 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-02-04 16:29:19,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 16:29:19,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 16:29:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:19,798 INFO L225 Difference]: With dead ends: 58 [2018-02-04 16:29:19,798 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 16:29:19,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:29:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 16:29:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 16:29:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 16:29:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 16:29:19,801 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 32 [2018-02-04 16:29:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:19,802 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 16:29:19,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:29:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 16:29:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 16:29:19,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:19,803 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] [2018-02-04 16:29:19,803 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2490893, now seen corresponding path program 1 times [2018-02-04 16:29:19,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:19,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:20,004 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 16:29:20,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:20,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:29:20,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:20,005 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 16:29:20,005 INFO L182 omatonBuilderFactory]: Interpolants [1478#true, 1479#false, 1480#(= 1 (select |#valid| |~#a6.base|)), 1481#(= |#valid| |old(#valid)|), 1482#(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)), 1483#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1484#(and (not (= 0 |probe1_6_#t~ret4.base|)) (or (= |#valid| |old(#valid)|) (= |probe1_6_#t~ret4.base| (@diff |old(#valid)| |#valid|))) (= (select |old(#valid)| |probe1_6_#t~ret4.base|) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1485#(and (or (= probe1_6_~p~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= (select |old(#valid)| probe1_6_~p~0.base) 0) (not (= 0 probe1_6_~p~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 16:29:20,005 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 16:29:20,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:29:20,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:29:20,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:29:20,006 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-02-04 16:29:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:20,255 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 16:29:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:29:20,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-04 16:29:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:20,257 INFO L225 Difference]: With dead ends: 60 [2018-02-04 16:29:20,258 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 16:29:20,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:29:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 16:29:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 16:29:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 16:29:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 16:29:20,261 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2018-02-04 16:29:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:20,261 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 16:29:20,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:29:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 16:29:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:29:20,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:20,262 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 16:29:20,262 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2029507581, now seen corresponding path program 1 times [2018-02-04 16:29:20,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:20,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:20,301 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 16:29:20,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:20,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:20,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:29:20,302 INFO L182 omatonBuilderFactory]: Interpolants [1605#true, 1606#false, 1607#(= 0 |probe1_6_#res|), 1608#(= 0 |entry_point_#t~ret8|), 1609#(= entry_point_~ret~1 0)] [2018-02-04 16:29:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:29:20,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:29:20,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:29:20,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:20,303 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-02-04 16:29:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:20,329 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-02-04 16:29:20,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:29:20,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 16:29:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:20,330 INFO L225 Difference]: With dead ends: 46 [2018-02-04 16:29:20,330 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 16:29:20,330 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 16:29:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 16:29:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 16:29:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 16:29:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-02-04 16:29:20,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-02-04 16:29:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:20,332 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-02-04 16:29:20,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:29:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-02-04 16:29:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 16:29:20,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:20,333 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 16:29:20,333 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 16:29:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1307871834, now seen corresponding path program 1 times [2018-02-04 16:29:20,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:29:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:29:20,376 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:29:20,390 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 16:29:20,394 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 16:29:20,395 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 16:29:20,399 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 16:29:20,400 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-02-04 16:29:20,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:29:20 BoogieIcfgContainer [2018-02-04 16:29:20,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:29:20,407 INFO L168 Benchmark]: Toolchain (without parser) took 2863.83 ms. Allocated memory was 402.7 MB in the beginning and 687.9 MB in the end (delta: 285.2 MB). Free memory was 359.5 MB in the beginning and 649.2 MB in the end (delta: -289.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:29:20,408 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:29:20,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.48 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:20,408 INFO L168 Benchmark]: Boogie Preprocessor took 28.67 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:20,409 INFO L168 Benchmark]: RCFGBuilder took 176.88 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 324.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:20,409 INFO L168 Benchmark]: TraceAbstraction took 2501.41 ms. Allocated memory was 402.7 MB in the beginning and 687.9 MB in the end (delta: 285.2 MB). Free memory was 324.3 MB in the beginning and 649.2 MB in the end (delta: -324.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:29:20,410 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.10 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.48 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.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 28.67 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 344.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 176.88 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 324.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2501.41 ms. Allocated memory was 402.7 MB in the beginning and 687.9 MB in the end (delta: 285.2 MB). Free memory was 324.3 MB in the beginning and 649.2 MB in the end (delta: -324.9 MB). There was no memory consumed. 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1476]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={9:5}] [L1465] FCALL struct A a6; VAL [a6={7:0}] [L1477] CALL entry_point() VAL [a6={7:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={7:0}, a6={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, a6={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={7:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, a6={7:0}, malloc(size)={8:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={8:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={8:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={8:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={8:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); [L1470] COND TRUE ret==0 VAL [a6={7:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={7:0}, ret=0] [L1473] RET, FCALL a6.p = 0 VAL [a6={7:0}, ret=0] [L1477] entry_point() VAL [a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 9 error locations. UNSAFE Result, 2.4s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 391 SDslu, 1189 SDs, 0 SdLazy, 717 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=2, 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, 11 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 32242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-29-20-416.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-29-20-416.csv Received shutdown request...