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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:25:26,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:25:26,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:25:26,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:25:26,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:25:26,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:25:26,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:25:26,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:25:26,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:25:26,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:25:26,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:25:26,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:25:26,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:25:26,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:25:26,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:25:26,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:25:26,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:25:26,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:25:26,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:25:26,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:25:26,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:25:26,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:25:26,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:25:26,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:25:26,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:25:26,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:25:26,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:25:26,105 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:25:26,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:25:26,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:25:26,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:25:26,107 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:25:26,116 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:25:26,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:25:26,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:25:26,118 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:25:26,118 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:25:26,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:25:26,118 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:25:26,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:25:26,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:25:26,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:25:26,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:25:26,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:25:26,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:25:26,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:25:26,121 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:25:26,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:25:26,122 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:25:26,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:25:26,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:25:26,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:25:26,122 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:25:26,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:25:26,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:25:26,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:25:26,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:25:26,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:25:26,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:25:26,124 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:25:26,125 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:25:26,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:25:26,172 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:25:26,176 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:25:26,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:25:26,178 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:25:26,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:26,365 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:25:26,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:25:26,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:26,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:25:26,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:25:26,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26, skipping insertion in model container [2018-01-30 00:25:26,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,430 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:26,467 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:26,587 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:26,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:26,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26 WrapperNode [2018-01-30 00:25:26,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:26,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:25:26,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:25:26,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:25:26,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... [2018-01-30 00:25:26,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:25:26,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:25:26,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:25:26,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:25:26,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (1/1) ... No working directory specified, using /storage/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-01-30 00:25:26,695 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:25:26,695 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:25:26,695 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-30 00:25:26,695 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:25:26,695 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:25:26,696 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:25:26,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:25:26,936 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:25:26,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:26 BoogieIcfgContainer [2018-01-30 00:25:26,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:25:26,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:25:26,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:25:26,940 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:25:26,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:25:26" (1/3) ... [2018-01-30 00:25:26,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2736724b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:26, skipping insertion in model container [2018-01-30 00:25:26,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:26" (2/3) ... [2018-01-30 00:25:26,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2736724b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:26, skipping insertion in model container [2018-01-30 00:25:26,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:26" (3/3) ... [2018-01-30 00:25:26,944 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:26,952 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:25:26,958 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 00:25:27,003 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:25:27,003 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:25:27,004 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:25:27,004 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:25:27,004 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:25:27,004 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:25:27,004 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:25:27,004 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:25:27,005 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:25:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 00:25:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-30 00:25:27,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:27,033 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:27,033 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1427434577, now seen corresponding path program 1 times [2018-01-30 00:25:27,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:27,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:27,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:27,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:27,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:27,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:27,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:25:27,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:25:27,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:25:27,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:25:27,177 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-01-30 00:25:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:27,199 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-30 00:25:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:25:27,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-30 00:25:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:27,208 INFO L225 Difference]: With dead ends: 88 [2018-01-30 00:25:27,208 INFO L226 Difference]: Without dead ends: 52 [2018-01-30 00:25:27,288 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:25:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-30 00:25:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-30 00:25:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-30 00:25:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-01-30 00:25:27,322 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 13 [2018-01-30 00:25:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:27,322 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-01-30 00:25:27,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:25:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-01-30 00:25:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:27,323 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:27,323 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:27,323 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash 202722175, now seen corresponding path program 1 times [2018-01-30 00:25:27,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:27,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:27,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:27,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:27,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:27,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:27,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:25:27,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:27,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:27,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:27,426 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 5 states. [2018-01-30 00:25:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:27,613 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-01-30 00:25:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:27,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 00:25:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:27,615 INFO L225 Difference]: With dead ends: 71 [2018-01-30 00:25:27,615 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:25:27,616 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:25:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-30 00:25:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-30 00:25:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-30 00:25:27,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 16 [2018-01-30 00:25:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:27,625 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-30 00:25:27,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-30 00:25:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:27,626 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:27,626 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:27,626 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash 202722176, now seen corresponding path program 1 times [2018-01-30 00:25:27,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:27,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:27,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:27,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:27,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:27,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:27,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:25:27,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:27,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:27,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:27,785 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 5 states. [2018-01-30 00:25:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:27,959 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-01-30 00:25:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:27,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 00:25:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:27,961 INFO L225 Difference]: With dead ends: 80 [2018-01-30 00:25:27,961 INFO L226 Difference]: Without dead ends: 73 [2018-01-30 00:25:27,962 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-30 00:25:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-01-30 00:25:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 00:25:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-01-30 00:25:27,970 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 16 [2018-01-30 00:25:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:27,971 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-01-30 00:25:27,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-01-30 00:25:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:25:27,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:27,972 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:27,972 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1118160249, now seen corresponding path program 1 times [2018-01-30 00:25:27,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:27,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:27,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:27,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:27,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:28,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:28,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:25:28,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:28,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:28,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:28,033 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 5 states. [2018-01-30 00:25:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:28,117 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-01-30 00:25:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:28,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-30 00:25:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:28,118 INFO L225 Difference]: With dead ends: 73 [2018-01-30 00:25:28,118 INFO L226 Difference]: Without dead ends: 70 [2018-01-30 00:25:28,119 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-30 00:25:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-30 00:25:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 00:25:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-30 00:25:28,128 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 22 [2018-01-30 00:25:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:28,128 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-30 00:25:28,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-30 00:25:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:25:28,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:28,130 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:28,130 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash -792629457, now seen corresponding path program 1 times [2018-01-30 00:25:28,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:28,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:28,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:28,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:28,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:28,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:28,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:28,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:28,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:28,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:28,241 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 7 states. [2018-01-30 00:25:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:28,492 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-01-30 00:25:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:25:28,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:25:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:28,494 INFO L225 Difference]: With dead ends: 88 [2018-01-30 00:25:28,494 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 00:25:28,495 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:25:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 00:25:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-01-30 00:25:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:25:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-30 00:25:28,504 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-01-30 00:25:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:28,504 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-30 00:25:28,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-30 00:25:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:25:28,505 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:28,506 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:28,506 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash -792629456, now seen corresponding path program 1 times [2018-01-30 00:25:28,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:28,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:28,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:28,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:28,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:28,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:28,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:28,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:28,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:28,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:28,647 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 7 states. [2018-01-30 00:25:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:28,898 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-01-30 00:25:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:25:28,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:25:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:28,900 INFO L225 Difference]: With dead ends: 87 [2018-01-30 00:25:28,900 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 00:25:28,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:25:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 00:25:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2018-01-30 00:25:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-30 00:25:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-01-30 00:25:28,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 28 [2018-01-30 00:25:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:28,908 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-01-30 00:25:28,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-01-30 00:25:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:25:28,910 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:28,910 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:28,910 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1254409337, now seen corresponding path program 1 times [2018-01-30 00:25:28,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:28,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:28,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:28,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:28,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:25:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:29,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:25:29,292 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:25:29,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:29,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:25:29,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:25:29,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:25:29,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:25:29,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:25:29,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-30 00:25:29,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:25:29,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:25:29,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:25:29,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:25:29,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:25:29,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-30 00:25:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:29,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:25:29,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-01-30 00:25:29,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:25:29,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:25:29,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:25:29,566 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2018-01-30 00:25:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:29,800 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-01-30 00:25:29,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:25:29,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-01-30 00:25:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:29,801 INFO L225 Difference]: With dead ends: 90 [2018-01-30 00:25:29,802 INFO L226 Difference]: Without dead ends: 76 [2018-01-30 00:25:29,802 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:25:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-30 00:25:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2018-01-30 00:25:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 00:25:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-30 00:25:29,813 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 29 [2018-01-30 00:25:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:29,813 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-30 00:25:29,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:25:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-30 00:25:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:25:29,815 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:29,815 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:29,815 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-30 00:25:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash -231984998, now seen corresponding path program 1 times [2018-01-30 00:25:29,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:29,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:29,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:29,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:29,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:29,863 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:25:29,880 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:25:29,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:25:29 BoogieIcfgContainer [2018-01-30 00:25:29,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:25:29,899 INFO L168 Benchmark]: Toolchain (without parser) took 3532.80 ms. Allocated memory was 300.9 MB in the beginning and 472.9 MB in the end (delta: 172.0 MB). Free memory was 261.0 MB in the beginning and 295.3 MB in the end (delta: -34.3 MB). Peak memory consumption was 137.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:29,900 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:25:29,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.33 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 250.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:29,901 INFO L168 Benchmark]: Boogie Preprocessor took 34.65 ms. Allocated memory is still 300.9 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:29,901 INFO L168 Benchmark]: RCFGBuilder took 291.28 ms. Allocated memory is still 300.9 MB. Free memory was 248.0 MB in the beginning and 227.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:29,902 INFO L168 Benchmark]: TraceAbstraction took 2960.62 ms. Allocated memory was 300.9 MB in the beginning and 472.9 MB in the end (delta: 172.0 MB). Free memory was 227.2 MB in the beginning and 295.3 MB in the end (delta: -68.1 MB). Peak memory consumption was 103.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:29,904 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.24 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.33 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 250.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.65 ms. Allocated memory is still 300.9 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.28 ms. Allocated memory is still 300.9 MB. Free memory was 248.0 MB in the beginning and 227.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2960.62 ms. Allocated memory was 300.9 MB in the beginning and 472.9 MB in the end (delta: 172.0 MB). Free memory was 227.2 MB in the beginning and 295.3 MB in the end (delta: -68.1 MB). Peak memory consumption was 103.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L638] FCALL p->h = 1 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L639] FCALL p->n = 0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L640] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L641] COND TRUE p!=0 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L642] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1] [L642] COND FALSE !(p->h != 1) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=1] [L645] EXPR, FCALL p->n VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->n={0:0}] [L645] p = p->n VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}, p->n={0:0}] [L641] COND FALSE !(p!=0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 15 error locations. UNSAFE Result, 2.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 868 SDslu, 531 SDs, 0 SdLazy, 471 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, 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, 7 MinimizatonAttempts, 83 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 23598 SizeOfPredicates, 13 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-25-29-917.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-25-29-917.csv Received shutdown request...