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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:09:31,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:09:31,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:09:31,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:09:31,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:09:31,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:09:31,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:09:31,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:09:31,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:09:31,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:09:31,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:09:31,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:09:31,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:09:31,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:09:31,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:09:31,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:09:31,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:09:31,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:09:31,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:09:31,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:09:31,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:09:31,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:09:31,497 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:09:31,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:09:31,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:09:31,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:09:31,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:09:31,501 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:09:31,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:09:31,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:09:31,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:09:31,503 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_precise.epf [2018-01-25 00:09:31,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:09:31,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:09:31,512 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:09:31,512 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:09:31,512 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:09:31,512 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:09:31,512 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:09:31,513 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:09:31,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:09:31,513 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:09:31,513 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:09:31,514 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:09:31,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:09:31,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:09:31,515 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:09:31,515 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:09:31,515 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:09:31,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:09:31,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:09:31,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:09:31,517 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:09:31,517 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:09:31,517 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:09:31,517 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:09:31,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:09:31,558 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:09:31,561 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:09:31,563 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:09:31,563 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:09:31,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-25 00:09:31,738 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:09:31,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:09:31,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:09:31,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:09:31,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:09:31,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3383522d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31, skipping insertion in model container [2018-01-25 00:09:31,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,766 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:09:31,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:09:31,929 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:09:31,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:09:31,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31 WrapperNode [2018-01-25 00:09:31,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:09:31,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:09:31,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:09:31,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:09:31,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (1/1) ... [2018-01-25 00:09:31,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:09:31,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:09:31,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:09:31,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:09:31,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (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 00:09:32,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:09:32,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:09:32,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:09:32,038 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:09:32,038 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:09:32,039 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:09:32,040 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:09:32,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:09:32,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:09:32,215 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:09:32,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:09:32 BoogieIcfgContainer [2018-01-25 00:09:32,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:09:32,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:09:32,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:09:32,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:09:32,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:09:31" (1/3) ... [2018-01-25 00:09:32,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264746ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:09:32, skipping insertion in model container [2018-01-25 00:09:32,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:09:31" (2/3) ... [2018-01-25 00:09:32,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264746ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:09:32, skipping insertion in model container [2018-01-25 00:09:32,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:09:32" (3/3) ... [2018-01-25 00:09:32,221 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-25 00:09:32,227 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:09:32,233 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 00:09:32,284 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:09:32,284 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:09:32,284 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:09:32,284 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:09:32,284 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:09:32,284 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:09:32,285 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:09:32,285 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:09:32,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:09:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 00:09:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:09:32,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:32,314 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:09:32,314 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-25 00:09:32,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:32,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:32,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:32,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:32,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:32,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:32,532 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 00:09:32,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:32,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:09:32,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:32,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:09:32,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:09:32,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:09:32,557 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 00:09:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:32,736 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-25 00:09:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:09:32,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:09:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:32,752 INFO L225 Difference]: With dead ends: 95 [2018-01-25 00:09:32,752 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:09:32,756 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:09:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:09:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-25 00:09:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 00:09:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-25 00:09:32,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-25 00:09:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:32,806 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-25 00:09:32,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:09:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-25 00:09:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:09:32,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:32,808 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:09:32,808 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-25 00:09:32,809 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:32,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:32,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:32,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:32,811 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:32,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:32,890 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 00:09:32,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:32,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:09:32,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:32,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:09:32,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:09:32,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:09:32,900 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-25 00:09:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,035 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-25 00:09:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:09:33,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:09:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,037 INFO L225 Difference]: With dead ends: 75 [2018-01-25 00:09:33,037 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 00:09:33,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:09:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 00:09:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-25 00:09:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 00:09:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 00:09:33,044 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-25 00:09:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,044 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 00:09:33,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:09:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 00:09:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:09:33,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,045 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 00:09:33,045 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-25 00:09:33,045 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,047 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,099 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 00:09:33,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:09:33,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:09:33,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:09:33,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,100 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-25 00:09:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,131 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 00:09:33,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:09:33,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 00:09:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,133 INFO L225 Difference]: With dead ends: 70 [2018-01-25 00:09:33,133 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 00:09:33,133 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 00:09:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-25 00:09:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 00:09:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-25 00:09:33,140 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-25 00:09:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,140 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-25 00:09:33,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:09:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-25 00:09:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:09:33,141 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,141 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 00:09:33,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-25 00:09:33,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,143 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,186 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 00:09:33,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:09:33,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:09:33,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:09:33,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,188 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-25 00:09:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,246 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-25 00:09:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:09:33,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 00:09:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,248 INFO L225 Difference]: With dead ends: 71 [2018-01-25 00:09:33,248 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 00:09:33,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 00:09:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-25 00:09:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 00:09:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-25 00:09:33,260 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-25 00:09:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,260 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-25 00:09:33,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:09:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-25 00:09:33,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:09:33,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,261 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 00:09:33,261 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-25 00:09:33,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,264 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,322 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 00:09:33,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:09:33,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:09:33,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:09:33,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,323 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-25 00:09:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,352 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-25 00:09:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:09:33,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 00:09:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,354 INFO L225 Difference]: With dead ends: 80 [2018-01-25 00:09:33,354 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 00:09:33,355 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 00:09:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 00:09:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 00:09:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-25 00:09:33,359 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-25 00:09:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,360 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-25 00:09:33,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:09:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-25 00:09:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:09:33,360 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,360 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 00:09:33,361 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-25 00:09:33,361 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,362 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,420 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 00:09:33,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:09:33,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:09:33,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:09:33,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:09:33,422 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-25 00:09:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,461 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 00:09:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:09:33,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 00:09:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,463 INFO L225 Difference]: With dead ends: 45 [2018-01-25 00:09:33,463 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 00:09:33,463 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:09:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 00:09:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 00:09:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 00:09:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 00:09:33,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-25 00:09:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,470 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 00:09:33,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:09:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 00:09:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:09:33,471 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,471 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 00:09:33,471 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-25 00:09:33,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,528 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 00:09:33,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:09:33,528 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:09:33,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:09:33,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:09:33,530 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 00:09:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,662 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 00:09:33,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:09:33,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 00:09:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,664 INFO L225 Difference]: With dead ends: 52 [2018-01-25 00:09:33,664 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 00:09:33,664 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:09:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 00:09:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-25 00:09:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 00:09:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-25 00:09:33,670 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-25 00:09:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,671 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-25 00:09:33,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:09:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-25 00:09:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:09:33,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,672 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 00:09:33,672 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-25 00:09:33,672 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,721 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 00:09:33,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:09:33,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:09:33,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:09:33,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:09:33,722 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-25 00:09:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,755 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-25 00:09:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:09:33,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 00:09:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,756 INFO L225 Difference]: With dead ends: 94 [2018-01-25 00:09:33,757 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 00:09:33,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:09:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 00:09:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-25 00:09:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 00:09:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-25 00:09:33,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-25 00:09:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,767 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-25 00:09:33,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:09:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-25 00:09:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:09:33,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,769 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:09:33,769 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-25 00:09:33,769 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 00:09:33,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:09:33,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:09:33,831 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:33,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:09:33,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:09:33,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,832 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-25 00:09:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:33,847 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-25 00:09:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:09:33,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 00:09:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:33,850 INFO L225 Difference]: With dead ends: 106 [2018-01-25 00:09:33,850 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 00:09:33,851 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:09:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 00:09:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-25 00:09:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 00:09:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 00:09:33,904 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-25 00:09:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:33,904 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 00:09:33,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:09:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 00:09:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:09:33,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:33,906 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:09:33,906 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-25 00:09:33,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:33,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:33,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:33,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:33,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:09:34,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:09:34,093 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:09:34,094 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:09:34,095 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [39], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-25 00:09:34,136 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:09:34,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:09:35,623 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:09:35,625 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:09:35,652 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:09:36,387 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 00:09:36,388 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:09:36,706 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:09:36,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:09:36,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-25 00:09:36,707 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:09:36,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 00:09:36,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 00:09:36,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-25 00:09:36,708 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2018-01-25 00:09:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:09:47,378 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-25 00:09:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 00:09:47,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-25 00:09:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:09:47,381 INFO L225 Difference]: With dead ends: 107 [2018-01-25 00:09:47,382 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 00:09:47,382 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-01-25 00:09:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 00:09:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2018-01-25 00:09:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 00:09:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 00:09:47,393 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2018-01-25 00:09:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:09:47,393 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 00:09:47,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 00:09:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 00:09:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:09:47,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:09:47,394 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:09:47,395 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:09:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-25 00:09:47,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:09:47,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:47,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:47,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:09:47,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:09:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:47,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:09:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:09:47,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:09:47,792 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:09:47,793 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:09:47,793 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [40], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-25 00:09:47,794 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:09:47,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:09:48,468 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:09:48,469 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:09:48,476 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:09:48,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:09:48,477 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 00:09:48,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:09:48,489 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:09:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:09:48,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:09:48,604 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 23 treesize of output 22 [2018-01-25 00:09:48,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:48,629 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 26 treesize of output 25 [2018-01-25 00:09:48,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:48,632 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 22 treesize of output 21 [2018-01-25 00:09:48,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:48,667 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 25 treesize of output 24 [2018-01-25 00:09:48,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:48,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:09:48,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:09:48,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:48,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:48,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-25 00:09:48,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:49,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:49,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:49,035 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 45 treesize of output 39 [2018-01-25 00:09:49,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:49,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:49,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:09:49,085 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 46 treesize of output 40 [2018-01-25 00:09:49,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:49,150 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 39 treesize of output 38 [2018-01-25 00:09:49,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:49,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-25 00:09:49,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:09:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:09:49,300 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:09:50,027 WARN L146 SmtUtils]: Spent 622ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 00:09:50,047 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 00:09:58,267 WARN L146 SmtUtils]: Spent 8110ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-25 00:09:58,297 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 00:09:58,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-25 00:09:58,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:58,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-25 00:09:58,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 [2018-01-25 00:09:58,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:58,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:09:58,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-25 00:09:58,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:09:58,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:09:58,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 00:09:59,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 34 [2018-01-25 00:10:00,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 52 treesize of output 46 [2018-01-25 00:10:00,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 00:10:00,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 5 [2018-01-25 00:10:00,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 00:10:00,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 00:10:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:10:00,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:10:00,260 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 00:10:00,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:10:00,264 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:10:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:10:00,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:10:00,336 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 23 treesize of output 22 [2018-01-25 00:10:00,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,388 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 26 treesize of output 25 [2018-01-25 00:10:00,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,402 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 25 treesize of output 24 [2018-01-25 00:10:00,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,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 22 treesize of output 21 [2018-01-25 00:10:00,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:10:00,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:10:00,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:10:00,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:10:00,527 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 54 treesize of output 48 [2018-01-25 00:10:00,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:10:00,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-25 00:10:00,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:10:00,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:10:00,625 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 45 treesize of output 39 [2018-01-25 00:10:00,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,667 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 39 treesize of output 38 [2018-01-25 00:10:00,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:00,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-25 00:10:00,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:10:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:10:02,774 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:10:02,898 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 00:10:04,033 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 00:10:16,296 WARN L146 SmtUtils]: Spent 8073ms on a formula simplification. DAG size of input: 83 DAG size of output 73 [2018-01-25 00:10:16,300 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:10:16,307 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:10:16,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-25 00:10:16,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 [2018-01-25 00:10:16,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:16,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:10:16,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-25 00:10:16,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:16,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 16 [2018-01-25 00:10:16,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:16,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:10:16,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 00:10:19,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 34 [2018-01-25 00:10:19,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:19,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 52 treesize of output 46 [2018-01-25 00:10:19,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:19,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 00:10:19,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 5 [2018-01-25 00:10:19,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:10:19,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:10:19,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 00:10:19,120 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 00:10:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:10:21,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:10:21,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11, 11] total 31 [2018-01-25 00:10:21,221 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:10:21,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 00:10:21,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 00:10:21,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=893, Unknown=3, NotChecked=0, Total=992 [2018-01-25 00:10:21,223 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2018-01-25 00:10:21,640 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 00:10:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:10:23,843 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:10:23,846 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:10:23,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:10:23 BoogieIcfgContainer [2018-01-25 00:10:23,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:10:23,848 INFO L168 Benchmark]: Toolchain (without parser) took 52108.88 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 264.2 MB in the beginning and 592.0 MB in the end (delta: -327.8 MB). Peak memory consumption was 749.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:10:23,848 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:10:23,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.17 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:10:23,849 INFO L168 Benchmark]: Boogie Preprocessor took 33.44 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:10:23,849 INFO L168 Benchmark]: RCFGBuilder took 225.85 ms. Allocated memory is still 305.1 MB. Free memory was 249.2 MB in the beginning and 232.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-25 00:10:23,849 INFO L168 Benchmark]: TraceAbstraction took 51630.54 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.6 MB in the beginning and 592.0 MB in the end (delta: -360.4 MB). Peak memory consumption was 716.5 MB. Max. memory is 5.3 GB. [2018-01-25 00:10:23,850 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.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.17 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.44 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.85 ms. Allocated memory is still 305.1 MB. Free memory was 249.2 MB in the beginning and 232.6 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51630.54 ms. Allocated memory was 305.1 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.6 MB in the beginning and 592.0 MB in the end (delta: -360.4 MB). Peak memory consumption was 716.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 133 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.358595 RENAME_VARIABLES(MILLISECONDS) : 0.096819 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.315114 PROJECTAWAY(MILLISECONDS) : 0.052058 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.123398 DISJOIN(MILLISECONDS) : 0.611255 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.210612 ADD_EQUALITY(MILLISECONDS) : 0.019077 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013743 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.405249 RENAME_VARIABLES(MILLISECONDS) : 0.087626 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.158243 PROJECTAWAY(MILLISECONDS) : 0.054697 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048876 DISJOIN(MILLISECONDS) : 0.561015 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.108833 ADD_EQUALITY(MILLISECONDS) : 0.017766 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006911 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 78 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 51.5s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 425 SDslu, 1260 SDs, 0 SdLazy, 431 SolverSat, 80 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 210 GetRequests, 108 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 33.6s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 341 ConstructedInterpolants, 54 QuantifiedInterpolants, 121272 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 13/40 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/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-10-23-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-10-23-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-10-23-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_00-10-23-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_00-10-23-859.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-10-23-859.csv Completed graceful shutdown