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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:41:10,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:41:10,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:41:10,913 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:41:10,913 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:41:10,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:41:10,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:41:10,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:41:10,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:41:10,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:41:10,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:41:10,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:41:10,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:41:10,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:41:10,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:41:10,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:41:10,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:41:10,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:41:10,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:41:10,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:41:10,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:41:10,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:41:10,929 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:41:10,930 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:41:10,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:41:10,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:41:10,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:41:10,932 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:41:10,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:41:10,932 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:41:10,933 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:41:10,933 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-02 20:41:10,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:41:10,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:41:10,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:41:10,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:41:10,943 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:41:10,944 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:41:10,944 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:41:10,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:41:10,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:41:10,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:41:10,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:41:10,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:41:10,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:41:10,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:41:10,984 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:41:10,987 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:41:10,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:41:10,988 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:41:10,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-02 20:41:11,148 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:41:11,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:41:11,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:11,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:41:11,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:41:11,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11, skipping insertion in model container [2018-02-02 20:41:11,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,174 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:11,211 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:11,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:11,321 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:11,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11 WrapperNode [2018-02-02 20:41:11,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:11,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:41:11,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:41:11,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:41:11,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... [2018-02-02 20:41:11,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:41:11,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:41:11,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:41:11,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:41:11,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:41:11,392 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:41:11,392 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:41:11,392 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:41:11,393 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:41:11,394 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:41:11,550 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:41:11,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:11 BoogieIcfgContainer [2018-02-02 20:41:11,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:41:11,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:41:11,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:41:11,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:41:11,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:41:11" (1/3) ... [2018-02-02 20:41:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aef55d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:11, skipping insertion in model container [2018-02-02 20:41:11,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:11" (2/3) ... [2018-02-02 20:41:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aef55d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:11, skipping insertion in model container [2018-02-02 20:41:11,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:11" (3/3) ... [2018-02-02 20:41:11,555 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-02-02 20:41:11,560 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:41:11,564 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 20:41:11,596 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:41:11,596 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:41:11,596 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:41:11,596 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:41:11,596 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:41:11,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:41:11,597 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:41:11,597 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:41:11,597 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:41:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-02-02 20:41:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:41:11,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:11,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:41:11,618 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 3262148, now seen corresponding path program 1 times [2018-02-02 20:41:11,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:11,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:11,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:11,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:11,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:11,751 INFO L182 omatonBuilderFactory]: Interpolants [69#true, 70#false, 71#(= 1 (select |#valid| |~#a6.base|))] [2018-02-02 20:41:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:11,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:11,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:11,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:11,763 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-02-02 20:41:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:11,907 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 20:41:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:11,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:41:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:11,915 INFO L225 Difference]: With dead ends: 79 [2018-02-02 20:41:11,915 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 20:41:11,916 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-02 20:41:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 20:41:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-02-02 20:41:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 20:41:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 20:41:11,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 4 [2018-02-02 20:41:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:11,942 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 20:41:11,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 20:41:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:41:11,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:11,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:41:11,942 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash 3262149, now seen corresponding path program 1 times [2018-02-02 20:41:11,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:11,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:11,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:11,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:11,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:11,999 INFO L182 omatonBuilderFactory]: Interpolants [218#true, 219#false, 220#(and (= |~#a6.offset| 0) (= (select |#length| |~#a6.base|) 4))] [2018-02-02 20:41:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:12,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:12,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:12,001 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2018-02-02 20:41:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,058 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-02-02 20:41:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:12,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:41:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,060 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:41:12,060 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:41:12,061 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-02 20:41:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:41:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-02-02 20:41:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:41:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2018-02-02 20:41:12,072 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 4 [2018-02-02 20:41:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,072 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2018-02-02 20:41:12,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-02-02 20:41:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:41:12,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,073 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-02 20:41:12,074 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751463, now seen corresponding path program 1 times [2018-02-02 20:41:12,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,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-02 20:41:12,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:12,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,172 INFO L182 omatonBuilderFactory]: Interpolants [440#true, 441#false, 442#(= 1 (select |#valid| |~#a6.base|)), 443#(= |#valid| |old(#valid)|), 444#(= 1 (select |#valid| |disconnect_6_#in~a.base|)), 445#(= 1 (select |#valid| disconnect_6_~a.base))] [2018-02-02 20:41:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:12,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:12,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:12,173 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand 6 states. [2018-02-02 20:41:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,322 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2018-02-02 20:41:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:12,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 20:41:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,324 INFO L225 Difference]: With dead ends: 122 [2018-02-02 20:41:12,324 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 20:41:12,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 20:41:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2018-02-02 20:41:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:41:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-02-02 20:41:12,335 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 24 [2018-02-02 20:41:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,335 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-02-02 20:41:12,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-02-02 20:41:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:41:12,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,336 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-02 20:41:12,336 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1144751462, now seen corresponding path program 1 times [2018-02-02 20:41:12,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:12,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,394 INFO L182 omatonBuilderFactory]: Interpolants [688#(<= 3 |entry_point_#t~ret9|), 689#(<= 3 entry_point_~ret~1), 684#true, 685#false, 686#(<= 3 probe1_6_~ret~0), 687#(<= 3 |probe1_6_#res|)] [2018-02-02 20:41:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:12,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:12,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:12,395 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2018-02-02 20:41:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,421 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2018-02-02 20:41:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:12,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 20:41:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,422 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:41:12,422 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:41:12,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:41:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-02-02 20:41:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 20:41:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-02 20:41:12,428 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 24 [2018-02-02 20:41:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,428 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-02 20:41:12,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-02 20:41:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:41:12,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,428 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-02 20:41:12,428 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1288261138, now seen corresponding path program 1 times [2018-02-02 20:41:12,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:12,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,486 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= probe1_6_~p~0.base 0) (= 0 probe1_6_~p~0.offset)), 924#true, 925#false, 926#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 927#(and (= 0 |probe1_6_#t~ret4.base|) (= 0 |probe1_6_#t~ret4.offset|))] [2018-02-02 20:41:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:12,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:12,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:12,487 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 5 states. [2018-02-02 20:41:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,504 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 20:41:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:12,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 20:41:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,505 INFO L225 Difference]: With dead ends: 77 [2018-02-02 20:41:12,505 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 20:41:12,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 20:41:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 20:41:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 20:41:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-02-02 20:41:12,509 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-02-02 20:41:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,510 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-02-02 20:41:12,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-02-02 20:41:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:41:12,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,511 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-02 20:41:12,511 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1988329134, now seen corresponding path program 1 times [2018-02-02 20:41:12,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:12,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,567 INFO L182 omatonBuilderFactory]: Interpolants [1079#true, 1080#false, 1081#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1082#(not (= 0 |ldv_malloc_#res.base|)), 1083#(not (= 0 |probe1_6_#t~ret4.base|)), 1084#(not (= 0 probe1_6_~p~0.base))] [2018-02-02 20:41:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:12,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:12,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:12,568 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2018-02-02 20:41:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,592 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-02 20:41:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:12,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 20:41:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,593 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:41:12,593 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:41:12,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:41:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-02 20:41:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 20:41:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 20:41:12,598 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 24 [2018-02-02 20:41:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,598 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 20:41:12,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 20:41:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:41:12,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,599 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-02 20:41:12,599 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813492, now seen corresponding path program 1 times [2018-02-02 20:41:12,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:12,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,646 INFO L182 omatonBuilderFactory]: Interpolants [1225#true, 1226#false, 1227#(= 0 |ldv_malloc_#t~malloc1.offset|), 1228#(= 0 |ldv_malloc_#res.offset|), 1229#(= 0 |probe1_6_#t~ret4.offset|), 1230#(= 0 probe1_6_~p~0.offset)] [2018-02-02 20:41:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:12,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:12,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:12,647 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-02 20:41:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,667 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-02 20:41:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:12,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 20:41:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,670 INFO L225 Difference]: With dead ends: 68 [2018-02-02 20:41:12,670 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 20:41:12,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 20:41:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 20:41:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 20:41:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-02 20:41:12,673 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2018-02-02 20:41:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,674 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-02 20:41:12,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-02 20:41:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:41:12,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,675 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-02 20:41:12,675 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1956813493, now seen corresponding path program 1 times [2018-02-02 20:41:12,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:12,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,723 INFO L182 omatonBuilderFactory]: Interpolants [1369#true, 1370#false, 1371#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1372#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1373#(= 1 (select |#valid| |probe1_6_#t~ret4.base|)), 1374#(= 1 (select |#valid| probe1_6_~p~0.base))] [2018-02-02 20:41:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:12,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:12,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:12,724 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-02-02 20:41:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:12,787 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-02-02 20:41:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:12,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 20:41:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:12,788 INFO L225 Difference]: With dead ends: 67 [2018-02-02 20:41:12,788 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 20:41:12,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 20:41:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 20:41:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 20:41:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-02 20:41:12,792 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 26 [2018-02-02 20:41:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:12,792 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-02 20:41:12,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-02 20:41:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:41:12,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:12,793 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-02 20:41:12,793 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 840727273, now seen corresponding path program 1 times [2018-02-02 20:41:12,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:12,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:12,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:41:12,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,911 INFO L182 omatonBuilderFactory]: Interpolants [1511#true, 1512#false, 1513#(= 1 (select |#valid| |~#a6.base|)), 1514#(= 1 (select |#valid| |probe1_6_#in~a.base|)), 1515#(= 1 (select |#valid| probe1_6_~a.base)), 1516#(= |#valid| |old(#valid)|), 1517#(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|)), 1518#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:41:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:12,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:41:12,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:41:12,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:12,912 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-02-02 20:41:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:13,086 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-02-02 20:41:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:13,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 20:41:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:13,087 INFO L225 Difference]: With dead ends: 75 [2018-02-02 20:41:13,087 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 20:41:13,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 20:41:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-02-02 20:41:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 20:41:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-02 20:41:13,091 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 32 [2018-02-02 20:41:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:13,091 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-02 20:41:13,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:41:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-02 20:41:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:41:13,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:13,092 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-02 20:41:13,092 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash 840727274, now seen corresponding path program 1 times [2018-02-02 20:41:13,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:13,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:13,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:41:13,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,245 INFO L182 omatonBuilderFactory]: Interpolants [1680#(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|))), 1681#(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|))))), 1682#(and (= (select |#length| probe1_6_~a.base) 4) (= probe1_6_~a.offset 0)), 1673#true, 1674#false, 1675#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|))), 1676#(and (= 0 |~#a6.offset|) (= 4 (select |#length| |~#a6.base|)) (= (select |#valid| |~#a6.base|) 1)), 1677#(and (= (select |#valid| |probe1_6_#in~a.base|) 1) (= 4 (select |#length| |probe1_6_#in~a.base|)) (= 0 |probe1_6_#in~a.offset|)), 1678#(and (= (select |#valid| probe1_6_~a.base) 1) (= probe1_6_~a.offset 0) (= 4 (select |#length| probe1_6_~a.base))), 1679#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-02 20:41:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:41:13,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:41:13,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:13,246 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 10 states. [2018-02-02 20:41:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:13,675 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 20:41:13,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:41:13,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 20:41:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:13,676 INFO L225 Difference]: With dead ends: 68 [2018-02-02 20:41:13,676 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 20:41:13,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:41:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 20:41:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-02-02 20:41:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 20:41:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-02 20:41:13,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2018-02-02 20:41:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:13,680 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-02 20:41:13,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:41:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-02 20:41:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:41:13,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:13,680 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-02 20:41:13,681 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:13,681 INFO L82 PathProgramCache]: Analyzing trace with hash -229619546, now seen corresponding path program 1 times [2018-02-02 20:41:13,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:13,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:13,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:41:13,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,827 INFO L182 omatonBuilderFactory]: Interpolants [1840#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1841#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (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|))))), 1842#(and (not (= 0 |probe1_6_#t~ret4.base|)) (or (= |#valid| |old(#valid)|) (= |probe1_6_#t~ret4.base| (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| |probe1_6_#t~ret4.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1843#(and (= 0 (select |old(#valid)| probe1_6_~p~0.base)) (or (= probe1_6_~p~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (not (= 0 probe1_6_~p~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1836#true, 1837#false, 1838#(= 1 (select |#valid| |~#a6.base|)), 1839#(= |#valid| |old(#valid)|)] [2018-02-02 20:41:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:13,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:41:13,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:41:13,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:13,828 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-02-02 20:41:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,043 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-02-02 20:41:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:14,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 20:41:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,044 INFO L225 Difference]: With dead ends: 68 [2018-02-02 20:41:14,044 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 20:41:14,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 20:41:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 20:41:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 20:41:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 20:41:14,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 32 [2018-02-02 20:41:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,048 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 20:41:14,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:41:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 20:41:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:41:14,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,049 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] [2018-02-02 20:41:14,049 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1621100812, now seen corresponding path program 1 times [2018-02-02 20:41:14,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:14,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:14,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,140 INFO L182 omatonBuilderFactory]: Interpolants [1989#true, 1990#false, 1991#(<= (+ probe1_6_~ret~0 1) 0), 1992#(<= (+ |probe1_6_#res| 1) 0), 1993#(<= (+ |entry_point_#t~ret9| 1) 0), 1994#(<= (+ entry_point_~ret~1 1) 0)] [2018-02-02 20:41:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:41:14,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:41:14,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:14,141 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-02 20:41:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,156 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 20:41:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:14,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 20:41:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,157 INFO L225 Difference]: With dead ends: 60 [2018-02-02 20:41:14,157 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 20:41:14,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 20:41:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 20:41:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 20:41:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-02 20:41:14,160 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 34 [2018-02-02 20:41:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,160 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-02 20:41:14,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:41:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-02 20:41:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:41:14,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,162 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] [2018-02-02 20:41:14,162 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -945807698, now seen corresponding path program 1 times [2018-02-02 20:41:14,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:14,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:41:14,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,253 INFO L182 omatonBuilderFactory]: Interpolants [2112#false, 2113#(= 0 |~#a6.offset|), 2114#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (or (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= probe1_6_~a.offset 0))), 2115#(or (<= 4 (select |#length| |probe1_6_#in~a.base|)) (not (= 0 |probe1_6_#in~a.offset|))), 2116#(and (= 0 |~#a6.offset|) (<= 4 (select |#length| |~#a6.base|))), 2117#(and (= 0 |disconnect_6_#in~a.offset|) (<= 4 (select |#length| |disconnect_6_#in~a.base|))), 2118#(and (<= 4 (select |#length| disconnect_6_~a.base)) (= disconnect_6_~a.offset 0)), 2111#true] [2018-02-02 20:41:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:41:14,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:41:14,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:14,254 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-02-02 20:41:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,341 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 20:41:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:14,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 20:41:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,342 INFO L225 Difference]: With dead ends: 53 [2018-02-02 20:41:14,342 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 20:41:14,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 20:41:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 20:41:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 20:41:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 20:41:14,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 40 [2018-02-02 20:41:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,343 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 20:41:14,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:41:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 20:41:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:41:14,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,344 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-02 20:41:14,344 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash 744732401, now seen corresponding path program 1 times [2018-02-02 20:41:14,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:14,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:41:14,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,433 INFO L182 omatonBuilderFactory]: Interpolants [2240#(= 0 |ldv_malloc_#t~malloc1.offset|), 2241#(= 0 |ldv_malloc_#res.offset|), 2242#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 0 |probe1_6_#t~ret4.offset|)), 2243#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 probe1_6_~p~0.offset) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2244#(= 0 (select (select |#memory_$Pointer$.offset| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)), 2245#(= 0 (select (select |#memory_$Pointer$.offset| |~#a6.base|) |~#a6.offset|)), 2246#(= 0 (select (select |#memory_$Pointer$.offset| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)), 2247#(= 0 (select (select |#memory_$Pointer$.offset| disconnect_6_~a.base) disconnect_6_~a.offset)), 2248#(= |disconnect_6_#t~mem8.offset| 0), 2237#true, 2238#false, 2239#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|))] [2018-02-02 20:41:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:41:14,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:41:14,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:14,433 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-02-02 20:41:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,564 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-02 20:41:14,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:41:14,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 20:41:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,564 INFO L225 Difference]: With dead ends: 52 [2018-02-02 20:41:14,565 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 20:41:14,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:41:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 20:41:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 20:41:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 20:41:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 20:41:14,566 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 41 [2018-02-02 20:41:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,567 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 20:41:14,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:41:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 20:41:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:41:14,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,568 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-02 20:41:14,568 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 744732402, now seen corresponding path program 1 times [2018-02-02 20:41:14,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:14,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:41:14,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,665 INFO L182 omatonBuilderFactory]: Interpolants [2371#true, 2372#false, 2373#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2374#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2375#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2376#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 1 (select |#valid| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2377#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= 1 (select |#valid| probe1_6_~p~0.base))), 2378#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))), 2379#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))), 2380#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|))), 2381#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| disconnect_6_~a.base) disconnect_6_~a.offset))), 2382#(= 1 (select |#valid| |disconnect_6_#t~mem8.base|))] [2018-02-02 20:41:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:41:14,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:41:14,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:14,666 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-02-02 20:41:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,783 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 20:41:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:41:14,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 20:41:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,783 INFO L225 Difference]: With dead ends: 51 [2018-02-02 20:41:14,783 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 20:41:14,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:41:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 20:41:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 20:41:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 20:41:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-02 20:41:14,785 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 41 [2018-02-02 20:41:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,786 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-02 20:41:14,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:41:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-02 20:41:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:41:14,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,787 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-02 20:41:14,787 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,787 INFO L82 PathProgramCache]: Analyzing trace with hash 746273508, now seen corresponding path program 1 times [2018-02-02 20:41:14,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:14,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:41:14,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,815 INFO L182 omatonBuilderFactory]: Interpolants [2496#false, 2497#(= 0 |probe1_6_#res|), 2498#(= 0 |entry_point_#t~ret9|), 2499#(= entry_point_~ret~1 0), 2495#true] [2018-02-02 20:41:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:14,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:14,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:14,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:14,816 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2018-02-02 20:41:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:14,823 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2018-02-02 20:41:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:14,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 20:41:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:14,824 INFO L225 Difference]: With dead ends: 50 [2018-02-02 20:41:14,824 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 20:41:14,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 20:41:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 20:41:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 20:41:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-02-02 20:41:14,826 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 41 [2018-02-02 20:41:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:14,826 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-02-02 20:41:14,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-02-02 20:41:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:41:14,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:14,827 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-02 20:41:14,827 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1423792391, now seen corresponding path program 1 times [2018-02-02 20:41:14,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:14,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:15,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:41:15,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,015 INFO L182 omatonBuilderFactory]: Interpolants [2600#true, 2601#false, 2602#(= 1 (select |#valid| |~#a6.base|)), 2603#(= |#valid| |old(#valid)|), 2604#(and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2605#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2606#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 2607#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| |probe1_6_#t~ret4.base|)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2608#(and (= probe1_6_~a.base |probe1_6_#in~a.base|) (= 0 (select |old(#valid)| probe1_6_~p~0.base)) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (not (= 0 probe1_6_~p~0.base))), 2609#(and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)))), 2610#(and (not (= |~#a6.base| (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|)))), 2611#(and (= disconnect_6_~a.offset |disconnect_6_#in~a.offset|) (= disconnect_6_~a.base |disconnect_6_#in~a.base|)), 2612#(and (or (= 1 (select (store |#valid| |disconnect_6_#t~mem8.base| 0) |disconnect_6_#in~a.base|)) (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#in~a.base|)) (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#t~mem8.base|)), 2613#(or (and (= (select |#valid| |disconnect_6_#in~a.base|) 0) (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#in~a.base|)) (= 0 (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)) (= 1 (select |#valid| |disconnect_6_#in~a.base|)))] [2018-02-02 20:41:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:41:15,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:41:15,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:15,016 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 14 states. [2018-02-02 20:41:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:15,354 INFO L93 Difference]: Finished difference Result 49 states and 48 transitions. [2018-02-02 20:41:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:41:15,354 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-02-02 20:41:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:15,355 INFO L225 Difference]: With dead ends: 49 [2018-02-02 20:41:15,355 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 20:41:15,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:41:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 20:41:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 20:41:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 20:41:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-02-02 20:41:15,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 45 [2018-02-02 20:41:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:15,357 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-02-02 20:41:15,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:41:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-02-02 20:41:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:15,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:15,357 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, 1, 1, 1] [2018-02-02 20:41:15,357 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, disconnect_6Err0RequiresViolation, disconnect_6Err2RequiresViolation, disconnect_6Err1RequiresViolation, disconnect_6Err3RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-02 20:41:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -897879172, now seen corresponding path program 1 times [2018-02-02 20:41:15,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:15,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:15,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:41:15,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,521 INFO L182 omatonBuilderFactory]: Interpolants [2739#true, 2740#false, 2741#(= |#valid| |old(#valid)|), 2742#(and (= |#valid| |old(#valid)|) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|)), 2743#(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)), 2744#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 2745#(and (not (= 0 |probe1_6_#t~ret4.base|)) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= |#valid| (store |old(#valid)| |probe1_6_#t~ret4.base| (select |#valid| |probe1_6_#t~ret4.base|))) (= (select |old(#valid)| |probe1_6_#t~ret4.base|) 0)), 2746#(and (= |#valid| (store |old(#valid)| probe1_6_~p~0.base (select |#valid| probe1_6_~p~0.base))) (= probe1_6_~a.base |probe1_6_#in~a.base|) (= probe1_6_~a.offset |probe1_6_#in~a.offset|) (= (select |old(#valid)| probe1_6_~p~0.base) 0) (not (= 0 probe1_6_~p~0.base))), 2747#(and (= (store |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) |#valid|) (not (= 0 (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |probe1_6_#in~a.base|) |probe1_6_#in~a.offset|)) 0)), 2748#(and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|)))) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|)) 0) (not (= 0 (select (select |#memory_$Pointer$.base| |~#a6.base|) |~#a6.offset|)))), 2749#(and (= disconnect_6_~a.offset |disconnect_6_#in~a.offset|) (= disconnect_6_~a.base |disconnect_6_#in~a.base|) (= |#valid| |old(#valid)|)), 2750#(and (= (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) |disconnect_6_#t~mem8.base|) (= (store |old(#valid)| |disconnect_6_#t~mem8.base| (select (store |#valid| |disconnect_6_#t~mem8.base| 0) |disconnect_6_#t~mem8.base|)) (store |#valid| |disconnect_6_#t~mem8.base| 0))), 2751#(or (and (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)))) (= 0 (select (select |#memory_$Pointer$.base| |disconnect_6_#in~a.base|) |disconnect_6_#in~a.offset|)))] [2018-02-02 20:41:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:15,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:41:15,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:41:15,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:41:15,522 INFO L87 Difference]: Start difference. First operand 49 states and 48 transitions. Second operand 13 states. [2018-02-02 20:41:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:15,756 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2018-02-02 20:41:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:41:15,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 20:41:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:15,756 INFO L225 Difference]: With dead ends: 48 [2018-02-02 20:41:15,756 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 20:41:15,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:41:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 20:41:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 20:41:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 20:41:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 20:41:15,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-02 20:41:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:15,757 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 20:41:15,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:41:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 20:41:15,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 20:41:15,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:41:15 BoogieIcfgContainer [2018-02-02 20:41:15,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:41:15,761 INFO L168 Benchmark]: Toolchain (without parser) took 4612.27 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 360.4 MB in the beginning and 616.7 MB in the end (delta: -256.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:41:15,761 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:41:15,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.15 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:41:15,762 INFO L168 Benchmark]: Boogie Preprocessor took 28.11 ms. Allocated memory is still 403.7 MB. Free memory was 347.1 MB in the beginning and 345.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:41:15,762 INFO L168 Benchmark]: RCFGBuilder took 194.49 ms. Allocated memory is still 403.7 MB. Free memory was 345.8 MB in the beginning and 323.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:41:15,762 INFO L168 Benchmark]: TraceAbstraction took 4209.77 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 323.3 MB in the beginning and 616.7 MB in the end (delta: -293.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:41:15,763 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 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.15 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.1 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.11 ms. Allocated memory is still 403.7 MB. Free memory was 347.1 MB in the beginning and 345.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 194.49 ms. Allocated memory is still 403.7 MB. Free memory was 345.8 MB in the beginning and 323.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4209.77 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 323.3 MB in the beginning and 616.7 MB in the end (delta: -293.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 13 error locations. SAFE Result, 4.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 875 SDtfs, 768 SDslu, 2753 SDs, 0 SdLazy, 1905 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, 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, 18 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 524 ConstructedInterpolants, 0 QuantifiedInterpolants, 111226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-41-15-767.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-41-15-767.csv Received shutdown request...