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/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:25:16,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:25:16,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:25:16,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:25:16,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:25:16,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:25:16,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:25:16,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:25:16,244 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:25:16,245 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:25:16,246 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:25:16,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:25:16,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:25:16,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:25:16,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:25:16,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:25:16,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:25:16,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:25:16,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:25:16,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:25:16,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:25:16,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:25:16,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:25:16,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:25:16,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:25:16,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:25:16,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:25:16,265 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:25:16,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:25:16,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:25:16,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:25:16,267 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:16,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:25:16,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:25:16,277 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:25:16,278 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:25:16,278 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:25:16,278 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:25:16,278 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:25:16,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:25:16,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:25:16,279 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:25:16,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:25:16,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:25:16,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:25:16,280 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:25:16,280 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:25:16,280 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:25:16,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:25:16,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:25:16,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:25:16,281 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:25:16,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:25:16,281 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:25:16,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:25:16,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:25:16,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:25:16,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:25:16,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:25:16,284 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:25:16,284 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:25:16,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:25:16,332 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:25:16,336 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:25:16,337 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:25:16,338 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:25:16,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:16,511 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:25:16,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:25:16,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:16,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:25:16,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:25:16,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:16" (1/1) ... [2018-01-30 00:25:16,526 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:16, skipping insertion in model container [2018-01-30 00:25:16,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:25:16" (1/1) ... [2018-01-30 00:25:16,544 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:16,585 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:25:16,709 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:16,726 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:25:16,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:16 WrapperNode [2018-01-30 00:25:16,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:25:16,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:25:16,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:25:16,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:25:16,751 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:16" (1/1) ... [2018-01-30 00:25:16,752 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:16" (1/1) ... [2018-01-30 00:25:16,763 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:16" (1/1) ... [2018-01-30 00:25:16,763 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:16" (1/1) ... [2018-01-30 00:25:16,767 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:16" (1/1) ... [2018-01-30 00:25:16,770 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:16" (1/1) ... [2018-01-30 00:25:16,771 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:16" (1/1) ... [2018-01-30 00:25:16,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:25:16,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:25:16,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:25:16,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:25:16,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:16" (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:16,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:25:16,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:25:16,819 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-30 00:25:16,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:25:16,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:25:16,821 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-30 00:25:16,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:25:16,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:25:16,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:25:17,143 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:25:17,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:17 BoogieIcfgContainer [2018-01-30 00:25:17,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:25:17,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:25:17,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:25:17,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:25:17,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:25:16" (1/3) ... [2018-01-30 00:25:17,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616098ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:17, skipping insertion in model container [2018-01-30 00:25:17,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:25:16" (2/3) ... [2018-01-30 00:25:17,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616098ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:25:17, skipping insertion in model container [2018-01-30 00:25:17,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:25:17" (3/3) ... [2018-01-30 00:25:17,151 INFO L107 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-01-30 00:25:17,158 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:25:17,164 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-30 00:25:17,201 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:25:17,202 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:25:17,202 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:25:17,202 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:25:17,202 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:25:17,202 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:25:17,202 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:25:17,202 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:25:17,203 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:25:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-01-30 00:25:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-30 00:25:17,225 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:17,226 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:17,226 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1207376992, now seen corresponding path program 1 times [2018-01-30 00:25:17,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:17,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:17,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:17,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:17,324 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:17,359 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:17,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:17,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:25:17,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 00:25:17,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 00:25:17,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 00:25:17,376 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 2 states. [2018-01-30 00:25:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:17,404 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2018-01-30 00:25:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 00:25:17,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-30 00:25:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:17,495 INFO L225 Difference]: With dead ends: 158 [2018-01-30 00:25:17,495 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 00:25:17,499 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:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 00:25:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 00:25:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 00:25:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-01-30 00:25:17,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 14 [2018-01-30 00:25:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:17,536 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-01-30 00:25:17,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 00:25:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-01-30 00:25:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:17,537 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:17,537 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:17,537 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash -678713050, now seen corresponding path program 1 times [2018-01-30 00:25:17,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:17,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:17,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:17,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:17,554 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:17,623 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:17,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:17,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:25:17,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:17,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:17,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:17,626 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 5 states. [2018-01-30 00:25:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:17,886 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-01-30 00:25:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:17,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 00:25:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:17,888 INFO L225 Difference]: With dead ends: 112 [2018-01-30 00:25:17,889 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:25:17,890 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:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:25:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-30 00:25:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 00:25:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2018-01-30 00:25:17,901 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2018-01-30 00:25:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:17,901 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2018-01-30 00:25:17,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-01-30 00:25:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 00:25:17,902 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:17,903 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:17,903 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash -678713049, now seen corresponding path program 1 times [2018-01-30 00:25:17,903 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:17,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:17,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:17,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:17,924 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:18,042 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:18,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:18,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:25:18,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:25:18,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:25:18,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:25:18,044 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 5 states. [2018-01-30 00:25:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:18,221 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-30 00:25:18,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:25:18,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 00:25:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:18,223 INFO L225 Difference]: With dead ends: 138 [2018-01-30 00:25:18,223 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 00:25:18,224 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:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 00:25:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-01-30 00:25:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:25:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-01-30 00:25:18,236 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 16 [2018-01-30 00:25:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:18,236 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-01-30 00:25:18,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:25:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-01-30 00:25:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:25:18,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:18,237 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:18,238 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 111644630, now seen corresponding path program 1 times [2018-01-30 00:25:18,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:18,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:18,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:18,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:18,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:18,259 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:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:18,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:18,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:18,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:18,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:18,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:18,355 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 7 states. [2018-01-30 00:25:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:18,701 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-01-30 00:25:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:25:18,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:25:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:18,703 INFO L225 Difference]: With dead ends: 242 [2018-01-30 00:25:18,704 INFO L226 Difference]: Without dead ends: 239 [2018-01-30 00:25:18,704 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:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-30 00:25:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 122. [2018-01-30 00:25:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 00:25:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-30 00:25:18,717 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 28 [2018-01-30 00:25:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:18,718 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-30 00:25:18,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-30 00:25:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:25:18,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:18,719 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:18,720 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 111644631, now seen corresponding path program 1 times [2018-01-30 00:25:18,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:18,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:18,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:18,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:18,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:18,739 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:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:18,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:18,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:18,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:18,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:18,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:18,865 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 7 states. [2018-01-30 00:25:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:19,322 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-01-30 00:25:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:25:19,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:25:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:19,324 INFO L225 Difference]: With dead ends: 243 [2018-01-30 00:25:19,324 INFO L226 Difference]: Without dead ends: 236 [2018-01-30 00:25:19,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:25:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-30 00:25:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 101. [2018-01-30 00:25:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:25:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2018-01-30 00:25:19,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 28 [2018-01-30 00:25:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:19,334 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2018-01-30 00:25:19,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2018-01-30 00:25:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:25:19,336 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:19,336 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:19,336 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1346074579, now seen corresponding path program 1 times [2018-01-30 00:25:19,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:19,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:19,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:19,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:19,351 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:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:25:19,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:19,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:19,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:25:19,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:25:19,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:25:19,394 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 6 states. [2018-01-30 00:25:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:19,507 INFO L93 Difference]: Finished difference Result 202 states and 213 transitions. [2018-01-30 00:25:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:25:19,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 00:25:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:19,509 INFO L225 Difference]: With dead ends: 202 [2018-01-30 00:25:19,509 INFO L226 Difference]: Without dead ends: 169 [2018-01-30 00:25:19,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:25:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-30 00:25:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 114. [2018-01-30 00:25:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 00:25:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-30 00:25:19,517 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 30 [2018-01-30 00:25:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:19,517 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-30 00:25:19,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:25:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-30 00:25:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:25:19,518 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:19,518 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, 1, 1, 1] [2018-01-30 00:25:19,518 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1580484653, now seen corresponding path program 1 times [2018-01-30 00:25:19,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:19,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:19,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:19,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:19,530 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:19,595 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:19,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:19,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:19,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:19,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:19,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:19,596 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-01-30 00:25:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:19,764 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-01-30 00:25:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:25:19,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-30 00:25:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:19,765 INFO L225 Difference]: With dead ends: 161 [2018-01-30 00:25:19,765 INFO L226 Difference]: Without dead ends: 159 [2018-01-30 00:25:19,765 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:25:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-30 00:25:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 112. [2018-01-30 00:25:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 00:25:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-30 00:25:19,771 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 32 [2018-01-30 00:25:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:19,772 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-30 00:25:19,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-30 00:25:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:25:19,772 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:19,773 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, 1, 1, 1] [2018-01-30 00:25:19,773 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1580484654, now seen corresponding path program 1 times [2018-01-30 00:25:19,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:19,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:19,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:19,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:25:19,787 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:19,911 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:19,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:25:19,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:25:19,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:25:19,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:25:19,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:25:19,912 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 7 states. [2018-01-30 00:25:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:25:20,189 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-01-30 00:25:20,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:25:20,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-30 00:25:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:25:20,190 INFO L225 Difference]: With dead ends: 158 [2018-01-30 00:25:20,190 INFO L226 Difference]: Without dead ends: 154 [2018-01-30 00:25:20,191 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:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-30 00:25:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 96. [2018-01-30 00:25:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:25:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-01-30 00:25:20,196 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 32 [2018-01-30 00:25:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:25:20,196 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-01-30 00:25:20,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:25:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-01-30 00:25:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:25:20,198 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:25:20,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:25:20,198 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 00:25:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1745969383, now seen corresponding path program 1 times [2018-01-30 00:25:20,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:25:20,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:25:20,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:20,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:25:20,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:25:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:25:20,241 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:25:20,257 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-30 00:25:20,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:25:20 BoogieIcfgContainer [2018-01-30 00:25:20,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:25:20,276 INFO L168 Benchmark]: Toolchain (without parser) took 3764.23 ms. Allocated memory was 309.3 MB in the beginning and 516.9 MB in the end (delta: 207.6 MB). Free memory was 269.4 MB in the beginning and 405.6 MB in the end (delta: -136.2 MB). Peak memory consumption was 71.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:20,277 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:25:20,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.30 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 257.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:20,277 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 ms. Allocated memory is still 309.3 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-30 00:25:20,278 INFO L168 Benchmark]: RCFGBuilder took 371.09 ms. Allocated memory is still 309.3 MB. Free memory was 255.4 MB in the beginning and 229.8 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:20,278 INFO L168 Benchmark]: TraceAbstraction took 3130.80 ms. Allocated memory was 309.3 MB in the beginning and 516.9 MB in the end (delta: 207.6 MB). Free memory was 229.8 MB in the beginning and 405.6 MB in the end (delta: -175.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:25:20,279 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.17 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.30 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 257.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 309.3 MB. Free memory was 257.4 MB in the beginning and 256.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 371.09 ms. Allocated memory is still 309.3 MB. Free memory was 255.4 MB in the beginning and 229.8 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3130.80 ms. Allocated memory was 309.3 MB in the beginning and 516.9 MB in the end (delta: 207.6 MB). Free memory was 229.8 MB in the beginning and 405.6 MB in the end (delta: -175.8 MB). Peak memory consumption was 31.8 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] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L645] FCALL p->h = 3 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L647] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L647] COND FALSE !(p->h == 1) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L649] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L649] COND FALSE !(p->h == 2) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L653] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 25 error locations. UNSAFE Result, 3.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 623 SDtfs, 1234 SDslu, 1478 SDs, 0 SdLazy, 1156 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred 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, 8 MinimizatonAttempts, 427 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 17306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 18/18 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/list_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-20-286.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_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-20-286.csv Received shutdown request...