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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:30:32,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:30:32,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:30:32,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:30:32,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:30:32,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:30:32,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:30:32,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:30:32,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:30:32,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:30:32,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:30:32,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:30:32,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:30:32,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:30:32,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:30:32,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:30:32,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:30:32,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:30:32,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:30:32,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:30:32,072 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:30:32,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:30:32,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:30:32,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:30:32,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:30:32,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:30:32,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:30:32,077 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:30:32,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:30:32,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:30:32,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:30:32,079 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:30:32,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:30:32,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:30:32,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:30:32,090 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:30:32,090 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:30:32,090 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:30:32,090 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:30:32,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:30:32,090 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:30:32,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:30:32,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:30:32,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:30:32,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:30:32,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:30:32,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:30:32,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:30:32,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:30:32,093 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:30:32,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:30:32,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:30:32,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:30:32,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:30:32,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:30:32,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:30:32,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:30:32,097 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:30:32,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:30:32,159 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:30:32,172 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:30:32,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:30:32,174 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:30:32,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i [2018-01-25 02:30:32,372 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:30:32,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:30:32,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:30:32,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:30:32,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:30:32,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a60e38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32, skipping insertion in model container [2018-01-25 02:30:32,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,402 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:30:32,442 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:30:32,568 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:30:32,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:30:32,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32 WrapperNode [2018-01-25 02:30:32,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:30:32,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:30:32,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:30:32,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:30:32,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (1/1) ... [2018-01-25 02:30:32,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:30:32,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:30:32,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:30:32,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:30:32,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (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-25 02:30:32,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:30:32,692 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:30:32,692 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-25 02:30:32,692 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-25 02:30:32,693 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:30:32,694 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:30:32,694 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:30:33,026 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:30:33,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:30:33 BoogieIcfgContainer [2018-01-25 02:30:33,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:30:33,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:30:33,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:30:33,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:30:33,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:30:32" (1/3) ... [2018-01-25 02:30:33,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba29f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:30:33, skipping insertion in model container [2018-01-25 02:30:33,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:32" (2/3) ... [2018-01-25 02:30:33,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba29f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:30:33, skipping insertion in model container [2018-01-25 02:30:33,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:30:33" (3/3) ... [2018-01-25 02:30:33,035 INFO L105 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-01-25 02:30:33,043 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:30:33,050 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-01-25 02:30:33,093 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:30:33,093 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:30:33,093 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:30:33,093 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:30:33,093 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:30:33,093 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:30:33,093 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:30:33,094 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:30:33,094 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:30:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-25 02:30:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:30:33,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:33,121 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:33,121 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-01-25 02:30:33,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:33,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:33,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:33,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:33,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:33,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:33,439 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-25 02:30:33,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:33,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:30:33,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:33,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:30:33,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:30:33,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:30:33,566 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-01-25 02:30:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:33,759 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2018-01-25 02:30:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:30:33,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 02:30:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:33,771 INFO L225 Difference]: With dead ends: 134 [2018-01-25 02:30:33,771 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:30:33,775 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:30:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:30:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 02:30:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:30:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 02:30:33,817 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-01-25 02:30:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:33,818 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 02:30:33,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:30:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 02:30:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:30:33,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:33,819 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:33,819 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-01-25 02:30:33,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:33,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:33,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:33,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:33,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:33,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:34,088 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-25 02:30:34,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:34,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:30:34,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:34,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:30:34,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:30:34,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:30:34,091 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-01-25 02:30:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:34,404 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-01-25 02:30:34,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:30:34,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 02:30:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:34,408 INFO L225 Difference]: With dead ends: 95 [2018-01-25 02:30:34,408 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 02:30:34,409 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:30:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 02:30:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-01-25 02:30:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 02:30:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-25 02:30:34,417 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2018-01-25 02:30:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:34,418 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-25 02:30:34,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:30:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-25 02:30:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:30:34,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:34,419 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:34,420 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-01-25 02:30:34,421 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:34,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:34,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:34,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:34,475 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-25 02:30:34,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:34,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:30:34,476 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:34,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:30:34,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:30:34,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:30:34,477 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-01-25 02:30:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:34,569 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-01-25 02:30:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:30:34,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 02:30:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:34,571 INFO L225 Difference]: With dead ends: 77 [2018-01-25 02:30:34,571 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 02:30:34,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:30:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 02:30:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-25 02:30:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 02:30:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-01-25 02:30:34,583 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2018-01-25 02:30:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:34,583 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-01-25 02:30:34,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:30:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-01-25 02:30:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:30:34,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:34,585 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:34,585 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:34,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-01-25 02:30:34,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:34,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:34,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,587 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:34,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:34,704 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-25 02:30:34,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:34,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:30:34,704 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:34,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:30:34,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:30:34,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:30:34,706 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 8 states. [2018-01-25 02:30:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:34,922 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-01-25 02:30:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:30:34,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-25 02:30:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:34,924 INFO L225 Difference]: With dead ends: 94 [2018-01-25 02:30:34,924 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 02:30:34,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:30:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 02:30:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-01-25 02:30:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 02:30:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-01-25 02:30:34,938 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2018-01-25 02:30:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:34,938 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-01-25 02:30:34,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:30:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-01-25 02:30:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:30:34,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:34,940 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:34,940 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-01-25 02:30:34,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:34,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:34,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:34,943 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:34,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:34,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:34,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:30:34,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:35,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:30:35,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:30:35,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:30:35,000 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2018-01-25 02:30:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:35,127 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-25 02:30:35,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:30:35,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:30:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:35,128 INFO L225 Difference]: With dead ends: 141 [2018-01-25 02:30:35,128 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 02:30:35,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:30:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 02:30:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-01-25 02:30:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 02:30:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-25 02:30:35,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 20 [2018-01-25 02:30:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:35,143 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-25 02:30:35,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:30:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-25 02:30:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:30:35,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:35,144 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:35,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:30:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -304076685, now seen corresponding path program 1 times [2018-01-25 02:30:35,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:35,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:35,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:35,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:35,146 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:35,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:35,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:30:35,393 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:30:35,395 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-25 02:30:35,397 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [128], [133], [134], [135], [137] [2018-01-25 02:30:35,454 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:30:35,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:31:16,333 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:31:16,334 INFO L268 AbstractInterpreter]: Visited 18 different actions 29 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 02:31:16,342 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:31:16,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:16,342 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 02:31:16,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:16,353 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:16,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:16,412 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-25 02:31:16,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:31:16,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 15 [2018-01-25 02:31:16,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-25 02:31:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:16,529 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:31:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:16,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:16,767 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:31:16,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:16,771 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:16,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:16,804 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-25 02:31:16,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,818 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 6 treesize of output 5 [2018-01-25 02:31:16,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 02:31:16,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:31:16,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-25 02:31:16,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:31:16,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:31:16,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:31:16,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:16,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:31:16,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 02:31:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:16,962 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:31:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:17,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:31:17,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 22 [2018-01-25 02:31:17,257 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:31:17,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:31:17,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:31:17,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-01-25 02:31:17,258 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-01-25 02:31:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:17,882 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-25 02:31:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:31:17,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-01-25 02:31:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:17,884 INFO L225 Difference]: With dead ends: 91 [2018-01-25 02:31:17,884 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 02:31:17,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2018-01-25 02:31:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 02:31:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-01-25 02:31:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:31:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-01-25 02:31:17,894 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 20 [2018-01-25 02:31:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:17,894 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-01-25 02:31:17,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:31:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-01-25 02:31:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:31:17,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:17,895 INFO L322 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-25 02:31:17,895 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:17,896 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-01-25 02:31:17,896 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:17,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:17,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:17,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:17,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:17,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:17,973 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-25 02:31:17,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:31:17,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:31:17,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:17,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:31:17,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:31:17,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:31:17,974 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 7 states. [2018-01-25 02:31:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:18,048 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-01-25 02:31:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:31:18,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-25 02:31:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:18,049 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:31:18,050 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 02:31:18,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:31:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 02:31:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 02:31:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 02:31:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-01-25 02:31:18,057 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 22 [2018-01-25 02:31:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:18,057 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-01-25 02:31:18,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:31:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-01-25 02:31:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:31:18,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:18,058 INFO L322 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] [2018-01-25 02:31:18,058 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr19RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr0RequiresViolation, lisErr2RequiresViolation, lisErr22RequiresViolation, lisErr12RequiresViolation, lisErr3RequiresViolation, lisErr16RequiresViolation, lisErr10RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr25RequiresViolation, lisErr13RequiresViolation, lisErr23RequiresViolation, lisErr9RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr1RequiresViolation, lisErr14RequiresViolation, lisErr24RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-01-25 02:31:18,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:18,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:18,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:18,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:18,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:18,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:18,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:18,130 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:31:18,131 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 02:31:18,131 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [13], [15], [16], [19], [23], [27], [31], [36], [40], [45], [48], [128], [133], [134], [135], [137] [2018-01-25 02:31:18,132 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:31:18,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:31:26,053 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:31:26,054 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:31:26,054 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:31:26,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:26,054 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:31:26,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:26,062 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:26,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:26,093 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:31:26,093 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:31:26,098 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:31:26,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:31:26 BoogieIcfgContainer [2018-01-25 02:31:26,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:31:26,099 INFO L168 Benchmark]: Toolchain (without parser) took 53726.88 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 260.5 MB in the beginning and 489.3 MB in the end (delta: -228.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 02:31:26,100 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 303.6 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:31:26,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.60 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:26,100 INFO L168 Benchmark]: Boogie Preprocessor took 41.39 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:26,100 INFO L168 Benchmark]: RCFGBuilder took 386.40 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 223.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:26,101 INFO L168 Benchmark]: TraceAbstraction took 53070.03 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.6 MB in the beginning and 489.3 MB in the end (delta: -265.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 02:31:26,102 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.25 ms. Allocated memory is still 303.6 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.60 ms. Allocated memory is still 303.6 MB. Free memory was 260.5 MB in the beginning and 250.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.39 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 386.40 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 223.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53070.03 ms. Allocated memory was 303.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.6 MB in the beginning and 489.3 MB in the end (delta: -265.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 16.614024 RENAME_VARIABLES(MILLISECONDS) : 3.737952 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 16.535183 PROJECTAWAY(MILLISECONDS) : 3516.861284 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.086964 DISJOIN(MILLISECONDS) : 4.131319 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.801220 ADD_EQUALITY(MILLISECONDS) : 0.038687 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014537 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 92 #UNFREEZE : 0 #CONJOIN : 94 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 87 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 27 error locations. TIMEOUT Result, 53.0s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 335 SDtfs, 1144 SDslu, 460 SDs, 0 SdLazy, 598 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 48.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 59 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 193 ConstructedInterpolants, 26 QuantifiedInterpolants, 35117 SizeOfPredicates, 14 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 6/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-31-26-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-31-26-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-31-26-112.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-31-26-112.csv Completed graceful shutdown