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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:42:05,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:42:05,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:42:05,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:42:05,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:42:05,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:42:05,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:42:05,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:42:05,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:42:05,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:42:05,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:42:05,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:42:05,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:42:05,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:42:05,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:42:05,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:42:05,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:42:05,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:42:05,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:42:05,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:42:05,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:42:05,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:42:05,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:42:05,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:42:05,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:42:05,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:42:05,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:42:05,495 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:42:05,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:42:05,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:42:05,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:42:05,496 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_mostprecise.epf [2018-01-24 19:42:05,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:42:05,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:42:05,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:42:05,506 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:42:05,506 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:42:05,506 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:42:05,506 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:42:05,506 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:42:05,506 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:42:05,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:42:05,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:42:05,507 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:42:05,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:42:05,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:42:05,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:42:05,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:42:05,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:42:05,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:42:05,509 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:42:05,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:42:05,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:42:05,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:42:05,510 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:42:05,511 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:42:05,511 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:42:05,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:42:05,554 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:42:05,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:42:05,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:42:05,558 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:42:05,559 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-24 19:42:05,716 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:42:05,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:42:05,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:42:05,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:42:05,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:42:05,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a408f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05, skipping insertion in model container [2018-01-24 19:42:05,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,745 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:42:05,784 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:42:05,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:42:05,921 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:42:05,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05 WrapperNode [2018-01-24 19:42:05,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:42:05,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:42:05,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:42:05,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:42:05,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (1/1) ... [2018-01-24 19:42:05,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:42:05,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:42:05,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:42:05,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:42:05,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (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-24 19:42:06,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:42:06,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:42:06,017 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-24 19:42:06,017 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:42:06,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:42:06,017 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:42:06,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:42:06,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:42:06,335 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:42:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:42:06 BoogieIcfgContainer [2018-01-24 19:42:06,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:42:06,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:42:06,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:42:06,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:42:06,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:42:05" (1/3) ... [2018-01-24 19:42:06,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7be3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:42:06, skipping insertion in model container [2018-01-24 19:42:06,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:42:05" (2/3) ... [2018-01-24 19:42:06,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7be3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:42:06, skipping insertion in model container [2018-01-24 19:42:06,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:42:06" (3/3) ... [2018-01-24 19:42:06,344 INFO L105 eAbstractionObserver]: Analyzing ICFG lis_unsafe_false-valid-deref.i [2018-01-24 19:42:06,354 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:42:06,362 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-01-24 19:42:06,413 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:42:06,413 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:42:06,413 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:42:06,413 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:42:06,413 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:42:06,414 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:42:06,414 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:42:06,414 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:42:06,415 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:42:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-24 19:42:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 19:42:06,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:06,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:42:06,446 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-24 19:42:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -40654889, now seen corresponding path program 1 times [2018-01-24 19:42:06,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:06,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:06,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:06,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:06,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:06,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:06,702 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-24 19:42:06,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:06,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:42:06,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:06,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:42:06,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:42:06,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:42:06,798 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-01-24 19:42:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:06,999 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2018-01-24 19:42:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:42:07,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 19:42:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:07,011 INFO L225 Difference]: With dead ends: 134 [2018-01-24 19:42:07,012 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 19:42:07,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:42:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 19:42:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 19:42:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 19:42:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 19:42:07,050 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2018-01-24 19:42:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:07,051 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 19:42:07,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:42:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 19:42:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 19:42:07,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:07,051 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:42:07,052 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-24 19:42:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash -40654888, now seen corresponding path program 1 times [2018-01-24 19:42:07,052 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:07,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:07,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:07,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:07,207 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-24 19:42:07,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:07,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:42:07,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:07,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:42:07,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:42:07,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:42:07,213 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 7 states. [2018-01-24 19:42:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:07,483 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-01-24 19:42:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:42:07,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-24 19:42:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:07,509 INFO L225 Difference]: With dead ends: 95 [2018-01-24 19:42:07,509 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 19:42:07,510 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-24 19:42:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 19:42:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-01-24 19:42:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 19:42:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-24 19:42:07,518 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2018-01-24 19:42:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:07,518 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-24 19:42:07,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:42:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-24 19:42:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 19:42:07,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:07,520 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:42:07,520 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-24 19:42:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301570, now seen corresponding path program 1 times [2018-01-24 19:42:07,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:07,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:07,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:07,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:07,578 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-24 19:42:07,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:07,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:42:07,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:07,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:42:07,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:42:07,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:42:07,580 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-01-24 19:42:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:07,640 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-01-24 19:42:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:42:07,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 19:42:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:07,642 INFO L225 Difference]: With dead ends: 77 [2018-01-24 19:42:07,642 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 19:42:07,642 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-24 19:42:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 19:42:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 19:42:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 19:42:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2018-01-24 19:42:07,653 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2018-01-24 19:42:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:07,654 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2018-01-24 19:42:07,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:42:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-01-24 19:42:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 19:42:07,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:07,655 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:42:07,655 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-24 19:42:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1260301569, now seen corresponding path program 1 times [2018-01-24 19:42:07,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:07,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:07,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:07,771 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-24 19:42:07,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:07,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:42:07,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:07,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:42:07,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:42:07,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:42:07,772 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 8 states. [2018-01-24 19:42:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:07,967 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-01-24 19:42:07,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:42:07,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 19:42:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:07,969 INFO L225 Difference]: With dead ends: 94 [2018-01-24 19:42:07,970 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 19:42:07,970 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-24 19:42:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 19:42:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-01-24 19:42:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 19:42:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-01-24 19:42:07,981 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2018-01-24 19:42:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:07,981 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-01-24 19:42:07,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:42:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-01-24 19:42:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:42:07,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:07,983 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-24 19:42:07,983 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-24 19:42:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1752664061, now seen corresponding path program 1 times [2018-01-24 19:42:07,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:07,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:07,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:07,985 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:07,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:08,060 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-24 19:42:08,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:08,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:42:08,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:08,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:42:08,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:42:08,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:42:08,061 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2018-01-24 19:42:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:08,172 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-24 19:42:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:42:08,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 19:42:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:08,173 INFO L225 Difference]: With dead ends: 141 [2018-01-24 19:42:08,173 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 19:42:08,173 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-24 19:42:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 19:42:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-01-24 19:42:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 19:42:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-24 19:42:08,181 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 20 [2018-01-24 19:42:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:08,181 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-24 19:42:08,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:42:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-24 19:42:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:42:08,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:08,182 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-24 19:42:08,182 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-24 19:42:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -304076685, now seen corresponding path program 1 times [2018-01-24 19:42:08,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:08,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:08,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:08,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:08,184 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:08,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:08,328 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-24 19:42:08,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:42:08,329 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:42:08,330 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-24 19:42:08,332 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [128], [133], [134], [135], [137] [2018-01-24 19:42:08,393 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:42:08,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:42:44,319 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:42:44,320 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-24 19:42:44,327 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:42:44,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:42:44,327 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-24 19:42:44,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:44,340 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:42:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:44,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:42:44,404 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-24 19:42:44,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:42:44,430 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-24 19:42:44,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-24 19:42:44,502 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-24 19:42:44,502 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:42:44,724 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-24 19:42:44,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:42:44,754 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-24 19:42:44,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:44,758 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:42:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:44,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:42:44,795 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-24 19:42:44,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,801 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-24 19:42:44,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 19:42:44,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:42:44,821 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-24 19:42:44,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:42:44,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:42:44,836 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-24 19:42:44,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:42:44,843 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-24 19:42:44,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-24 19:42:44,949 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-24 19:42:44,949 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:42:45,115 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-24 19:42:45,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:42:45,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 22 [2018-01-24 19:42:45,117 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:42:45,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:42:45,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:42:45,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-01-24 19:42:45,118 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 11 states. [2018-01-24 19:42:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:45,554 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-24 19:42:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:42:45,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-01-24 19:42:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:45,555 INFO L225 Difference]: With dead ends: 91 [2018-01-24 19:42:45,555 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 19:42:45,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2018-01-24 19:42:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 19:42:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-01-24 19:42:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 19:42:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-01-24 19:42:45,565 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 20 [2018-01-24 19:42:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:45,565 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-01-24 19:42:45,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:42:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-01-24 19:42:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:42:45,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:45,566 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-24 19:42:45,566 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-24 19:42:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -692554244, now seen corresponding path program 1 times [2018-01-24 19:42:45,567 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:45,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:45,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:45,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:45,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:45,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:45,658 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-24 19:42:45,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:42:45,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:42:45,659 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:42:45,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:42:45,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:42:45,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:42:45,659 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 7 states. [2018-01-24 19:42:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:42:45,727 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-01-24 19:42:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:42:45,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-24 19:42:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:42:45,728 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:42:45,729 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 19:42:45,729 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-24 19:42:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 19:42:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-24 19:42:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 19:42:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-01-24 19:42:45,738 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 22 [2018-01-24 19:42:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:42:45,738 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-01-24 19:42:45,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:42:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-01-24 19:42:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 19:42:45,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:42:45,740 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-24 19:42:45,740 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-24 19:42:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1804279880, now seen corresponding path program 1 times [2018-01-24 19:42:45,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:42:45,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:45,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:42:45,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:42:45,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:42:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:42:45,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:42:45,836 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-24 19:42:45,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:42:45,837 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:42:45,837 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 19:42:45,837 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-24 19:42:45,838 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:42:45,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 19:43:01,613 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 19:43:01,614 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 19:43:01,614 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:43:01,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:01,614 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-24 19:43:01,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:01,624 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:43:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:01,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:01,643 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 19:43:01,643 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:43:01,647 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:43:01,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:43:01 BoogieIcfgContainer [2018-01-24 19:43:01,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:43:01,648 INFO L168 Benchmark]: Toolchain (without parser) took 55932.10 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 261.3 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 116.4 MB. Max. memory is 5.3 GB. [2018-01-24 19:43:01,649 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:43:01,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.25 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:43:01,649 INFO L168 Benchmark]: Boogie Preprocessor took 37.13 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:43:01,649 INFO L168 Benchmark]: RCFGBuilder took 367.94 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 224.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-24 19:43:01,650 INFO L168 Benchmark]: TraceAbstraction took 55311.06 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 224.7 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 79.8 MB. Max. memory is 5.3 GB. [2018-01-24 19:43:01,651 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.16 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.25 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.13 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 367.94 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 224.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55311.06 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 224.7 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 79.8 MB. 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) : 14.760715 RENAME_VARIABLES(MILLISECONDS) : 5.690446 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 14.697922 PROJECTAWAY(MILLISECONDS) : 3054.955237 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.083612 DISJOIN(MILLISECONDS) : 3.366134 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 5.742627 ADD_EQUALITY(MILLISECONDS) : 0.040240 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015260 #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, 55.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.4s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s 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, 51.7s 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.3s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-43-01-660.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-43-01-660.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-43-01-660.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-43-01-660.csv Completed graceful shutdown