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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:25:47,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:25:47,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:25:47,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:25:47,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:25:47,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:25:47,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:25:47,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:25:47,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:25:47,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:25:47,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:25:47,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:25:47,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:25:47,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:25:47,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:25:47,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:25:47,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:25:47,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:25:47,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:25:47,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:25:47,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:25:47,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:25:47,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:25:47,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:25:47,419 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:25:47,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:25:47,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:25:47,420 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:25:47,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:25:47,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:25:47,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:25:47,421 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:25:47,430 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:25:47,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:25:47,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:25:47,431 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:25:47,431 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:25:47,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:25:47,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:25:47,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:25:47,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:25:47,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:25:47,433 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:25:47,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:25:47,467 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:25:47,469 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:25:47,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:25:47,470 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:25:47,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:47,591 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:25:47,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:25:47,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:47,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:25:47,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:25:47,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cddf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47, skipping insertion in model container [2018-02-04 17:25:47,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,609 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:47,634 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:47,723 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:47,736 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47 WrapperNode [2018-02-04 17:25:47,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:47,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:25:47,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:25:47,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:25:47,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... [2018-02-04 17:25:47,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:25:47,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:25:47,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:25:47,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:25:47,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:25:47,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:25:47,799 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:25:47,799 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-02-04 17:25:47,799 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-02-04 17:25:47,799 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:25:47,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:25:47,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:25:47,921 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:25:47,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:47 BoogieIcfgContainer [2018-02-04 17:25:47,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:25:47,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:25:47,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:25:47,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:25:47,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:25:47" (1/3) ... [2018-02-04 17:25:47,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7154bc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:47, skipping insertion in model container [2018-02-04 17:25:47,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:47" (2/3) ... [2018-02-04 17:25:47,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7154bc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:47, skipping insertion in model container [2018-02-04 17:25:47,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:47" (3/3) ... [2018-02-04 17:25:47,929 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:47,936 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:25:47,943 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 17:25:47,976 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:25:47,977 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:25:47,977 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:25:47,977 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:25:47,977 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:25:47,977 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:25:47,977 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:25:47,977 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:25:47,978 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:25:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 17:25:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:25:47,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:47,998 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:47,998 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-02-04 17:25:48,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,041 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:48,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:25:48,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:25:48,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:25:48,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:25:48,134 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-02-04 17:25:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:48,172 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 17:25:48,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:25:48,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:25:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:48,179 INFO L225 Difference]: With dead ends: 33 [2018-02-04 17:25:48,179 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 17:25:48,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:25:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 17:25:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 17:25:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 17:25:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-02-04 17:25:48,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-02-04 17:25:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:48,249 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-02-04 17:25:48,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:25:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-02-04 17:25:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:25:48,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:48,250 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:48,250 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-02-04 17:25:48,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,250 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:48,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:25:48,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:25:48,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:25:48,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:25:48,276 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-02-04 17:25:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:48,299 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-02-04 17:25:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:25:48,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 17:25:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:48,300 INFO L225 Difference]: With dead ends: 28 [2018-02-04 17:25:48,300 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 17:25:48,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-04 17:25:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 17:25:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-02-04 17:25:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:25:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 17:25:48,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 17:25:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:48,305 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 17:25:48,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:25:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 17:25:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:25:48,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:48,306 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:48,306 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-02-04 17:25:48,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,306 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:48,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:48,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:48,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:48,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:48,401 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-02-04 17:25:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:48,484 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 17:25:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:48,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 17:25:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:48,485 INFO L225 Difference]: With dead ends: 25 [2018-02-04 17:25:48,485 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 17:25:48,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 17:25:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 17:25:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 17:25:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 17:25:48,487 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-02-04 17:25:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:48,487 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 17:25:48,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 17:25:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:25:48,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:48,488 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:48,488 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-02-04 17:25:48,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:48,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:25:48,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:48,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:48,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:48,599 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-02-04 17:25:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:48,695 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 17:25:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:48,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 17:25:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:48,698 INFO L225 Difference]: With dead ends: 31 [2018-02-04 17:25:48,698 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 17:25:48,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 17:25:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-04 17:25:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 17:25:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 17:25:48,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 17:25:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:48,702 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 17:25:48,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 17:25:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:25:48,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:48,703 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:48,703 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-02-04 17:25:48,703 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,704 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,704 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,705 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:48,798 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:48,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:48,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:48,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 17:25:48,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:48,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:48,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:48,851 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-04 17:25:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:48,904 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 17:25:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:48,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 17:25:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:48,905 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:25:48,905 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:25:48,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:25:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-04 17:25:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:25:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 17:25:48,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-04 17:25:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:48,910 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 17:25:48,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 17:25:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:25:48,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:48,911 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:48,911 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-02-04 17:25:48,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:48,911 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:48,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,912 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:48,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:48,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:49,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:49,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:49,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 17:25:49,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:49,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:49,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:49,037 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 17:25:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:49,103 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 17:25:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:49,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 17:25:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:49,106 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:25:49,107 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:25:49,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:25:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-02-04 17:25:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:25:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 17:25:49,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 17:25:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:49,116 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 17:25:49,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 17:25:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:25:49,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:49,117 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:49,117 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-02-04 17:25:49,117 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:49,117 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:49,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,118 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:49,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:49,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:49,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:49,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:49,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:49,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-02-04 17:25:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:49,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 17:25:49,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:25:49,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:25:49,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:25:49,523 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 22 states. [2018-02-04 17:25:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:49,754 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 17:25:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:25:49,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-02-04 17:25:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:49,755 INFO L225 Difference]: With dead ends: 51 [2018-02-04 17:25:49,755 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 17:25:49,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:25:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 17:25:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 17:25:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:25:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 17:25:49,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-02-04 17:25:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:49,758 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 17:25:49,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:25:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 17:25:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:49,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:49,759 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:49,759 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-02-04 17:25:49,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:49,759 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:49,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,760 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:49,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:49,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:49,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:49,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:49,810 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-02-04 17:25:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:49,834 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 17:25:49,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:49,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 17:25:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:49,836 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:25:49,836 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:25:49,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:25:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-02-04 17:25:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 17:25:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 17:25:49,840 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-02-04 17:25:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:49,841 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 17:25:49,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 17:25:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:49,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:49,842 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:49,843 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-02-04 17:25:49,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:49,843 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:49,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:49,856 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:49,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:49,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:49,857 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:49,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:49,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:49,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:49,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:49,902 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 8 states. [2018-02-04 17:25:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:49,926 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 17:25:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:49,926 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 17:25:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:49,927 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:25:49,927 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:25:49,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:25:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-02-04 17:25:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:25:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-04 17:25:49,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 21 [2018-02-04 17:25:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:49,931 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-04 17:25:49,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-04 17:25:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:49,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:49,931 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:49,932 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash 447071538, now seen corresponding path program 1 times [2018-02-04 17:25:49,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:49,932 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:49,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,933 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,933 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:49,940 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:49,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:49,940 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:49,941 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:49,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:49,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:49,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:25:49,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:49,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:49,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:49,974 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 7 states. [2018-02-04 17:25:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:49,990 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-04 17:25:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:49,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 17:25:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:49,991 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:25:49,991 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:25:49,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:25:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 17:25:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:25:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-04 17:25:49,994 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 21 [2018-02-04 17:25:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:49,994 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-04 17:25:49,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-04 17:25:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:25:49,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:49,994 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:49,994 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash 964772623, now seen corresponding path program 2 times [2018-02-04 17:25:49,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:49,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:49,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:49,995 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:49,995 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:50,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:50,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:50,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:50,232 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:25:50,253 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:25:50,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:25:50,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:50,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:50,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:50,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:50,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-02-04 17:25:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:50,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:50,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-02-04 17:25:50,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:25:50,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:25:50,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:25:50,551 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 27 states. [2018-02-04 17:25:51,224 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 52 DAG size of output 40 [2018-02-04 17:25:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:51,349 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 17:25:51,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:25:51,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 24 [2018-02-04 17:25:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:51,350 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:25:51,350 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:25:51,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:25:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:25:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-02-04 17:25:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:25:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 17:25:51,353 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2018-02-04 17:25:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:51,353 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 17:25:51,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:25:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 17:25:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:25:51,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:51,354 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:51,354 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2014614714, now seen corresponding path program 1 times [2018-02-04 17:25:51,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:51,354 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:51,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:51,355 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:25:51,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:51,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:51,360 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:51,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:51,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:51,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:51,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:51,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:51,393 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 12 treesize of output 5 [2018-02-04 17:25:51,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:51,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:51,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:25:51,411 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc5.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc5.base|)))) is different from true [2018-02-04 17:25:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:25:51,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:51,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:51,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:51,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:51,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:25:51,415 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2018-02-04 17:25:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:51,444 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-04 17:25:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:51,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 17:25:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:51,444 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:25:51,444 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:25:51,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:25:51,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:25:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:25:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:25:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:25:51,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 17:25:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:51,445 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:25:51,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:25:51,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:25:51,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:25:51 BoogieIcfgContainer [2018-02-04 17:25:51,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:25:51,449 INFO L168 Benchmark]: Toolchain (without parser) took 3857.02 ms. Allocated memory was 403.2 MB in the beginning and 682.6 MB in the end (delta: 279.4 MB). Free memory was 359.9 MB in the beginning and 622.4 MB in the end (delta: -262.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:51,449 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:25:51,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.11 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:51,450 INFO L168 Benchmark]: Boogie Preprocessor took 22.11 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:51,450 INFO L168 Benchmark]: RCFGBuilder took 157.50 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 332.1 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:51,450 INFO L168 Benchmark]: TraceAbstraction took 3525.71 ms. Allocated memory was 403.2 MB in the beginning and 682.6 MB in the end (delta: 279.4 MB). Free memory was 332.1 MB in the beginning and 622.4 MB in the end (delta: -290.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:25:51,451 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.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.11 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.11 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 157.50 ms. Allocated memory is still 403.2 MB. Free memory was 346.6 MB in the beginning and 332.1 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3525.71 ms. Allocated memory was 403.2 MB in the beginning and 682.6 MB in the end (delta: 279.4 MB). Free memory was 332.1 MB in the beginning and 622.4 MB in the end (delta: -290.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 3.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 279 SDslu, 1251 SDs, 0 SdLazy, 863 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 86 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 292 ConstructedInterpolants, 13 QuantifiedInterpolants, 35189 SizeOfPredicates, 33 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 6/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-25-51-455.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-25-51-455.csv Received shutdown request...