./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db442b2b2190096040237cf0291b9e040559918a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 04:31:24,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 04:31:24,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 04:31:24,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 04:31:24,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 04:31:24,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 04:31:24,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 04:31:24,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 04:31:24,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 04:31:24,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 04:31:24,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 04:31:24,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 04:31:24,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 04:31:24,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 04:31:24,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 04:31:24,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 04:31:24,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 04:31:24,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 04:31:24,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 04:31:24,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 04:31:24,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 04:31:24,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 04:31:24,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 04:31:24,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 04:31:24,697 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 04:31:24,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 04:31:24,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 04:31:24,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 04:31:24,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 04:31:24,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 04:31:24,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 04:31:24,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 04:31:24,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 04:31:24,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 04:31:24,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 04:31:24,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 04:31:24,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 04:31:24,733 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 04:31:24,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 04:31:24,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 04:31:24,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 04:31:24,739 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 04:31:24,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 04:31:24,739 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 04:31:24,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 04:31:24,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 04:31:24,741 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 04:31:24,742 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 04:31:24,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 04:31:24,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 04:31:24,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 04:31:24,742 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 04:31:24,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 04:31:24,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:31:24,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 04:31:24,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 04:31:24,744 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 04:31:24,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 04:31:24,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 04:31:24,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 04:31:24,745 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db442b2b2190096040237cf0291b9e040559918a [2019-01-13 04:31:24,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 04:31:24,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 04:31:24,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 04:31:24,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 04:31:24,826 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 04:31:24,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i [2019-01-13 04:31:24,901 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ac95ac8/c158e278837f4649bbdcfc8c86aabdd1/FLAG7102b1042 [2019-01-13 04:31:25,418 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 04:31:25,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i [2019-01-13 04:31:25,438 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ac95ac8/c158e278837f4649bbdcfc8c86aabdd1/FLAG7102b1042 [2019-01-13 04:31:25,705 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ac95ac8/c158e278837f4649bbdcfc8c86aabdd1 [2019-01-13 04:31:25,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 04:31:25,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 04:31:25,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 04:31:25,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 04:31:25,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 04:31:25,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:31:25" (1/1) ... [2019-01-13 04:31:25,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e0924a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:25, skipping insertion in model container [2019-01-13 04:31:25,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:31:25" (1/1) ... [2019-01-13 04:31:25,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 04:31:25,804 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 04:31:26,288 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:31:26,304 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 04:31:26,517 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:31:26,628 INFO L195 MainTranslator]: Completed translation [2019-01-13 04:31:26,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26 WrapperNode [2019-01-13 04:31:26,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 04:31:26,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 04:31:26,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 04:31:26,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 04:31:26,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 04:31:26,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 04:31:26,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 04:31:26,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 04:31:26,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... [2019-01-13 04:31:26,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 04:31:26,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 04:31:26,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 04:31:26,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 04:31:26,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-13 04:31:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 04:31:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 04:31:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 04:31:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 04:31:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 04:31:26,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 04:31:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 04:31:26,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 04:31:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 04:31:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 04:31:26,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 04:31:26,895 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 04:31:28,237 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 04:31:28,238 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 04:31:28,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:28 BoogieIcfgContainer [2019-01-13 04:31:28,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 04:31:28,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 04:31:28,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 04:31:28,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 04:31:28,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 04:31:25" (1/3) ... [2019-01-13 04:31:28,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:31:28, skipping insertion in model container [2019-01-13 04:31:28,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:31:26" (2/3) ... [2019-01-13 04:31:28,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:31:28, skipping insertion in model container [2019-01-13 04:31:28,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:28" (3/3) ... [2019-01-13 04:31:28,251 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc_false-unreach-call.i [2019-01-13 04:31:28,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,294 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,294 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,294 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,296 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,296 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,299 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,300 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,301 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,308 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,309 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,309 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:31:28,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 04:31:28,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 04:31:28,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 04:31:28,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 04:31:28,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 04:31:28,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 04:31:28,383 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 04:31:28,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 04:31:28,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 04:31:28,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 04:31:28,384 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 04:31:28,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 04:31:28,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 04:31:28,396 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 04:31:30,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2019-01-13 04:31:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2019-01-13 04:31:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 04:31:30,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:30,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:30,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2019-01-13 04:31:30,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:30,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:30,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:30,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:30,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:30,958 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2019-01-13 04:31:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:32,488 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2019-01-13 04:31:32,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:32,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-13 04:31:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:32,937 INFO L225 Difference]: With dead ends: 45395 [2019-01-13 04:31:32,938 INFO L226 Difference]: Without dead ends: 40635 [2019-01-13 04:31:32,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-01-13 04:31:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2019-01-13 04:31:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2019-01-13 04:31:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2019-01-13 04:31:34,880 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2019-01-13 04:31:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:34,881 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2019-01-13 04:31:34,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2019-01-13 04:31:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 04:31:34,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:34,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:34,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2019-01-13 04:31:34,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:34,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:35,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:35,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:35,248 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2019-01-13 04:31:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:39,573 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2019-01-13 04:31:39,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:39,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 04:31:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:39,923 INFO L225 Difference]: With dead ends: 64837 [2019-01-13 04:31:39,924 INFO L226 Difference]: Without dead ends: 64677 [2019-01-13 04:31:39,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2019-01-13 04:31:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2019-01-13 04:31:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2019-01-13 04:31:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2019-01-13 04:31:42,034 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2019-01-13 04:31:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:42,036 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2019-01-13 04:31:42,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2019-01-13 04:31:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 04:31:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:42,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:42,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2019-01-13 04:31:42,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:42,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:42,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:42,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:42,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:42,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:42,266 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2019-01-13 04:31:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:42,582 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2019-01-13 04:31:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:42,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 04:31:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:42,624 INFO L225 Difference]: With dead ends: 12371 [2019-01-13 04:31:42,625 INFO L226 Difference]: Without dead ends: 11850 [2019-01-13 04:31:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2019-01-13 04:31:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2019-01-13 04:31:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2019-01-13 04:31:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2019-01-13 04:31:42,942 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2019-01-13 04:31:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:42,942 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2019-01-13 04:31:42,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2019-01-13 04:31:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:31:42,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:42,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:42,949 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2019-01-13 04:31:42,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:42,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:43,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:43,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:43,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:43,220 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2019-01-13 04:31:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:44,516 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2019-01-13 04:31:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:44,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 04:31:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:44,565 INFO L225 Difference]: With dead ends: 17026 [2019-01-13 04:31:44,566 INFO L226 Difference]: Without dead ends: 17026 [2019-01-13 04:31:44,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2019-01-13 04:31:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2019-01-13 04:31:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2019-01-13 04:31:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2019-01-13 04:31:45,553 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2019-01-13 04:31:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:45,553 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2019-01-13 04:31:45,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2019-01-13 04:31:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 04:31:45,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:45,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:45,568 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:45,569 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2019-01-13 04:31:45,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:45,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:45,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:46,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:46,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:46,027 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 6 states. [2019-01-13 04:31:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:47,216 INFO L93 Difference]: Finished difference Result 18606 states and 60861 transitions. [2019-01-13 04:31:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:31:47,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 04:31:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:47,269 INFO L225 Difference]: With dead ends: 18606 [2019-01-13 04:31:47,269 INFO L226 Difference]: Without dead ends: 18574 [2019-01-13 04:31:47,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:31:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18574 states. [2019-01-13 04:31:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18574 to 14418. [2019-01-13 04:31:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2019-01-13 04:31:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 47580 transitions. [2019-01-13 04:31:47,669 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 47580 transitions. Word has length 57 [2019-01-13 04:31:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:47,670 INFO L480 AbstractCegarLoop]: Abstraction has 14418 states and 47580 transitions. [2019-01-13 04:31:47,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 47580 transitions. [2019-01-13 04:31:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:31:47,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:47,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:47,704 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1122563706, now seen corresponding path program 1 times [2019-01-13 04:31:47,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:47,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:47,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:47,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:47,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:48,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:48,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:48,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:48,002 INFO L87 Difference]: Start difference. First operand 14418 states and 47580 transitions. Second operand 4 states. [2019-01-13 04:31:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:48,986 INFO L93 Difference]: Finished difference Result 23166 states and 75033 transitions. [2019-01-13 04:31:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:48,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-01-13 04:31:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:49,030 INFO L225 Difference]: With dead ends: 23166 [2019-01-13 04:31:49,030 INFO L226 Difference]: Without dead ends: 22990 [2019-01-13 04:31:49,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22990 states. [2019-01-13 04:31:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22990 to 19518. [2019-01-13 04:31:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2019-01-13 04:31:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 64005 transitions. [2019-01-13 04:31:49,531 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 64005 transitions. Word has length 71 [2019-01-13 04:31:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:49,532 INFO L480 AbstractCegarLoop]: Abstraction has 19518 states and 64005 transitions. [2019-01-13 04:31:49,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 64005 transitions. [2019-01-13 04:31:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-13 04:31:49,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:49,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:49,574 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 230745991, now seen corresponding path program 1 times [2019-01-13 04:31:49,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:49,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:49,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:49,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:49,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:49,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:49,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:49,821 INFO L87 Difference]: Start difference. First operand 19518 states and 64005 transitions. Second operand 5 states. [2019-01-13 04:31:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:49,983 INFO L93 Difference]: Finished difference Result 3426 states and 9184 transitions. [2019-01-13 04:31:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:31:49,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-01-13 04:31:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:49,987 INFO L225 Difference]: With dead ends: 3426 [2019-01-13 04:31:49,988 INFO L226 Difference]: Without dead ends: 3014 [2019-01-13 04:31:49,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-01-13 04:31:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2911. [2019-01-13 04:31:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2019-01-13 04:31:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 7787 transitions. [2019-01-13 04:31:50,480 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 7787 transitions. Word has length 71 [2019-01-13 04:31:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:50,480 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 7787 transitions. [2019-01-13 04:31:50,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 7787 transitions. [2019-01-13 04:31:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:50,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:50,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:50,494 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1246078848, now seen corresponding path program 1 times [2019-01-13 04:31:50,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:50,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:50,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:50,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:50,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:50,677 INFO L87 Difference]: Start difference. First operand 2911 states and 7787 transitions. Second operand 4 states. [2019-01-13 04:31:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:51,176 INFO L93 Difference]: Finished difference Result 3948 states and 10239 transitions. [2019-01-13 04:31:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:51,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:31:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:51,182 INFO L225 Difference]: With dead ends: 3948 [2019-01-13 04:31:51,182 INFO L226 Difference]: Without dead ends: 3948 [2019-01-13 04:31:51,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2019-01-13 04:31:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3394. [2019-01-13 04:31:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2019-01-13 04:31:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 8914 transitions. [2019-01-13 04:31:51,229 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 8914 transitions. Word has length 90 [2019-01-13 04:31:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 3394 states and 8914 transitions. [2019-01-13 04:31:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 8914 transitions. [2019-01-13 04:31:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:51,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:51,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:51,238 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1865541151, now seen corresponding path program 1 times [2019-01-13 04:31:51,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:51,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:51,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:51,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:51,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:51,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:51,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:51,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:51,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:51,613 INFO L87 Difference]: Start difference. First operand 3394 states and 8914 transitions. Second operand 6 states. [2019-01-13 04:31:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:51,837 INFO L93 Difference]: Finished difference Result 3602 states and 9284 transitions. [2019-01-13 04:31:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:31:51,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-01-13 04:31:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:51,842 INFO L225 Difference]: With dead ends: 3602 [2019-01-13 04:31:51,843 INFO L226 Difference]: Without dead ends: 3602 [2019-01-13 04:31:51,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:31:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2019-01-13 04:31:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3372. [2019-01-13 04:31:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3372 states. [2019-01-13 04:31:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 8797 transitions. [2019-01-13 04:31:51,885 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 8797 transitions. Word has length 90 [2019-01-13 04:31:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:51,886 INFO L480 AbstractCegarLoop]: Abstraction has 3372 states and 8797 transitions. [2019-01-13 04:31:51,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 8797 transitions. [2019-01-13 04:31:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:51,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:51,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:51,895 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 840847230, now seen corresponding path program 1 times [2019-01-13 04:31:51,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:51,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:51,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:52,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:52,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:52,070 INFO L87 Difference]: Start difference. First operand 3372 states and 8797 transitions. Second operand 5 states. [2019-01-13 04:31:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:52,352 INFO L93 Difference]: Finished difference Result 4392 states and 11188 transitions. [2019-01-13 04:31:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:52,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 04:31:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:52,359 INFO L225 Difference]: With dead ends: 4392 [2019-01-13 04:31:52,359 INFO L226 Difference]: Without dead ends: 4392 [2019-01-13 04:31:52,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-01-13 04:31:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 3594. [2019-01-13 04:31:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2019-01-13 04:31:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 9293 transitions. [2019-01-13 04:31:52,407 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 9293 transitions. Word has length 90 [2019-01-13 04:31:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:52,408 INFO L480 AbstractCegarLoop]: Abstraction has 3594 states and 9293 transitions. [2019-01-13 04:31:52,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:31:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 9293 transitions. [2019-01-13 04:31:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:52,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:52,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:52,416 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 617052887, now seen corresponding path program 2 times [2019-01-13 04:31:52,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:52,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:52,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:31:52,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:31:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:31:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:52,631 INFO L87 Difference]: Start difference. First operand 3594 states and 9293 transitions. Second operand 4 states. [2019-01-13 04:31:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:53,090 INFO L93 Difference]: Finished difference Result 5130 states and 13284 transitions. [2019-01-13 04:31:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 04:31:53,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-13 04:31:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:53,098 INFO L225 Difference]: With dead ends: 5130 [2019-01-13 04:31:53,098 INFO L226 Difference]: Without dead ends: 5112 [2019-01-13 04:31:53,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:31:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2019-01-13 04:31:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 3636. [2019-01-13 04:31:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2019-01-13 04:31:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 9376 transitions. [2019-01-13 04:31:53,154 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 9376 transitions. Word has length 90 [2019-01-13 04:31:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:53,155 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 9376 transitions. [2019-01-13 04:31:53,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:31:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 9376 transitions. [2019-01-13 04:31:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 04:31:53,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:53,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:53,163 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash 100591209, now seen corresponding path program 1 times [2019-01-13 04:31:53,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:31:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:53,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:53,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:31:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:31:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:31:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:31:53,267 INFO L87 Difference]: Start difference. First operand 3636 states and 9376 transitions. Second operand 3 states. [2019-01-13 04:31:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:53,458 INFO L93 Difference]: Finished difference Result 3688 states and 9475 transitions. [2019-01-13 04:31:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:31:53,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-01-13 04:31:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:53,465 INFO L225 Difference]: With dead ends: 3688 [2019-01-13 04:31:53,465 INFO L226 Difference]: Without dead ends: 3688 [2019-01-13 04:31:53,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:31:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2019-01-13 04:31:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3658. [2019-01-13 04:31:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2019-01-13 04:31:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 9410 transitions. [2019-01-13 04:31:53,506 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 9410 transitions. Word has length 90 [2019-01-13 04:31:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:53,506 INFO L480 AbstractCegarLoop]: Abstraction has 3658 states and 9410 transitions. [2019-01-13 04:31:53,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:31:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 9410 transitions. [2019-01-13 04:31:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:53,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:53,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:53,514 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1619414373, now seen corresponding path program 1 times [2019-01-13 04:31:53,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:53,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:53,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:53,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:53,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 04:31:53,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 04:31:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 04:31:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:31:53,697 INFO L87 Difference]: Start difference. First operand 3658 states and 9410 transitions. Second operand 9 states. [2019-01-13 04:31:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:55,147 INFO L93 Difference]: Finished difference Result 7294 states and 18183 transitions. [2019-01-13 04:31:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-13 04:31:55,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-01-13 04:31:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:55,158 INFO L225 Difference]: With dead ends: 7294 [2019-01-13 04:31:55,158 INFO L226 Difference]: Without dead ends: 7262 [2019-01-13 04:31:55,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:31:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2019-01-13 04:31:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 4934. [2019-01-13 04:31:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2019-01-13 04:31:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 12543 transitions. [2019-01-13 04:31:55,223 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 12543 transitions. Word has length 92 [2019-01-13 04:31:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:55,224 INFO L480 AbstractCegarLoop]: Abstraction has 4934 states and 12543 transitions. [2019-01-13 04:31:55,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 04:31:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 12543 transitions. [2019-01-13 04:31:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:55,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:55,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:55,231 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1430788442, now seen corresponding path program 1 times [2019-01-13 04:31:55,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:55,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:55,477 INFO L87 Difference]: Start difference. First operand 4934 states and 12543 transitions. Second operand 7 states. [2019-01-13 04:31:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:56,411 INFO L93 Difference]: Finished difference Result 8015 states and 20164 transitions. [2019-01-13 04:31:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:31:56,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:31:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:56,423 INFO L225 Difference]: With dead ends: 8015 [2019-01-13 04:31:56,423 INFO L226 Difference]: Without dead ends: 7764 [2019-01-13 04:31:56,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2019-01-13 04:31:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 5020. [2019-01-13 04:31:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-01-13 04:31:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 12633 transitions. [2019-01-13 04:31:56,493 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 12633 transitions. Word has length 92 [2019-01-13 04:31:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:56,494 INFO L480 AbstractCegarLoop]: Abstraction has 5020 states and 12633 transitions. [2019-01-13 04:31:56,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 12633 transitions. [2019-01-13 04:31:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:56,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:56,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:56,502 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1693857927, now seen corresponding path program 1 times [2019-01-13 04:31:56,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:56,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:56,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:56,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:31:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:31:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:31:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:56,752 INFO L87 Difference]: Start difference. First operand 5020 states and 12633 transitions. Second operand 6 states. [2019-01-13 04:31:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:56,971 INFO L93 Difference]: Finished difference Result 3809 states and 9705 transitions. [2019-01-13 04:31:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:31:56,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:31:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:56,977 INFO L225 Difference]: With dead ends: 3809 [2019-01-13 04:31:56,977 INFO L226 Difference]: Without dead ends: 3809 [2019-01-13 04:31:56,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2019-01-13 04:31:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3597. [2019-01-13 04:31:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-13 04:31:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9242 transitions. [2019-01-13 04:31:57,021 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9242 transitions. Word has length 92 [2019-01-13 04:31:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9242 transitions. [2019-01-13 04:31:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:31:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9242 transitions. [2019-01-13 04:31:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:57,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:57,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:57,027 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1594459699, now seen corresponding path program 1 times [2019-01-13 04:31:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:57,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:57,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:31:57,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:31:57,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:31:57,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:31:57,354 INFO L87 Difference]: Start difference. First operand 3597 states and 9242 transitions. Second operand 8 states. [2019-01-13 04:31:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:58,050 INFO L93 Difference]: Finished difference Result 4654 states and 11807 transitions. [2019-01-13 04:31:58,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 04:31:58,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-01-13 04:31:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:58,059 INFO L225 Difference]: With dead ends: 4654 [2019-01-13 04:31:58,060 INFO L226 Difference]: Without dead ends: 4622 [2019-01-13 04:31:58,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-13 04:31:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2019-01-13 04:31:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3732. [2019-01-13 04:31:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-13 04:31:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9517 transitions. [2019-01-13 04:31:58,150 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9517 transitions. Word has length 92 [2019-01-13 04:31:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:58,151 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9517 transitions. [2019-01-13 04:31:58,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:31:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9517 transitions. [2019-01-13 04:31:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:58,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:58,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:58,168 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1738893580, now seen corresponding path program 1 times [2019-01-13 04:31:58,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:58,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:31:58,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:31:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:31:58,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:31:58,428 INFO L87 Difference]: Start difference. First operand 3732 states and 9517 transitions. Second operand 7 states. [2019-01-13 04:31:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:58,811 INFO L93 Difference]: Finished difference Result 4887 states and 12337 transitions. [2019-01-13 04:31:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:31:58,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 04:31:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:58,821 INFO L225 Difference]: With dead ends: 4887 [2019-01-13 04:31:58,821 INFO L226 Difference]: Without dead ends: 4887 [2019-01-13 04:31:58,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:31:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2019-01-13 04:31:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4052. [2019-01-13 04:31:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2019-01-13 04:31:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 10367 transitions. [2019-01-13 04:31:58,883 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 10367 transitions. Word has length 92 [2019-01-13 04:31:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:31:58,883 INFO L480 AbstractCegarLoop]: Abstraction has 4052 states and 10367 transitions. [2019-01-13 04:31:58,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:31:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 10367 transitions. [2019-01-13 04:31:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:31:58,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:31:58,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:31:58,890 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:31:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:31:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash -494129099, now seen corresponding path program 1 times [2019-01-13 04:31:58,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:31:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:31:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:31:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:31:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:31:59,441 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 04:31:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:31:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:31:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:31:59,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:31:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:31:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:31:59,537 INFO L87 Difference]: Start difference. First operand 4052 states and 10367 transitions. Second operand 5 states. [2019-01-13 04:31:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:31:59,829 INFO L93 Difference]: Finished difference Result 5996 states and 15588 transitions. [2019-01-13 04:31:59,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:31:59,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 04:31:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:31:59,838 INFO L225 Difference]: With dead ends: 5996 [2019-01-13 04:31:59,839 INFO L226 Difference]: Without dead ends: 5996 [2019-01-13 04:31:59,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:31:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2019-01-13 04:31:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3732. [2019-01-13 04:31:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2019-01-13 04:32:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9430 transitions. [2019-01-13 04:32:00,187 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9430 transitions. Word has length 92 [2019-01-13 04:32:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:00,187 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9430 transitions. [2019-01-13 04:32:00,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9430 transitions. [2019-01-13 04:32:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:32:00,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:00,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:00,192 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash -13412683, now seen corresponding path program 1 times [2019-01-13 04:32:00,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:00,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:00,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:00,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:00,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:32:00,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:32:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:32:00,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:32:00,569 INFO L87 Difference]: Start difference. First operand 3732 states and 9430 transitions. Second operand 6 states. [2019-01-13 04:32:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:00,775 INFO L93 Difference]: Finished difference Result 3300 states and 8142 transitions. [2019-01-13 04:32:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:32:00,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 04:32:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:00,781 INFO L225 Difference]: With dead ends: 3300 [2019-01-13 04:32:00,781 INFO L226 Difference]: Without dead ends: 3300 [2019-01-13 04:32:00,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:32:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2019-01-13 04:32:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2619. [2019-01-13 04:32:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-01-13 04:32:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6636 transitions. [2019-01-13 04:32:00,812 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6636 transitions. Word has length 92 [2019-01-13 04:32:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:00,813 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6636 transitions. [2019-01-13 04:32:00,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:32:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6636 transitions. [2019-01-13 04:32:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:00,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:00,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:00,817 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2019-01-13 04:32:00,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:00,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:00,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:01,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:32:01,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:32:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:32:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:32:01,146 INFO L87 Difference]: Start difference. First operand 2619 states and 6636 transitions. Second operand 5 states. [2019-01-13 04:32:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:01,450 INFO L93 Difference]: Finished difference Result 2971 states and 7500 transitions. [2019-01-13 04:32:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:32:01,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 04:32:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:01,456 INFO L225 Difference]: With dead ends: 2971 [2019-01-13 04:32:01,456 INFO L226 Difference]: Without dead ends: 2939 [2019-01-13 04:32:01,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:32:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-01-13 04:32:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2667. [2019-01-13 04:32:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-01-13 04:32:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6740 transitions. [2019-01-13 04:32:01,491 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6740 transitions. Word has length 94 [2019-01-13 04:32:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:01,491 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 6740 transitions. [2019-01-13 04:32:01,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:32:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6740 transitions. [2019-01-13 04:32:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:01,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:01,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:01,495 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2019-01-13 04:32:01,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:01,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:32:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:32:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:32:01,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 04:32:01,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 04:32:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 04:32:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:32:01,777 INFO L87 Difference]: Start difference. First operand 2667 states and 6740 transitions. Second operand 12 states. [2019-01-13 04:32:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:32:03,262 INFO L93 Difference]: Finished difference Result 4454 states and 11424 transitions. [2019-01-13 04:32:03,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 04:32:03,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-13 04:32:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:32:03,268 INFO L225 Difference]: With dead ends: 4454 [2019-01-13 04:32:03,268 INFO L226 Difference]: Without dead ends: 3478 [2019-01-13 04:32:03,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 04:32:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2019-01-13 04:32:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3198. [2019-01-13 04:32:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-01-13 04:32:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7987 transitions. [2019-01-13 04:32:03,304 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7987 transitions. Word has length 94 [2019-01-13 04:32:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:32:03,305 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7987 transitions. [2019-01-13 04:32:03,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 04:32:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7987 transitions. [2019-01-13 04:32:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:32:03,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:32:03,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:32:03,310 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:32:03,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:32:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2019-01-13 04:32:03,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:32:03,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:32:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:32:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:32:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:32:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:32:03,419 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:32:03,630 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:32:03,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:32:03 BasicIcfg [2019-01-13 04:32:03,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:32:03,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:32:03,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:32:03,633 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:32:03,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:31:28" (3/4) ... [2019-01-13 04:32:03,639 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:32:03,856 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:32:03,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:32:03,859 INFO L168 Benchmark]: Toolchain (without parser) took 38148.15 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 937.9 MB in the beginning and 1.5 GB in the end (delta: -585.1 MB). Peak memory consumption was 780.1 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,859 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:32:03,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 915.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,861 INFO L168 Benchmark]: Boogie Preprocessor took 73.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:32:03,865 INFO L168 Benchmark]: RCFGBuilder took 1434.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,866 INFO L168 Benchmark]: TraceAbstraction took 35391.69 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -474.4 MB). Peak memory consumption was 739.3 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,866 INFO L168 Benchmark]: Witness Printer took 224.38 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-13 04:32:03,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 915.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -187.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1434.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35391.69 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -474.4 MB). Peak memory consumption was 739.3 MB. Max. memory is 11.5 GB. * Witness Printer took 224.38 ms. Allocated memory is still 2.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L776] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L778] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 35.2s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4848 SDtfs, 4661 SDslu, 11312 SDs, 0 SdLazy, 4578 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, 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: 7.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 69959 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1751 NumberOfCodeBlocks, 1751 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1636 ConstructedInterpolants, 0 QuantifiedInterpolants, 361840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...