./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_rmo.opt_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/mix041_rmo.opt_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 f7f00b8a2e26669f3416c65156e30bcc7eb97f9e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:08:04,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 02:08:04,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 02:08:04,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 02:08:04,713 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 02:08:04,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 02:08:04,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 02:08:04,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 02:08:04,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 02:08:04,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 02:08:04,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 02:08:04,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 02:08:04,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 02:08:04,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 02:08:04,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 02:08:04,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 02:08:04,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 02:08:04,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 02:08:04,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 02:08:04,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 02:08:04,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 02:08:04,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 02:08:04,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 02:08:04,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 02:08:04,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 02:08:04,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 02:08:04,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 02:08:04,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 02:08:04,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 02:08:04,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 02:08:04,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 02:08:04,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 02:08:04,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 02:08:04,779 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 02:08:04,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 02:08:04,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 02:08:04,783 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 02:08:04,807 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 02:08:04,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 02:08:04,808 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 02:08:04,808 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 02:08:04,809 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 02:08:04,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 02:08:04,812 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 02:08:04,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 02:08:04,814 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 02:08:04,815 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 02:08:04,815 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 02:08:04,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 02:08:04,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 02:08:04,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 02:08:04,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 02:08:04,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 02:08:04,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 02:08:04,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 02:08:04,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 02:08:04,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 02:08:04,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 02:08:04,820 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 02:08:04,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 02:08:04,820 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 -> f7f00b8a2e26669f3416c65156e30bcc7eb97f9e [2019-01-13 02:08:04,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 02:08:04,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 02:08:04,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 02:08:04,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 02:08:04,904 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 02:08:04,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2019-01-13 02:08:04,982 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ddcee32/8ecad4071c9d494e9f4723b0bdd88715/FLAGe3a196916 [2019-01-13 02:08:05,476 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 02:08:05,477 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_rmo.opt_false-unreach-call.i [2019-01-13 02:08:05,497 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ddcee32/8ecad4071c9d494e9f4723b0bdd88715/FLAGe3a196916 [2019-01-13 02:08:05,742 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ddcee32/8ecad4071c9d494e9f4723b0bdd88715 [2019-01-13 02:08:05,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 02:08:05,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 02:08:05,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 02:08:05,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 02:08:05,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 02:08:05,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:08:05" (1/1) ... [2019-01-13 02:08:05,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5850dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:05, skipping insertion in model container [2019-01-13 02:08:05,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 02:08:05" (1/1) ... [2019-01-13 02:08:05,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 02:08:05,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 02:08:06,358 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:08:06,381 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 02:08:06,582 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 02:08:06,680 INFO L195 MainTranslator]: Completed translation [2019-01-13 02:08:06,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06 WrapperNode [2019-01-13 02:08:06,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 02:08:06,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 02:08:06,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 02:08:06,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 02:08:06,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 02:08:06,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 02:08:06,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 02:08:06,770 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 02:08:06,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (1/1) ... [2019-01-13 02:08:06,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 02:08:06,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 02:08:06,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 02:08:06,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 02:08:06,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (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 02:08:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 02:08:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 02:08:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 02:08:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 02:08:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 02:08:06,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 02:08:06,887 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 02:08:06,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 02:08:06,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 02:08:06,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 02:08:06,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 02:08:06,890 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 02:08:08,022 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 02:08:08,022 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 02:08:08,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:08:08 BoogieIcfgContainer [2019-01-13 02:08:08,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 02:08:08,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 02:08:08,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 02:08:08,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 02:08:08,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 02:08:05" (1/3) ... [2019-01-13 02:08:08,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85d3d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:08:08, skipping insertion in model container [2019-01-13 02:08:08,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 02:08:06" (2/3) ... [2019-01-13 02:08:08,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85d3d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 02:08:08, skipping insertion in model container [2019-01-13 02:08:08,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:08:08" (3/3) ... [2019-01-13 02:08:08,034 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt_false-unreach-call.i [2019-01-13 02:08:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,073 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,073 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,077 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,078 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,079 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,080 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,082 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,082 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,082 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,082 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,083 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 02:08:08,112 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 02:08:08,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 02:08:08,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 02:08:08,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 02:08:08,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 02:08:08,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 02:08:08,161 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 02:08:08,161 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 02:08:08,161 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 02:08:08,161 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 02:08:08,162 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 02:08:08,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 02:08:08,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 02:08:08,174 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-13 02:08:09,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2019-01-13 02:08:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2019-01-13 02:08:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 02:08:09,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:09,948 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] [2019-01-13 02:08:09,950 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2019-01-13 02:08:09,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:09,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:10,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:10,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:10,291 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 02:08:10,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:10,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:08:10,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:08:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:08:10,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:10,318 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2019-01-13 02:08:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:11,627 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2019-01-13 02:08:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:08:11,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-13 02:08:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:11,996 INFO L225 Difference]: With dead ends: 45389 [2019-01-13 02:08:11,996 INFO L226 Difference]: Without dead ends: 40629 [2019-01-13 02:08:12,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2019-01-13 02:08:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2019-01-13 02:08:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2019-01-13 02:08:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2019-01-13 02:08:13,839 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2019-01-13 02:08:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:13,842 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2019-01-13 02:08:13,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:08:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2019-01-13 02:08:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:08:13,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:13,849 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] [2019-01-13 02:08:13,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2113194510, now seen corresponding path program 1 times [2019-01-13 02:08:13,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:13,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:13,970 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 02:08:13,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:13,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:08:13,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:08:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:08:13,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:08:13,974 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2019-01-13 02:08:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:14,735 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2019-01-13 02:08:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:08:14,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-13 02:08:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:14,901 INFO L225 Difference]: With dead ends: 23663 [2019-01-13 02:08:14,901 INFO L226 Difference]: Without dead ends: 23663 [2019-01-13 02:08:14,902 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 02:08:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2019-01-13 02:08:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2019-01-13 02:08:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2019-01-13 02:08:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2019-01-13 02:08:16,152 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2019-01-13 02:08:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:16,153 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2019-01-13 02:08:16,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:08:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2019-01-13 02:08:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 02:08:16,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:16,161 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] [2019-01-13 02:08:16,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 384821427, now seen corresponding path program 1 times [2019-01-13 02:08:16,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:16,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:16,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:16,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:16,343 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 02:08:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:16,346 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2019-01-13 02:08:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:18,779 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2019-01-13 02:08:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:08:18,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-13 02:08:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:19,192 INFO L225 Difference]: With dead ends: 64831 [2019-01-13 02:08:19,192 INFO L226 Difference]: Without dead ends: 64671 [2019-01-13 02:08:19,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:08:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2019-01-13 02:08:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2019-01-13 02:08:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-01-13 02:08:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2019-01-13 02:08:20,620 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2019-01-13 02:08:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:20,624 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2019-01-13 02:08:20,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2019-01-13 02:08:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 02:08:20,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:20,628 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] [2019-01-13 02:08:20,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2019-01-13 02:08:20,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:20,752 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 02:08:20,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:20,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:20,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:20,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:20,754 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 5 states. [2019-01-13 02:08:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:22,210 INFO L93 Difference]: Finished difference Result 66627 states and 246202 transitions. [2019-01-13 02:08:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 02:08:22,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 02:08:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:22,431 INFO L225 Difference]: With dead ends: 66627 [2019-01-13 02:08:22,431 INFO L226 Difference]: Without dead ends: 66459 [2019-01-13 02:08:22,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:08:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2019-01-13 02:08:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2019-01-13 02:08:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2019-01-13 02:08:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143659 transitions. [2019-01-13 02:08:24,550 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143659 transitions. Word has length 46 [2019-01-13 02:08:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:24,551 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143659 transitions. [2019-01-13 02:08:24,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143659 transitions. [2019-01-13 02:08:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 02:08:24,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:24,566 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] [2019-01-13 02:08:24,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash -845281571, now seen corresponding path program 1 times [2019-01-13 02:08:24,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:24,663 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 02:08:24,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:24,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:08:24,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:08:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:08:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:24,666 INFO L87 Difference]: Start difference. First operand 38835 states and 143659 transitions. Second operand 4 states. [2019-01-13 02:08:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:24,770 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2019-01-13 02:08:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:08:24,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 02:08:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:24,802 INFO L225 Difference]: With dead ends: 14217 [2019-01-13 02:08:24,803 INFO L226 Difference]: Without dead ends: 13696 [2019-01-13 02:08:24,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2019-01-13 02:08:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2019-01-13 02:08:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2019-01-13 02:08:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2019-01-13 02:08:25,107 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2019-01-13 02:08:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2019-01-13 02:08:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:08:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2019-01-13 02:08:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 02:08:25,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:25,114 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] [2019-01-13 02:08:25,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1116900446, now seen corresponding path program 1 times [2019-01-13 02:08:25,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:25,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:25,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:25,372 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 02:08:25,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:25,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:08:25,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:08:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:08:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:25,374 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2019-01-13 02:08:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:25,800 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2019-01-13 02:08:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:08:25,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-13 02:08:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:25,836 INFO L225 Difference]: With dead ends: 19084 [2019-01-13 02:08:25,836 INFO L226 Difference]: Without dead ends: 19084 [2019-01-13 02:08:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 02:08:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2019-01-13 02:08:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2019-01-13 02:08:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2019-01-13 02:08:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2019-01-13 02:08:26,118 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2019-01-13 02:08:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:26,118 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2019-01-13 02:08:26,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:08:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2019-01-13 02:08:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 02:08:26,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:26,125 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] [2019-01-13 02:08:26,125 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1435256515, now seen corresponding path program 1 times [2019-01-13 02:08:26,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:26,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:26,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:26,240 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 02:08:26,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:26,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:26,242 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 6 states. [2019-01-13 02:08:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:27,035 INFO L93 Difference]: Finished difference Result 19832 states and 64769 transitions. [2019-01-13 02:08:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 02:08:27,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-13 02:08:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:27,072 INFO L225 Difference]: With dead ends: 19832 [2019-01-13 02:08:27,072 INFO L226 Difference]: Without dead ends: 19800 [2019-01-13 02:08:27,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 02:08:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19800 states. [2019-01-13 02:08:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19800 to 14412. [2019-01-13 02:08:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14412 states. [2019-01-13 02:08:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14412 states to 14412 states and 47548 transitions. [2019-01-13 02:08:27,345 INFO L78 Accepts]: Start accepts. Automaton has 14412 states and 47548 transitions. Word has length 59 [2019-01-13 02:08:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:27,345 INFO L480 AbstractCegarLoop]: Abstraction has 14412 states and 47548 transitions. [2019-01-13 02:08:27,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14412 states and 47548 transitions. [2019-01-13 02:08:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 02:08:27,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:27,365 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] [2019-01-13 02:08:27,365 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:27,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash -101368793, now seen corresponding path program 1 times [2019-01-13 02:08:27,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:27,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:27,874 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-13 02:08:28,057 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 02:08:28,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:08:28,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:08:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:08:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:08:28,059 INFO L87 Difference]: Start difference. First operand 14412 states and 47548 transitions. Second operand 8 states. [2019-01-13 02:08:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:29,572 INFO L93 Difference]: Finished difference Result 20800 states and 66979 transitions. [2019-01-13 02:08:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 02:08:29,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-01-13 02:08:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:29,613 INFO L225 Difference]: With dead ends: 20800 [2019-01-13 02:08:29,613 INFO L226 Difference]: Without dead ends: 20736 [2019-01-13 02:08:29,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-01-13 02:08:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20736 states. [2019-01-13 02:08:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20736 to 16196. [2019-01-13 02:08:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16196 states. [2019-01-13 02:08:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16196 states to 16196 states and 53058 transitions. [2019-01-13 02:08:29,890 INFO L78 Accepts]: Start accepts. Automaton has 16196 states and 53058 transitions. Word has length 73 [2019-01-13 02:08:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:29,890 INFO L480 AbstractCegarLoop]: Abstraction has 16196 states and 53058 transitions. [2019-01-13 02:08:29,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:08:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 16196 states and 53058 transitions. [2019-01-13 02:08:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-13 02:08:30,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:30,737 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] [2019-01-13 02:08:30,737 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1750204330, now seen corresponding path program 1 times [2019-01-13 02:08:30,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:30,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:30,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:30,851 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 02:08:30,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:30,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:08:30,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:08:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:08:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:08:30,853 INFO L87 Difference]: Start difference. First operand 16196 states and 53058 transitions. Second operand 3 states. [2019-01-13 02:08:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:31,251 INFO L93 Difference]: Finished difference Result 19284 states and 62126 transitions. [2019-01-13 02:08:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:08:31,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-13 02:08:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:31,307 INFO L225 Difference]: With dead ends: 19284 [2019-01-13 02:08:31,307 INFO L226 Difference]: Without dead ends: 19284 [2019-01-13 02:08:31,308 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 02:08:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19284 states. [2019-01-13 02:08:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19284 to 17292. [2019-01-13 02:08:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17292 states. [2019-01-13 02:08:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17292 states to 17292 states and 56208 transitions. [2019-01-13 02:08:31,733 INFO L78 Accepts]: Start accepts. Automaton has 17292 states and 56208 transitions. Word has length 75 [2019-01-13 02:08:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:31,733 INFO L480 AbstractCegarLoop]: Abstraction has 17292 states and 56208 transitions. [2019-01-13 02:08:31,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:08:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17292 states and 56208 transitions. [2019-01-13 02:08:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 02:08:31,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:31,771 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] [2019-01-13 02:08:31,771 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1292981589, now seen corresponding path program 1 times [2019-01-13 02:08:31,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:31,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:31,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:32,156 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 02:08:32,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 02:08:32,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 02:08:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 02:08:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 02:08:32,157 INFO L87 Difference]: Start difference. First operand 17292 states and 56208 transitions. Second operand 10 states. [2019-01-13 02:08:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:34,218 INFO L93 Difference]: Finished difference Result 25448 states and 79949 transitions. [2019-01-13 02:08:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 02:08:34,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-01-13 02:08:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:34,265 INFO L225 Difference]: With dead ends: 25448 [2019-01-13 02:08:34,265 INFO L226 Difference]: Without dead ends: 25384 [2019-01-13 02:08:34,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 02:08:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25384 states. [2019-01-13 02:08:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25384 to 19360. [2019-01-13 02:08:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19360 states. [2019-01-13 02:08:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19360 states to 19360 states and 62259 transitions. [2019-01-13 02:08:34,618 INFO L78 Accepts]: Start accepts. Automaton has 19360 states and 62259 transitions. Word has length 79 [2019-01-13 02:08:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:34,619 INFO L480 AbstractCegarLoop]: Abstraction has 19360 states and 62259 transitions. [2019-01-13 02:08:34,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 02:08:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 19360 states and 62259 transitions. [2019-01-13 02:08:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 02:08:34,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:34,643 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] [2019-01-13 02:08:34,644 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2114686996, now seen corresponding path program 1 times [2019-01-13 02:08:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:34,777 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 02:08:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:34,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:08:34,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:08:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:08:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:08:34,780 INFO L87 Difference]: Start difference. First operand 19360 states and 62259 transitions. Second operand 3 states. [2019-01-13 02:08:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:35,256 INFO L93 Difference]: Finished difference Result 20622 states and 66126 transitions. [2019-01-13 02:08:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:08:35,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-13 02:08:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:35,294 INFO L225 Difference]: With dead ends: 20622 [2019-01-13 02:08:35,294 INFO L226 Difference]: Without dead ends: 20622 [2019-01-13 02:08:35,295 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 02:08:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20622 states. [2019-01-13 02:08:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20622 to 19972. [2019-01-13 02:08:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-01-13 02:08:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 64141 transitions. [2019-01-13 02:08:35,603 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 64141 transitions. Word has length 80 [2019-01-13 02:08:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:35,603 INFO L480 AbstractCegarLoop]: Abstraction has 19972 states and 64141 transitions. [2019-01-13 02:08:35,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:08:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 64141 transitions. [2019-01-13 02:08:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 02:08:35,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:35,630 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] [2019-01-13 02:08:35,630 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:35,631 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2019-01-13 02:08:35,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:35,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:35,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:35,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:35,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:35,841 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 02:08:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:35,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:08:35,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:08:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:08:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:35,846 INFO L87 Difference]: Start difference. First operand 19972 states and 64141 transitions. Second operand 4 states. [2019-01-13 02:08:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:36,355 INFO L93 Difference]: Finished difference Result 24354 states and 77143 transitions. [2019-01-13 02:08:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:08:36,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-01-13 02:08:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:37,876 INFO L225 Difference]: With dead ends: 24354 [2019-01-13 02:08:37,876 INFO L226 Difference]: Without dead ends: 24354 [2019-01-13 02:08:37,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 02:08:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24354 states. [2019-01-13 02:08:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24354 to 22838. [2019-01-13 02:08:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22838 states. [2019-01-13 02:08:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22838 states to 22838 states and 72762 transitions. [2019-01-13 02:08:38,258 INFO L78 Accepts]: Start accepts. Automaton has 22838 states and 72762 transitions. Word has length 81 [2019-01-13 02:08:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:38,258 INFO L480 AbstractCegarLoop]: Abstraction has 22838 states and 72762 transitions. [2019-01-13 02:08:38,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:08:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22838 states and 72762 transitions. [2019-01-13 02:08:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 02:08:38,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:38,286 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] [2019-01-13 02:08:38,287 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2019-01-13 02:08:38,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:38,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:38,423 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 02:08:38,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 02:08:38,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 02:08:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 02:08:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:08:38,424 INFO L87 Difference]: Start difference. First operand 22838 states and 72762 transitions. Second operand 3 states. [2019-01-13 02:08:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:39,138 INFO L93 Difference]: Finished difference Result 24180 states and 76858 transitions. [2019-01-13 02:08:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 02:08:39,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-13 02:08:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:39,181 INFO L225 Difference]: With dead ends: 24180 [2019-01-13 02:08:39,181 INFO L226 Difference]: Without dead ends: 24180 [2019-01-13 02:08:39,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 02:08:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24180 states. [2019-01-13 02:08:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24180 to 23520. [2019-01-13 02:08:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23520 states. [2019-01-13 02:08:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23520 states to 23520 states and 74838 transitions. [2019-01-13 02:08:39,546 INFO L78 Accepts]: Start accepts. Automaton has 23520 states and 74838 transitions. Word has length 81 [2019-01-13 02:08:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:39,546 INFO L480 AbstractCegarLoop]: Abstraction has 23520 states and 74838 transitions. [2019-01-13 02:08:39,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 02:08:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23520 states and 74838 transitions. [2019-01-13 02:08:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 02:08:39,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:39,572 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] [2019-01-13 02:08:39,572 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -824597806, now seen corresponding path program 1 times [2019-01-13 02:08:39,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:39,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:39,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:39,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:39,742 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 02:08:39,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:39,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 02:08:39,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 02:08:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 02:08:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 02:08:39,744 INFO L87 Difference]: Start difference. First operand 23520 states and 74838 transitions. Second operand 4 states. [2019-01-13 02:08:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:40,271 INFO L93 Difference]: Finished difference Result 38701 states and 122710 transitions. [2019-01-13 02:08:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:08:40,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-01-13 02:08:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:40,342 INFO L225 Difference]: With dead ends: 38701 [2019-01-13 02:08:40,342 INFO L226 Difference]: Without dead ends: 38701 [2019-01-13 02:08:40,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38701 states. [2019-01-13 02:08:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38701 to 21914. [2019-01-13 02:08:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21914 states. [2019-01-13 02:08:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21914 states to 21914 states and 69051 transitions. [2019-01-13 02:08:40,773 INFO L78 Accepts]: Start accepts. Automaton has 21914 states and 69051 transitions. Word has length 82 [2019-01-13 02:08:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:40,773 INFO L480 AbstractCegarLoop]: Abstraction has 21914 states and 69051 transitions. [2019-01-13 02:08:40,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 02:08:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21914 states and 69051 transitions. [2019-01-13 02:08:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 02:08:40,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:40,799 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] [2019-01-13 02:08:40,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash -494832045, now seen corresponding path program 1 times [2019-01-13 02:08:40,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:40,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:41,308 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 02:08:41,467 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 02:08:41,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:41,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:41,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:41,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:41,468 INFO L87 Difference]: Start difference. First operand 21914 states and 69051 transitions. Second operand 6 states. [2019-01-13 02:08:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:42,824 INFO L93 Difference]: Finished difference Result 38158 states and 117738 transitions. [2019-01-13 02:08:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:08:42,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-13 02:08:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:42,892 INFO L225 Difference]: With dead ends: 38158 [2019-01-13 02:08:42,892 INFO L226 Difference]: Without dead ends: 37702 [2019-01-13 02:08:42,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:08:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37702 states. [2019-01-13 02:08:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37702 to 29770. [2019-01-13 02:08:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29770 states. [2019-01-13 02:08:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29770 states to 29770 states and 93479 transitions. [2019-01-13 02:08:43,398 INFO L78 Accepts]: Start accepts. Automaton has 29770 states and 93479 transitions. Word has length 82 [2019-01-13 02:08:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:43,398 INFO L480 AbstractCegarLoop]: Abstraction has 29770 states and 93479 transitions. [2019-01-13 02:08:43,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29770 states and 93479 transitions. [2019-01-13 02:08:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 02:08:43,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:43,439 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] [2019-01-13 02:08:43,440 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 466781972, now seen corresponding path program 1 times [2019-01-13 02:08:43,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:43,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:43,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:43,660 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 02:08:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:43,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:08:43,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:08:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:08:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:43,662 INFO L87 Difference]: Start difference. First operand 29770 states and 93479 transitions. Second operand 7 states. [2019-01-13 02:08:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:46,255 INFO L93 Difference]: Finished difference Result 55638 states and 171520 transitions. [2019-01-13 02:08:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 02:08:46,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-13 02:08:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:46,358 INFO L225 Difference]: With dead ends: 55638 [2019-01-13 02:08:46,358 INFO L226 Difference]: Without dead ends: 55526 [2019-01-13 02:08:46,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-01-13 02:08:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55526 states. [2019-01-13 02:08:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55526 to 34165. [2019-01-13 02:08:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34165 states. [2019-01-13 02:08:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 107081 transitions. [2019-01-13 02:08:47,008 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 107081 transitions. Word has length 82 [2019-01-13 02:08:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:47,008 INFO L480 AbstractCegarLoop]: Abstraction has 34165 states and 107081 transitions. [2019-01-13 02:08:47,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:08:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 107081 transitions. [2019-01-13 02:08:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 02:08:47,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:47,040 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] [2019-01-13 02:08:47,041 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1711546453, now seen corresponding path program 1 times [2019-01-13 02:08:47,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:47,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:47,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:47,307 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 02:08:47,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:47,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:47,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:47,309 INFO L87 Difference]: Start difference. First operand 34165 states and 107081 transitions. Second operand 5 states. [2019-01-13 02:08:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:47,391 INFO L93 Difference]: Finished difference Result 5633 states and 14550 transitions. [2019-01-13 02:08:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:08:47,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-01-13 02:08:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:47,398 INFO L225 Difference]: With dead ends: 5633 [2019-01-13 02:08:47,399 INFO L226 Difference]: Without dead ends: 4749 [2019-01-13 02:08:47,399 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 02:08:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2019-01-13 02:08:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4196. [2019-01-13 02:08:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4196 states. [2019-01-13 02:08:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 10926 transitions. [2019-01-13 02:08:47,446 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 10926 transitions. Word has length 82 [2019-01-13 02:08:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:47,447 INFO L480 AbstractCegarLoop]: Abstraction has 4196 states and 10926 transitions. [2019-01-13 02:08:47,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 10926 transitions. [2019-01-13 02:08:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:08:47,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:47,452 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 02:08:47,452 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1606432961, now seen corresponding path program 1 times [2019-01-13 02:08:47,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:47,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:47,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:47,881 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 02:08:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:47,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:47,882 INFO L87 Difference]: Start difference. First operand 4196 states and 10926 transitions. Second operand 6 states. [2019-01-13 02:08:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:48,266 INFO L93 Difference]: Finished difference Result 4607 states and 11766 transitions. [2019-01-13 02:08:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:08:48,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 02:08:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:48,275 INFO L225 Difference]: With dead ends: 4607 [2019-01-13 02:08:48,275 INFO L226 Difference]: Without dead ends: 4498 [2019-01-13 02:08:48,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2019-01-13 02:08:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 4404. [2019-01-13 02:08:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-01-13 02:08:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 11382 transitions. [2019-01-13 02:08:48,322 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 11382 transitions. Word has length 94 [2019-01-13 02:08:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:48,322 INFO L480 AbstractCegarLoop]: Abstraction has 4404 states and 11382 transitions. [2019-01-13 02:08:48,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 11382 transitions. [2019-01-13 02:08:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:08:48,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:48,327 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 02:08:48,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 94307518, now seen corresponding path program 1 times [2019-01-13 02:08:48,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:48,512 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 02:08:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:48,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:08:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:08:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:08:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:48,513 INFO L87 Difference]: Start difference. First operand 4404 states and 11382 transitions. Second operand 7 states. [2019-01-13 02:08:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:48,869 INFO L93 Difference]: Finished difference Result 4681 states and 12046 transitions. [2019-01-13 02:08:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:08:48,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 02:08:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:48,878 INFO L225 Difference]: With dead ends: 4681 [2019-01-13 02:08:48,878 INFO L226 Difference]: Without dead ends: 4681 [2019-01-13 02:08:48,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2019-01-13 02:08:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4388. [2019-01-13 02:08:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4388 states. [2019-01-13 02:08:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 11349 transitions. [2019-01-13 02:08:48,931 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 11349 transitions. Word has length 94 [2019-01-13 02:08:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 4388 states and 11349 transitions. [2019-01-13 02:08:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:08:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 11349 transitions. [2019-01-13 02:08:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:08:48,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:48,937 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 02:08:48,937 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1505187038, now seen corresponding path program 1 times [2019-01-13 02:08:48,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:48,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:49,235 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 02:08:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:49,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:49,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:49,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:49,236 INFO L87 Difference]: Start difference. First operand 4388 states and 11349 transitions. Second operand 5 states. [2019-01-13 02:08:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:49,371 INFO L93 Difference]: Finished difference Result 4142 states and 10700 transitions. [2019-01-13 02:08:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 02:08:49,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:08:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:49,379 INFO L225 Difference]: With dead ends: 4142 [2019-01-13 02:08:49,379 INFO L226 Difference]: Without dead ends: 4142 [2019-01-13 02:08:49,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2019-01-13 02:08:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4139. [2019-01-13 02:08:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2019-01-13 02:08:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 10694 transitions. [2019-01-13 02:08:49,423 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 10694 transitions. Word has length 94 [2019-01-13 02:08:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:49,424 INFO L480 AbstractCegarLoop]: Abstraction has 4139 states and 10694 transitions. [2019-01-13 02:08:49,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 10694 transitions. [2019-01-13 02:08:49,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:08:49,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:49,428 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 02:08:49,429 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash -153509389, now seen corresponding path program 1 times [2019-01-13 02:08:49,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:49,524 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 02:08:49,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:49,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:49,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:49,526 INFO L87 Difference]: Start difference. First operand 4139 states and 10694 transitions. Second operand 5 states. [2019-01-13 02:08:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:49,765 INFO L93 Difference]: Finished difference Result 7757 states and 20172 transitions. [2019-01-13 02:08:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:08:49,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 02:08:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:49,776 INFO L225 Difference]: With dead ends: 7757 [2019-01-13 02:08:49,776 INFO L226 Difference]: Without dead ends: 7757 [2019-01-13 02:08:49,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:08:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2019-01-13 02:08:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 4143. [2019-01-13 02:08:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-01-13 02:08:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 10693 transitions. [2019-01-13 02:08:49,839 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 10693 transitions. Word has length 94 [2019-01-13 02:08:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:49,840 INFO L480 AbstractCegarLoop]: Abstraction has 4143 states and 10693 transitions. [2019-01-13 02:08:49,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 10693 transitions. [2019-01-13 02:08:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 02:08:49,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:49,844 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 02:08:49,845 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1782150898, now seen corresponding path program 1 times [2019-01-13 02:08:49,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:49,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:50,220 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 02:08:50,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:50,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:50,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:50,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:50,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:50,221 INFO L87 Difference]: Start difference. First operand 4143 states and 10693 transitions. Second operand 6 states. [2019-01-13 02:08:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:50,335 INFO L93 Difference]: Finished difference Result 3855 states and 9701 transitions. [2019-01-13 02:08:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 02:08:50,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 02:08:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:50,342 INFO L225 Difference]: With dead ends: 3855 [2019-01-13 02:08:50,342 INFO L226 Difference]: Without dead ends: 3855 [2019-01-13 02:08:50,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3855 states. [2019-01-13 02:08:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3855 to 2957. [2019-01-13 02:08:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2957 states. [2019-01-13 02:08:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 7530 transitions. [2019-01-13 02:08:50,378 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 7530 transitions. Word has length 94 [2019-01-13 02:08:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:50,378 INFO L480 AbstractCegarLoop]: Abstraction has 2957 states and 7530 transitions. [2019-01-13 02:08:50,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 7530 transitions. [2019-01-13 02:08:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:50,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:50,382 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, 1, 1] [2019-01-13 02:08:50,382 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1353672534, now seen corresponding path program 1 times [2019-01-13 02:08:50,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:50,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:50,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:50,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:50,521 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 02:08:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 02:08:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 02:08:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 02:08:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 02:08:50,522 INFO L87 Difference]: Start difference. First operand 2957 states and 7530 transitions. Second operand 8 states. [2019-01-13 02:08:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:51,286 INFO L93 Difference]: Finished difference Result 4760 states and 11784 transitions. [2019-01-13 02:08:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 02:08:51,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-13 02:08:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:51,294 INFO L225 Difference]: With dead ends: 4760 [2019-01-13 02:08:51,294 INFO L226 Difference]: Without dead ends: 4728 [2019-01-13 02:08:51,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 02:08:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-01-13 02:08:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 3609. [2019-01-13 02:08:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2019-01-13 02:08:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 9110 transitions. [2019-01-13 02:08:51,338 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 9110 transitions. Word has length 96 [2019-01-13 02:08:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:51,339 INFO L480 AbstractCegarLoop]: Abstraction has 3609 states and 9110 transitions. [2019-01-13 02:08:51,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 02:08:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 9110 transitions. [2019-01-13 02:08:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:51,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:51,343 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, 1, 1] [2019-01-13 02:08:51,343 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -108908053, now seen corresponding path program 1 times [2019-01-13 02:08:51,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:51,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:51,883 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-13 02:08:52,344 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-13 02:08:52,522 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 02:08:52,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:52,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 02:08:52,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 02:08:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 02:08:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:52,524 INFO L87 Difference]: Start difference. First operand 3609 states and 9110 transitions. Second operand 7 states. [2019-01-13 02:08:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:52,991 INFO L93 Difference]: Finished difference Result 3633 states and 9095 transitions. [2019-01-13 02:08:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:08:52,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-13 02:08:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:52,998 INFO L225 Difference]: With dead ends: 3633 [2019-01-13 02:08:52,999 INFO L226 Difference]: Without dead ends: 3613 [2019-01-13 02:08:52,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:08:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2019-01-13 02:08:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3537. [2019-01-13 02:08:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3537 states. [2019-01-13 02:08:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 8910 transitions. [2019-01-13 02:08:53,055 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 8910 transitions. Word has length 96 [2019-01-13 02:08:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:53,055 INFO L480 AbstractCegarLoop]: Abstraction has 3537 states and 8910 transitions. [2019-01-13 02:08:53,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 02:08:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 8910 transitions. [2019-01-13 02:08:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:53,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:53,060 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, 1, 1] [2019-01-13 02:08:53,060 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1862031404, now seen corresponding path program 1 times [2019-01-13 02:08:53,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:53,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:53,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:53,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:53,330 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 02:08:53,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:53,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 02:08:53,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 02:08:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 02:08:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:53,331 INFO L87 Difference]: Start difference. First operand 3537 states and 8910 transitions. Second operand 6 states. [2019-01-13 02:08:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:53,544 INFO L93 Difference]: Finished difference Result 3630 states and 9114 transitions. [2019-01-13 02:08:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 02:08:53,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-13 02:08:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:53,550 INFO L225 Difference]: With dead ends: 3630 [2019-01-13 02:08:53,550 INFO L226 Difference]: Without dead ends: 3630 [2019-01-13 02:08:53,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 02:08:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2019-01-13 02:08:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3567. [2019-01-13 02:08:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-01-13 02:08:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 8977 transitions. [2019-01-13 02:08:53,588 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 8977 transitions. Word has length 96 [2019-01-13 02:08:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:53,588 INFO L480 AbstractCegarLoop]: Abstraction has 3567 states and 8977 transitions. [2019-01-13 02:08:53,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 02:08:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 8977 transitions. [2019-01-13 02:08:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:53,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:53,592 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, 1, 1] [2019-01-13 02:08:53,592 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash 947032684, now seen corresponding path program 1 times [2019-01-13 02:08:53,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:53,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:53,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:53,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 02:08:53,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:53,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:53,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:53,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:53,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:53,751 INFO L87 Difference]: Start difference. First operand 3567 states and 8977 transitions. Second operand 5 states. [2019-01-13 02:08:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:53,961 INFO L93 Difference]: Finished difference Result 4015 states and 10081 transitions. [2019-01-13 02:08:53,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 02:08:53,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-13 02:08:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:53,968 INFO L225 Difference]: With dead ends: 4015 [2019-01-13 02:08:53,968 INFO L226 Difference]: Without dead ends: 3983 [2019-01-13 02:08:53,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 02:08:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2019-01-13 02:08:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3054. [2019-01-13 02:08:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2019-01-13 02:08:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7700 transitions. [2019-01-13 02:08:54,005 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7700 transitions. Word has length 96 [2019-01-13 02:08:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:54,006 INFO L480 AbstractCegarLoop]: Abstraction has 3054 states and 7700 transitions. [2019-01-13 02:08:54,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7700 transitions. [2019-01-13 02:08:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:54,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:54,009 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, 1, 1] [2019-01-13 02:08:54,010 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:54,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2103170131, now seen corresponding path program 1 times [2019-01-13 02:08:54,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:54,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:54,207 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 02:08:54,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:54,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 02:08:54,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 02:08:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 02:08:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 02:08:54,209 INFO L87 Difference]: Start difference. First operand 3054 states and 7700 transitions. Second operand 9 states. [2019-01-13 02:08:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:54,403 INFO L93 Difference]: Finished difference Result 4959 states and 12737 transitions. [2019-01-13 02:08:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 02:08:54,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-01-13 02:08:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:54,407 INFO L225 Difference]: With dead ends: 4959 [2019-01-13 02:08:54,408 INFO L226 Difference]: Without dead ends: 1989 [2019-01-13 02:08:54,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 02:08:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-01-13 02:08:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-01-13 02:08:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-01-13 02:08:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5183 transitions. [2019-01-13 02:08:54,429 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5183 transitions. Word has length 96 [2019-01-13 02:08:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:54,429 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5183 transitions. [2019-01-13 02:08:54,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 02:08:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5183 transitions. [2019-01-13 02:08:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:54,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:54,432 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, 1, 1] [2019-01-13 02:08:54,432 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1343180800, now seen corresponding path program 2 times [2019-01-13 02:08:54,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 02:08:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:54,735 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 02:08:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:54,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 02:08:54,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 02:08:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 02:08:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 02:08:54,736 INFO L87 Difference]: Start difference. First operand 1989 states and 5183 transitions. Second operand 5 states. [2019-01-13 02:08:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:54,771 INFO L93 Difference]: Finished difference Result 1989 states and 5162 transitions. [2019-01-13 02:08:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 02:08:54,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-13 02:08:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:54,774 INFO L225 Difference]: With dead ends: 1989 [2019-01-13 02:08:54,775 INFO L226 Difference]: Without dead ends: 1989 [2019-01-13 02:08:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 02:08:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-01-13 02:08:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1948. [2019-01-13 02:08:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2019-01-13 02:08:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 5080 transitions. [2019-01-13 02:08:54,795 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 5080 transitions. Word has length 96 [2019-01-13 02:08:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:54,796 INFO L480 AbstractCegarLoop]: Abstraction has 1948 states and 5080 transitions. [2019-01-13 02:08:54,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 02:08:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 5080 transitions. [2019-01-13 02:08:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:54,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:54,798 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, 1, 1] [2019-01-13 02:08:54,799 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1013415039, now seen corresponding path program 2 times [2019-01-13 02:08:54,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:08:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 02:08:55,031 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 02:08:55,384 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 02:08:55,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 02:08:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 02:08:55,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 02:08:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 02:08:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 02:08:55,386 INFO L87 Difference]: Start difference. First operand 1948 states and 5080 transitions. Second operand 12 states. [2019-01-13 02:08:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 02:08:56,014 INFO L93 Difference]: Finished difference Result 3712 states and 9772 transitions. [2019-01-13 02:08:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 02:08:56,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-01-13 02:08:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 02:08:56,021 INFO L225 Difference]: With dead ends: 3712 [2019-01-13 02:08:56,021 INFO L226 Difference]: Without dead ends: 2576 [2019-01-13 02:08:56,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 02:08:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2019-01-13 02:08:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2424. [2019-01-13 02:08:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-01-13 02:08:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 6196 transitions. [2019-01-13 02:08:56,048 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 6196 transitions. Word has length 96 [2019-01-13 02:08:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 02:08:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 2424 states and 6196 transitions. [2019-01-13 02:08:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 02:08:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 6196 transitions. [2019-01-13 02:08:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 02:08:56,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 02:08:56,052 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, 1, 1] [2019-01-13 02:08:56,052 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 02:08:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 02:08:56,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2137183355, now seen corresponding path program 3 times [2019-01-13 02:08:56,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 02:08:56,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 02:08:56,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:56,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 02:08:56,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 02:08:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:08:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 02:08:56,147 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 02:08:56,349 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 02:08:56,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 02:08:56 BasicIcfg [2019-01-13 02:08:56,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 02:08:56,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 02:08:56,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 02:08:56,356 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 02:08:56,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 02:08:08" (3/4) ... [2019-01-13 02:08:56,360 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 02:08:56,530 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 02:08:56,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 02:08:56,531 INFO L168 Benchmark]: Toolchain (without parser) took 50785.57 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 947.3 MB in the beginning and 1.5 GB in the end (delta: -542.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,533 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 02:08:56,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 933.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.83 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,534 INFO L168 Benchmark]: Boogie Preprocessor took 47.22 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 02:08:56,535 INFO L168 Benchmark]: RCFGBuilder took 1207.31 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,537 INFO L168 Benchmark]: TraceAbstraction took 48329.10 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -476.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,538 INFO L168 Benchmark]: Witness Printer took 175.29 ms. Allocated memory is still 3.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-13 02:08:56,542 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 933.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.83 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.22 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 1207.31 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48329.10 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -476.5 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 175.29 ms. Allocated memory is still 3.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 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] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1101; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1102; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 48.1s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7486 SDtfs, 8580 SDslu, 16882 SDs, 0 SdLazy, 7359 SolverSat, 452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 91 SyntacticMatches, 13 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=4, 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: 11.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 151107 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2255 ConstructedInterpolants, 0 QuantifiedInterpolants, 461954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...