./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4a4d2e67bbd8206d7e1e6a814362d1d3f7ab891 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 23:30:39,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 23:30:39,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 23:30:39,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 23:30:39,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 23:30:39,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 23:30:39,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 23:30:39,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 23:30:39,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 23:30:39,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 23:30:39,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 23:30:39,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 23:30:39,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 23:30:39,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 23:30:39,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 23:30:39,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 23:30:39,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 23:30:39,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 23:30:39,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 23:30:39,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 23:30:39,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 23:30:39,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 23:30:39,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 23:30:39,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 23:30:39,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 23:30:39,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 23:30:39,839 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 23:30:39,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 23:30:39,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 23:30:39,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 23:30:39,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 23:30:39,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 23:30:39,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 23:30:39,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 23:30:39,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 23:30:39,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 23:30:39,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 23:30:39,868 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 23:30:39,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 23:30:39,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 23:30:39,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 23:30:39,870 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 23:30:39,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 23:30:39,872 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 23:30:39,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 23:30:39,873 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 23:30:39,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 23:30:39,875 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 23:30:39,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 23:30:39,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 23:30:39,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 23:30:39,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 23:30:39,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 23:30:39,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 23:30:39,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 23:30:39,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 23:30:39,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 23:30:39,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 23:30:39,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 23:30:39,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 23:30:39,880 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 -> a4a4d2e67bbd8206d7e1e6a814362d1d3f7ab891 [2019-01-12 23:30:39,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 23:30:39,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 23:30:39,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 23:30:39,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 23:30:39,963 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 23:30:39,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i [2019-01-12 23:30:40,028 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839a30e6/5924faa4046c4aadb2fc2c63a9d62da8/FLAGa8087b406 [2019-01-12 23:30:40,653 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 23:30:40,654 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_tso.oepc_false-unreach-call.i [2019-01-12 23:30:40,671 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839a30e6/5924faa4046c4aadb2fc2c63a9d62da8/FLAGa8087b406 [2019-01-12 23:30:40,878 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839a30e6/5924faa4046c4aadb2fc2c63a9d62da8 [2019-01-12 23:30:40,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 23:30:40,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 23:30:40,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 23:30:40,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 23:30:40,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 23:30:40,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:30:40" (1/1) ... [2019-01-12 23:30:40,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:40, skipping insertion in model container [2019-01-12 23:30:40,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:30:40" (1/1) ... [2019-01-12 23:30:40,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 23:30:40,950 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 23:30:41,487 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:30:41,501 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 23:30:41,684 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 23:30:41,764 INFO L195 MainTranslator]: Completed translation [2019-01-12 23:30:41,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41 WrapperNode [2019-01-12 23:30:41,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 23:30:41,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 23:30:41,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 23:30:41,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 23:30:41,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 23:30:41,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 23:30:41,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 23:30:41,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 23:30:41,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (1/1) ... [2019-01-12 23:30:41,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 23:30:41,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 23:30:41,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 23:30:41,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 23:30:41,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (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-12 23:30:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 23:30:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-12 23:30:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 23:30:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 23:30:41,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-12 23:30:41,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-12 23:30:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-12 23:30:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-12 23:30:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-12 23:30:41,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 23:30:41,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 23:30:41,968 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-12 23:30:43,165 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 23:30:43,165 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 23:30:43,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:43 BoogieIcfgContainer [2019-01-12 23:30:43,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 23:30:43,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 23:30:43,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 23:30:43,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 23:30:43,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:30:40" (1/3) ... [2019-01-12 23:30:43,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a624127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:30:43, skipping insertion in model container [2019-01-12 23:30:43,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:30:41" (2/3) ... [2019-01-12 23:30:43,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a624127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:30:43, skipping insertion in model container [2019-01-12 23:30:43,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:43" (3/3) ... [2019-01-12 23:30:43,176 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_tso.oepc_false-unreach-call.i [2019-01-12 23:30:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,222 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,223 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,224 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,224 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,234 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,234 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,240 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,241 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,242 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,243 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,244 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,245 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,250 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,251 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,252 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,253 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,255 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,256 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,257 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,258 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 23:30:43,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-12 23:30:43,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 23:30:43,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 23:30:43,350 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 23:30:43,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 23:30:43,374 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 23:30:43,375 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 23:30:43,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 23:30:43,375 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 23:30:43,375 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 23:30:43,375 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 23:30:43,375 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 23:30:43,375 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 23:30:43,389 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-12 23:30:45,884 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-12 23:30:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-12 23:30:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 23:30:45,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:45,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:30:45,898 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2019-01-12 23:30:45,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:45,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:45,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:46,316 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-12 23:30:46,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:46,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:30:46,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:30:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:30:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:46,337 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-12 23:30:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:47,504 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-12 23:30:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:30:47,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-12 23:30:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:47,937 INFO L225 Difference]: With dead ends: 60791 [2019-01-12 23:30:47,937 INFO L226 Difference]: Without dead ends: 44271 [2019-01-12 23:30:47,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:30:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-12 23:30:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-12 23:30:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-12 23:30:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-12 23:30:49,720 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-12 23:30:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:49,721 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-12 23:30:49,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:30:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-12 23:30:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 23:30:49,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:49,732 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-12 23:30:49,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2019-01-12 23:30:49,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:49,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:49,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:49,930 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-12 23:30:49,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:49,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:49,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:49,932 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2019-01-12 23:30:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:52,159 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2019-01-12 23:30:52,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:52,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-12 23:30:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:52,946 INFO L225 Difference]: With dead ends: 64005 [2019-01-12 23:30:52,946 INFO L226 Difference]: Without dead ends: 63453 [2019-01-12 23:30:52,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:30:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2019-01-12 23:30:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2019-01-12 23:30:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2019-01-12 23:30:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2019-01-12 23:30:54,633 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2019-01-12 23:30:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:54,636 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2019-01-12 23:30:54,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2019-01-12 23:30:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 23:30:54,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:54,648 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] [2019-01-12 23:30:54,648 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2019-01-12 23:30:54,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:54,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:54,817 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-12 23:30:54,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:54,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:30:54,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:30:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:30:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:30:54,818 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2019-01-12 23:30:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:56,285 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2019-01-12 23:30:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:30:56,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 23:30:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:56,549 INFO L225 Difference]: With dead ends: 81367 [2019-01-12 23:30:56,549 INFO L226 Difference]: Without dead ends: 80855 [2019-01-12 23:30:56,550 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-12 23:30:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2019-01-12 23:30:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2019-01-12 23:30:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2019-01-12 23:30:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2019-01-12 23:30:59,282 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2019-01-12 23:30:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:30:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2019-01-12 23:30:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:30:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2019-01-12 23:30:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 23:30:59,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:30:59,294 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] [2019-01-12 23:30:59,295 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:30:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:30:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2019-01-12 23:30:59,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:30:59,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:30:59,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:30:59,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:30:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:30:59,361 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-12 23:30:59,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:30:59,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:30:59,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:30:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:30:59,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:30:59,363 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2019-01-12 23:30:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:30:59,701 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2019-01-12 23:30:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:30:59,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 23:30:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:30:59,857 INFO L225 Difference]: With dead ends: 65251 [2019-01-12 23:30:59,857 INFO L226 Difference]: Without dead ends: 65251 [2019-01-12 23:30:59,857 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-12 23:31:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-01-12 23:31:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2019-01-12 23:31:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2019-01-12 23:31:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2019-01-12 23:31:02,719 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2019-01-12 23:31:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:02,720 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2019-01-12 23:31:02,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:31:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2019-01-12 23:31:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:31:02,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:02,741 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-12 23:31:02,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2019-01-12 23:31:02,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:02,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:02,964 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-12 23:31:02,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:02,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:02,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:02,967 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2019-01-12 23:31:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:04,307 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2019-01-12 23:31:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:31:04,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:31:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:04,472 INFO L225 Difference]: With dead ends: 67511 [2019-01-12 23:31:04,472 INFO L226 Difference]: Without dead ends: 67511 [2019-01-12 23:31:04,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2019-01-12 23:31:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2019-01-12 23:31:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2019-01-12 23:31:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2019-01-12 23:31:05,901 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2019-01-12 23:31:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:05,901 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2019-01-12 23:31:05,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2019-01-12 23:31:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:31:05,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:05,922 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-12 23:31:05,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2019-01-12 23:31:05,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:06,161 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-12 23:31:06,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:06,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:06,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:06,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:06,163 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2019-01-12 23:31:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:08,695 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2019-01-12 23:31:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 23:31:08,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-12 23:31:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:08,916 INFO L225 Difference]: With dead ends: 88528 [2019-01-12 23:31:08,916 INFO L226 Difference]: Without dead ends: 88528 [2019-01-12 23:31:08,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:31:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2019-01-12 23:31:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2019-01-12 23:31:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2019-01-12 23:31:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2019-01-12 23:31:10,522 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2019-01-12 23:31:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:10,522 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2019-01-12 23:31:10,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2019-01-12 23:31:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:31:10,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:10,537 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-12 23:31:10,537 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2019-01-12 23:31:10,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:10,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:10,714 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-12 23:31:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:10,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:10,716 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2019-01-12 23:31:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:10,873 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2019-01-12 23:31:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:31:10,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-12 23:31:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:10,900 INFO L225 Difference]: With dead ends: 15375 [2019-01-12 23:31:10,900 INFO L226 Difference]: Without dead ends: 13789 [2019-01-12 23:31:10,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 23:31:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2019-01-12 23:31:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2019-01-12 23:31:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-01-12 23:31:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2019-01-12 23:31:11,111 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2019-01-12 23:31:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2019-01-12 23:31:11,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2019-01-12 23:31:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 23:31:11,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:11,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] [2019-01-12 23:31:11,114 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2019-01-12 23:31:11,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:11,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:11,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:11,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:11,339 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-12 23:31:11,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:11,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:11,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:11,341 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2019-01-12 23:31:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:11,926 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2019-01-12 23:31:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:31:11,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 23:31:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:11,962 INFO L225 Difference]: With dead ends: 19970 [2019-01-12 23:31:11,963 INFO L226 Difference]: Without dead ends: 19898 [2019-01-12 23:31:11,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 23:31:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2019-01-12 23:31:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2019-01-12 23:31:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2019-01-12 23:31:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2019-01-12 23:31:12,212 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2019-01-12 23:31:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:12,212 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2019-01-12 23:31:12,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2019-01-12 23:31:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:31:12,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:12,217 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] [2019-01-12 23:31:12,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2019-01-12 23:31:12,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:12,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:12,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:12,431 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-12 23:31:12,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:12,433 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2019-01-12 23:31:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:13,816 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2019-01-12 23:31:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:31:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 23:31:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:13,861 INFO L225 Difference]: With dead ends: 16617 [2019-01-12 23:31:13,861 INFO L226 Difference]: Without dead ends: 16617 [2019-01-12 23:31:13,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2019-01-12 23:31:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2019-01-12 23:31:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2019-01-12 23:31:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2019-01-12 23:31:14,099 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2019-01-12 23:31:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:14,099 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2019-01-12 23:31:14,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2019-01-12 23:31:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 23:31:14,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:14,105 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] [2019-01-12 23:31:14,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2019-01-12 23:31:14,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:14,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:14,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:14,218 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-12 23:31:14,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:14,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:14,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:14,220 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2019-01-12 23:31:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:14,924 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2019-01-12 23:31:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:31:14,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-12 23:31:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:14,977 INFO L225 Difference]: With dead ends: 28106 [2019-01-12 23:31:14,977 INFO L226 Difference]: Without dead ends: 28035 [2019-01-12 23:31:14,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 23:31:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2019-01-12 23:31:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2019-01-12 23:31:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-01-12 23:31:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2019-01-12 23:31:15,295 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2019-01-12 23:31:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:15,295 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2019-01-12 23:31:15,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2019-01-12 23:31:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:31:15,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:15,303 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] [2019-01-12 23:31:15,303 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2056127163, now seen corresponding path program 1 times [2019-01-12 23:31:15,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:15,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:15,442 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-12 23:31:15,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:15,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:31:15,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:31:15,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:31:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:31:15,444 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2019-01-12 23:31:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:15,838 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2019-01-12 23:31:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:31:15,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-12 23:31:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:15,868 INFO L225 Difference]: With dead ends: 18092 [2019-01-12 23:31:15,869 INFO L226 Difference]: Without dead ends: 18092 [2019-01-12 23:31:15,869 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-12 23:31:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2019-01-12 23:31:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2019-01-12 23:31:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2019-01-12 23:31:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2019-01-12 23:31:16,127 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2019-01-12 23:31:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:16,127 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2019-01-12 23:31:16,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:31:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2019-01-12 23:31:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 23:31:16,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:16,135 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] [2019-01-12 23:31:16,135 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 21082180, now seen corresponding path program 1 times [2019-01-12 23:31:16,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:16,279 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-12 23:31:16,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:16,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:16,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:16,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:16,281 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2019-01-12 23:31:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:16,646 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2019-01-12 23:31:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:31:16,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-12 23:31:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:16,687 INFO L225 Difference]: With dead ends: 21696 [2019-01-12 23:31:16,687 INFO L226 Difference]: Without dead ends: 21696 [2019-01-12 23:31:16,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2019-01-12 23:31:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2019-01-12 23:31:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2019-01-12 23:31:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2019-01-12 23:31:17,025 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2019-01-12 23:31:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:17,026 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2019-01-12 23:31:17,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2019-01-12 23:31:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:17,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:17,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] [2019-01-12 23:31:17,041 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:17,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1344510516, now seen corresponding path program 1 times [2019-01-12 23:31:17,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:17,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:17,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:17,228 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-12 23:31:17,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:17,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:17,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:17,229 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2019-01-12 23:31:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:18,476 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2019-01-12 23:31:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:18,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:31:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:18,522 INFO L225 Difference]: With dead ends: 23814 [2019-01-12 23:31:18,522 INFO L226 Difference]: Without dead ends: 23814 [2019-01-12 23:31:18,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2019-01-12 23:31:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2019-01-12 23:31:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2019-01-12 23:31:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2019-01-12 23:31:18,869 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2019-01-12 23:31:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:18,870 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2019-01-12 23:31:18,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2019-01-12 23:31:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:18,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:18,882 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] [2019-01-12 23:31:18,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 873247437, now seen corresponding path program 1 times [2019-01-12 23:31:18,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:18,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:18,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:19,054 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-12 23:31:19,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:19,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:19,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:19,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:19,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:19,055 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2019-01-12 23:31:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:19,620 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2019-01-12 23:31:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:31:19,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-12 23:31:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:19,684 INFO L225 Difference]: With dead ends: 25702 [2019-01-12 23:31:19,684 INFO L226 Difference]: Without dead ends: 25702 [2019-01-12 23:31:19,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:31:19,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-01-12 23:31:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2019-01-12 23:31:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2019-01-12 23:31:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2019-01-12 23:31:20,222 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2019-01-12 23:31:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2019-01-12 23:31:20,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2019-01-12 23:31:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:20,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:20,234 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] [2019-01-12 23:31:20,234 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1084598350, now seen corresponding path program 1 times [2019-01-12 23:31:20,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:20,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:20,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:20,451 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-12 23:31:20,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:20,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:20,453 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2019-01-12 23:31:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:20,961 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2019-01-12 23:31:20,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:20,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:31:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:21,014 INFO L225 Difference]: With dead ends: 29793 [2019-01-12 23:31:21,014 INFO L226 Difference]: Without dead ends: 29793 [2019-01-12 23:31:21,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2019-01-12 23:31:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2019-01-12 23:31:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2019-01-12 23:31:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2019-01-12 23:31:21,393 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2019-01-12 23:31:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:21,394 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2019-01-12 23:31:21,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2019-01-12 23:31:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:21,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:21,407 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] [2019-01-12 23:31:21,408 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 574064173, now seen corresponding path program 1 times [2019-01-12 23:31:21,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:21,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:21,556 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-12 23:31:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:21,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:21,557 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2019-01-12 23:31:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:22,163 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2019-01-12 23:31:22,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:31:22,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:31:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:22,232 INFO L225 Difference]: With dead ends: 36420 [2019-01-12 23:31:22,233 INFO L226 Difference]: Without dead ends: 36420 [2019-01-12 23:31:22,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2019-01-12 23:31:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2019-01-12 23:31:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2019-01-12 23:31:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2019-01-12 23:31:22,728 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2019-01-12 23:31:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:22,728 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2019-01-12 23:31:22,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2019-01-12 23:31:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:22,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:22,740 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] [2019-01-12 23:31:22,740 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2019-01-12 23:31:22,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:22,844 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-12 23:31:22,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:22,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:22,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:22,846 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 4 states. [2019-01-12 23:31:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:23,553 INFO L93 Difference]: Finished difference Result 39012 states and 116891 transitions. [2019-01-12 23:31:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 23:31:23,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-12 23:31:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:23,619 INFO L225 Difference]: With dead ends: 39012 [2019-01-12 23:31:23,619 INFO L226 Difference]: Without dead ends: 38780 [2019-01-12 23:31:23,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 23:31:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38780 states. [2019-01-12 23:31:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38780 to 35900. [2019-01-12 23:31:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35900 states. [2019-01-12 23:31:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35900 states to 35900 states and 107661 transitions. [2019-01-12 23:31:24,149 INFO L78 Accepts]: Start accepts. Automaton has 35900 states and 107661 transitions. Word has length 67 [2019-01-12 23:31:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:24,149 INFO L480 AbstractCegarLoop]: Abstraction has 35900 states and 107661 transitions. [2019-01-12 23:31:24,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35900 states and 107661 transitions. [2019-01-12 23:31:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:24,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:31:24,161 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2019-01-12 23:31:24,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:24,269 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-12 23:31:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:24,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:24,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:24,270 INFO L87 Difference]: Start difference. First operand 35900 states and 107661 transitions. Second operand 5 states. [2019-01-12 23:31:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:24,326 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2019-01-12 23:31:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:31:24,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-12 23:31:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:24,336 INFO L225 Difference]: With dead ends: 9316 [2019-01-12 23:31:24,337 INFO L226 Difference]: Without dead ends: 7464 [2019-01-12 23:31:24,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-01-12 23:31:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2019-01-12 23:31:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-01-12 23:31:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2019-01-12 23:31:24,411 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2019-01-12 23:31:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:24,411 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2019-01-12 23:31:24,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2019-01-12 23:31:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 23:31:24,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:24,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:31:24,417 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2019-01-12 23:31:24,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:24,488 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-12 23:31:24,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:24,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 23:31:24,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 23:31:24,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 23:31:24,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 23:31:24,489 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2019-01-12 23:31:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:24,538 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2019-01-12 23:31:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 23:31:24,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-12 23:31:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:24,549 INFO L225 Difference]: With dead ends: 8820 [2019-01-12 23:31:24,549 INFO L226 Difference]: Without dead ends: 8820 [2019-01-12 23:31:24,549 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-12 23:31:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-01-12 23:31:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2019-01-12 23:31:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-01-12 23:31:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2019-01-12 23:31:24,625 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2019-01-12 23:31:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:24,625 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2019-01-12 23:31:24,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 23:31:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2019-01-12 23:31:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:31:24,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:24,631 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-12 23:31:24,631 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2019-01-12 23:31:24,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:25,003 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-12 23:31:25,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:25,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:25,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:25,005 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2019-01-12 23:31:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:26,580 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2019-01-12 23:31:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 23:31:26,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-12 23:31:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:26,590 INFO L225 Difference]: With dead ends: 7470 [2019-01-12 23:31:26,590 INFO L226 Difference]: Without dead ends: 7470 [2019-01-12 23:31:26,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 23:31:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-12 23:31:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2019-01-12 23:31:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-01-12 23:31:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2019-01-12 23:31:26,661 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2019-01-12 23:31:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:26,661 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2019-01-12 23:31:26,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2019-01-12 23:31:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 23:31:26,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:26,668 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-12 23:31:26,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2019-01-12 23:31:26,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:26,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:26,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:26,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:26,840 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-12 23:31:26,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:26,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:26,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:26,842 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2019-01-12 23:31:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:27,379 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2019-01-12 23:31:27,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:31:27,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-12 23:31:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:27,391 INFO L225 Difference]: With dead ends: 7881 [2019-01-12 23:31:27,391 INFO L226 Difference]: Without dead ends: 7762 [2019-01-12 23:31:27,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 23:31:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-01-12 23:31:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2019-01-12 23:31:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-01-12 23:31:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2019-01-12 23:31:27,487 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2019-01-12 23:31:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:27,488 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2019-01-12 23:31:27,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2019-01-12 23:31:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:31:27,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:27,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:31:27,498 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1190095737, now seen corresponding path program 1 times [2019-01-12 23:31:27,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:27,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:27,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-12 23:31:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:27,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:27,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:27,736 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2019-01-12 23:31:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:28,114 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2019-01-12 23:31:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:31:28,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:31:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:28,130 INFO L225 Difference]: With dead ends: 10608 [2019-01-12 23:31:28,130 INFO L226 Difference]: Without dead ends: 10608 [2019-01-12 23:31:28,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-01-12 23:31:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2019-01-12 23:31:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-01-12 23:31:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2019-01-12 23:31:28,253 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2019-01-12 23:31:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:28,253 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2019-01-12 23:31:28,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2019-01-12 23:31:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 23:31:28,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:28,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 23:31:28,265 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:28,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1388639917, now seen corresponding path program 1 times [2019-01-12 23:31:28,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:28,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:28,497 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-12 23:31:28,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 23:31:28,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 23:31:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 23:31:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 23:31:28,499 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2019-01-12 23:31:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:29,275 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2019-01-12 23:31:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 23:31:29,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 23:31:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:29,287 INFO L225 Difference]: With dead ends: 8526 [2019-01-12 23:31:29,287 INFO L226 Difference]: Without dead ends: 8526 [2019-01-12 23:31:29,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-01-12 23:31:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2019-01-12 23:31:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2019-01-12 23:31:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2019-01-12 23:31:29,396 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2019-01-12 23:31:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:29,396 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2019-01-12 23:31:29,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 23:31:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2019-01-12 23:31:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:29,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:29,407 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-12 23:31:29,407 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2094563457, now seen corresponding path program 1 times [2019-01-12 23:31:29,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:29,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:29,733 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-12 23:31:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:29,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:29,734 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2019-01-12 23:31:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:30,160 INFO L93 Difference]: Finished difference Result 7433 states and 16736 transitions. [2019-01-12 23:31:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:31:30,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:31:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:30,170 INFO L225 Difference]: With dead ends: 7433 [2019-01-12 23:31:30,170 INFO L226 Difference]: Without dead ends: 7433 [2019-01-12 23:31:30,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2019-01-12 23:31:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7001. [2019-01-12 23:31:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-01-12 23:31:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 15799 transitions. [2019-01-12 23:31:30,240 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 15799 transitions. Word has length 94 [2019-01-12 23:31:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:30,240 INFO L480 AbstractCegarLoop]: Abstraction has 7001 states and 15799 transitions. [2019-01-12 23:31:30,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 15799 transitions. [2019-01-12 23:31:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:30,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:30,249 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-12 23:31:30,249 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651615, now seen corresponding path program 1 times [2019-01-12 23:31:30,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:30,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:30,507 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-12 23:31:30,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:30,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:31:30,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:31:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:31:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:30,509 INFO L87 Difference]: Start difference. First operand 7001 states and 15799 transitions. Second operand 8 states. [2019-01-12 23:31:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:33,296 INFO L93 Difference]: Finished difference Result 19264 states and 43254 transitions. [2019-01-12 23:31:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 23:31:33,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-12 23:31:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:33,320 INFO L225 Difference]: With dead ends: 19264 [2019-01-12 23:31:33,320 INFO L226 Difference]: Without dead ends: 19145 [2019-01-12 23:31:33,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 23:31:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2019-01-12 23:31:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 10407. [2019-01-12 23:31:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10407 states. [2019-01-12 23:31:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 23675 transitions. [2019-01-12 23:31:33,487 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 23675 transitions. Word has length 94 [2019-01-12 23:31:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:33,488 INFO L480 AbstractCegarLoop]: Abstraction has 10407 states and 23675 transitions. [2019-01-12 23:31:33,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:31:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 23675 transitions. [2019-01-12 23:31:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:33,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:33,500 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-12 23:31:33,500 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1298551200, now seen corresponding path program 1 times [2019-01-12 23:31:33,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:33,765 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-12 23:31:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:33,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:33,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:33,766 INFO L87 Difference]: Start difference. First operand 10407 states and 23675 transitions. Second operand 6 states. [2019-01-12 23:31:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:34,071 INFO L93 Difference]: Finished difference Result 11096 states and 24687 transitions. [2019-01-12 23:31:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:34,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:31:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:34,085 INFO L225 Difference]: With dead ends: 11096 [2019-01-12 23:31:34,085 INFO L226 Difference]: Without dead ends: 11056 [2019-01-12 23:31:34,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2019-01-12 23:31:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 9526. [2019-01-12 23:31:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9526 states. [2019-01-12 23:31:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9526 states to 9526 states and 21397 transitions. [2019-01-12 23:31:34,187 INFO L78 Accepts]: Start accepts. Automaton has 9526 states and 21397 transitions. Word has length 94 [2019-01-12 23:31:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:34,187 INFO L480 AbstractCegarLoop]: Abstraction has 9526 states and 21397 transitions. [2019-01-12 23:31:34,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9526 states and 21397 transitions. [2019-01-12 23:31:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:34,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:34,199 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-12 23:31:34,200 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:34,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1472263231, now seen corresponding path program 1 times [2019-01-12 23:31:34,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:34,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:34,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:34,350 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-12 23:31:34,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:34,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:34,351 INFO L87 Difference]: Start difference. First operand 9526 states and 21397 transitions. Second operand 5 states. [2019-01-12 23:31:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:34,828 INFO L93 Difference]: Finished difference Result 11733 states and 26116 transitions. [2019-01-12 23:31:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 23:31:34,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:31:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:34,843 INFO L225 Difference]: With dead ends: 11733 [2019-01-12 23:31:34,843 INFO L226 Difference]: Without dead ends: 11553 [2019-01-12 23:31:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2019-01-12 23:31:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 10359. [2019-01-12 23:31:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-01-12 23:31:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 23191 transitions. [2019-01-12 23:31:34,957 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 23191 transitions. Word has length 94 [2019-01-12 23:31:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:34,957 INFO L480 AbstractCegarLoop]: Abstraction has 10359 states and 23191 transitions. [2019-01-12 23:31:34,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 23191 transitions. [2019-01-12 23:31:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:34,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:34,968 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-12 23:31:34,968 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1759553568, now seen corresponding path program 1 times [2019-01-12 23:31:34,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:34,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:35,286 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-12 23:31:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:35,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:35,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:35,288 INFO L87 Difference]: Start difference. First operand 10359 states and 23191 transitions. Second operand 5 states. [2019-01-12 23:31:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:35,909 INFO L93 Difference]: Finished difference Result 13005 states and 28915 transitions. [2019-01-12 23:31:35,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:31:35,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:31:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:35,930 INFO L225 Difference]: With dead ends: 13005 [2019-01-12 23:31:35,931 INFO L226 Difference]: Without dead ends: 12872 [2019-01-12 23:31:35,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-01-12 23:31:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 10524. [2019-01-12 23:31:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2019-01-12 23:31:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 23529 transitions. [2019-01-12 23:31:36,060 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 23529 transitions. Word has length 94 [2019-01-12 23:31:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:36,061 INFO L480 AbstractCegarLoop]: Abstraction has 10524 states and 23529 transitions. [2019-01-12 23:31:36,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 23529 transitions. [2019-01-12 23:31:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:36,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:36,073 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-12 23:31:36,073 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash -524449204, now seen corresponding path program 1 times [2019-01-12 23:31:36,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:36,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:36,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:36,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:36,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:36,212 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-12 23:31:36,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:36,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 23:31:36,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 23:31:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 23:31:36,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 23:31:36,214 INFO L87 Difference]: Start difference. First operand 10524 states and 23529 transitions. Second operand 5 states. [2019-01-12 23:31:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:36,331 INFO L93 Difference]: Finished difference Result 8563 states and 19163 transitions. [2019-01-12 23:31:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:36,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-12 23:31:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:36,342 INFO L225 Difference]: With dead ends: 8563 [2019-01-12 23:31:36,342 INFO L226 Difference]: Without dead ends: 8563 [2019-01-12 23:31:36,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-01-12 23:31:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6968. [2019-01-12 23:31:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-01-12 23:31:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 15719 transitions. [2019-01-12 23:31:36,425 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 15719 transitions. Word has length 94 [2019-01-12 23:31:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:36,426 INFO L480 AbstractCegarLoop]: Abstraction has 6968 states and 15719 transitions. [2019-01-12 23:31:36,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 23:31:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 15719 transitions. [2019-01-12 23:31:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:36,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:36,434 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-12 23:31:36,434 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1201031693, now seen corresponding path program 2 times [2019-01-12 23:31:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:36,703 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-12 23:31:36,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:36,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:36,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:36,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:36,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:36,704 INFO L87 Difference]: Start difference. First operand 6968 states and 15719 transitions. Second operand 7 states. [2019-01-12 23:31:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:37,129 INFO L93 Difference]: Finished difference Result 8682 states and 19319 transitions. [2019-01-12 23:31:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:31:37,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:31:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:37,142 INFO L225 Difference]: With dead ends: 8682 [2019-01-12 23:31:37,142 INFO L226 Difference]: Without dead ends: 8682 [2019-01-12 23:31:37,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:31:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2019-01-12 23:31:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 7081. [2019-01-12 23:31:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7081 states. [2019-01-12 23:31:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7081 states to 7081 states and 15958 transitions. [2019-01-12 23:31:37,227 INFO L78 Accepts]: Start accepts. Automaton has 7081 states and 15958 transitions. Word has length 94 [2019-01-12 23:31:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:37,227 INFO L480 AbstractCegarLoop]: Abstraction has 7081 states and 15958 transitions. [2019-01-12 23:31:37,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7081 states and 15958 transitions. [2019-01-12 23:31:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:37,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:37,236 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-12 23:31:37,237 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2030785106, now seen corresponding path program 2 times [2019-01-12 23:31:37,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:37,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:37,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:31:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:37,786 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-12 23:31:37,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:37,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:37,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:37,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:37,787 INFO L87 Difference]: Start difference. First operand 7081 states and 15958 transitions. Second operand 7 states. [2019-01-12 23:31:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:38,214 INFO L93 Difference]: Finished difference Result 9946 states and 22406 transitions. [2019-01-12 23:31:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:31:38,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:31:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:38,227 INFO L225 Difference]: With dead ends: 9946 [2019-01-12 23:31:38,228 INFO L226 Difference]: Without dead ends: 9914 [2019-01-12 23:31:38,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:31:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-01-12 23:31:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8741. [2019-01-12 23:31:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2019-01-12 23:31:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 19564 transitions. [2019-01-12 23:31:38,341 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 19564 transitions. Word has length 94 [2019-01-12 23:31:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:38,341 INFO L480 AbstractCegarLoop]: Abstraction has 8741 states and 19564 transitions. [2019-01-12 23:31:38,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 19564 transitions. [2019-01-12 23:31:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:38,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:38,352 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-12 23:31:38,352 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 467230831, now seen corresponding path program 1 times [2019-01-12 23:31:38,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:38,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:38,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 23:31:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:39,011 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-12 23:31:39,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:39,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:31:39,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:31:39,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:31:39,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:39,013 INFO L87 Difference]: Start difference. First operand 8741 states and 19564 transitions. Second operand 8 states. [2019-01-12 23:31:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:39,499 INFO L93 Difference]: Finished difference Result 13745 states and 31428 transitions. [2019-01-12 23:31:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 23:31:39,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-12 23:31:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:39,518 INFO L225 Difference]: With dead ends: 13745 [2019-01-12 23:31:39,518 INFO L226 Difference]: Without dead ends: 13745 [2019-01-12 23:31:39,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:31:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13745 states. [2019-01-12 23:31:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13745 to 9372. [2019-01-12 23:31:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9372 states. [2019-01-12 23:31:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 21224 transitions. [2019-01-12 23:31:39,651 INFO L78 Accepts]: Start accepts. Automaton has 9372 states and 21224 transitions. Word has length 94 [2019-01-12 23:31:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:39,651 INFO L480 AbstractCegarLoop]: Abstraction has 9372 states and 21224 transitions. [2019-01-12 23:31:39,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:31:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 9372 states and 21224 transitions. [2019-01-12 23:31:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:39,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:39,661 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-12 23:31:39,662 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1354734512, now seen corresponding path program 1 times [2019-01-12 23:31:39,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:39,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:39,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:39,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:39,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:39,849 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-12 23:31:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:39,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:39,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:39,851 INFO L87 Difference]: Start difference. First operand 9372 states and 21224 transitions. Second operand 7 states. [2019-01-12 23:31:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:40,020 INFO L93 Difference]: Finished difference Result 12354 states and 28392 transitions. [2019-01-12 23:31:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:40,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-12 23:31:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:40,034 INFO L225 Difference]: With dead ends: 12354 [2019-01-12 23:31:40,034 INFO L226 Difference]: Without dead ends: 12354 [2019-01-12 23:31:40,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:31:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2019-01-12 23:31:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 9024. [2019-01-12 23:31:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9024 states. [2019-01-12 23:31:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 20322 transitions. [2019-01-12 23:31:40,143 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 20322 transitions. Word has length 94 [2019-01-12 23:31:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:40,143 INFO L480 AbstractCegarLoop]: Abstraction has 9024 states and 20322 transitions. [2019-01-12 23:31:40,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 20322 transitions. [2019-01-12 23:31:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 23:31:40,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:40,153 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-12 23:31:40,153 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -377241040, now seen corresponding path program 1 times [2019-01-12 23:31:40,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:40,546 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-12 23:31:40,753 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2019-01-12 23:31:40,765 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-12 23:31:40,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:40,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:40,767 INFO L87 Difference]: Start difference. First operand 9024 states and 20322 transitions. Second operand 6 states. [2019-01-12 23:31:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:40,910 INFO L93 Difference]: Finished difference Result 8544 states and 18834 transitions. [2019-01-12 23:31:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 23:31:40,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-12 23:31:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:40,921 INFO L225 Difference]: With dead ends: 8544 [2019-01-12 23:31:40,922 INFO L226 Difference]: Without dead ends: 8544 [2019-01-12 23:31:40,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2019-01-12 23:31:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 5376. [2019-01-12 23:31:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2019-01-12 23:31:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 11789 transitions. [2019-01-12 23:31:40,992 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 11789 transitions. Word has length 94 [2019-01-12 23:31:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:40,993 INFO L480 AbstractCegarLoop]: Abstraction has 5376 states and 11789 transitions. [2019-01-12 23:31:40,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 11789 transitions. [2019-01-12 23:31:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:40,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:40,999 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-12 23:31:40,999 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1027221993, now seen corresponding path program 1 times [2019-01-12 23:31:41,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:41,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:41,172 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-12 23:31:41,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:41,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 23:31:41,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 23:31:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 23:31:41,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 23:31:41,173 INFO L87 Difference]: Start difference. First operand 5376 states and 11789 transitions. Second operand 10 states. [2019-01-12 23:31:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:42,008 INFO L93 Difference]: Finished difference Result 6760 states and 14701 transitions. [2019-01-12 23:31:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 23:31:42,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-01-12 23:31:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:42,018 INFO L225 Difference]: With dead ends: 6760 [2019-01-12 23:31:42,018 INFO L226 Difference]: Without dead ends: 6760 [2019-01-12 23:31:42,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-01-12 23:31:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-01-12 23:31:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 5755. [2019-01-12 23:31:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5755 states. [2019-01-12 23:31:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 12687 transitions. [2019-01-12 23:31:42,080 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 12687 transitions. Word has length 96 [2019-01-12 23:31:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 5755 states and 12687 transitions. [2019-01-12 23:31:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 23:31:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 12687 transitions. [2019-01-12 23:31:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:42,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:42,087 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-12 23:31:42,087 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1914725674, now seen corresponding path program 1 times [2019-01-12 23:31:42,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:42,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:42,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:42,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:42,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:42,246 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-12 23:31:42,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:42,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 23:31:42,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 23:31:42,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 23:31:42,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 23:31:42,247 INFO L87 Difference]: Start difference. First operand 5755 states and 12687 transitions. Second operand 7 states. [2019-01-12 23:31:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:42,620 INFO L93 Difference]: Finished difference Result 6930 states and 15120 transitions. [2019-01-12 23:31:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 23:31:42,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-12 23:31:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:42,630 INFO L225 Difference]: With dead ends: 6930 [2019-01-12 23:31:42,630 INFO L226 Difference]: Without dead ends: 6930 [2019-01-12 23:31:42,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:31:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2019-01-12 23:31:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 5800. [2019-01-12 23:31:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5800 states. [2019-01-12 23:31:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5800 states to 5800 states and 12778 transitions. [2019-01-12 23:31:42,690 INFO L78 Accepts]: Start accepts. Automaton has 5800 states and 12778 transitions. Word has length 96 [2019-01-12 23:31:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:42,690 INFO L480 AbstractCegarLoop]: Abstraction has 5800 states and 12778 transitions. [2019-01-12 23:31:42,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 23:31:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5800 states and 12778 transitions. [2019-01-12 23:31:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:42,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:42,696 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-12 23:31:42,697 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2019-01-12 23:31:42,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:42,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:42,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:42,877 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-12 23:31:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:42,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 23:31:42,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 23:31:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 23:31:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:42,878 INFO L87 Difference]: Start difference. First operand 5800 states and 12778 transitions. Second operand 8 states. [2019-01-12 23:31:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:43,285 INFO L93 Difference]: Finished difference Result 6810 states and 14881 transitions. [2019-01-12 23:31:43,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 23:31:43,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-12 23:31:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:43,297 INFO L225 Difference]: With dead ends: 6810 [2019-01-12 23:31:43,297 INFO L226 Difference]: Without dead ends: 6810 [2019-01-12 23:31:43,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-12 23:31:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2019-01-12 23:31:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6420. [2019-01-12 23:31:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6420 states. [2019-01-12 23:31:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 14014 transitions. [2019-01-12 23:31:43,375 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 14014 transitions. Word has length 96 [2019-01-12 23:31:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:43,376 INFO L480 AbstractCegarLoop]: Abstraction has 6420 states and 14014 transitions. [2019-01-12 23:31:43,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 23:31:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 14014 transitions. [2019-01-12 23:31:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:43,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:43,384 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-12 23:31:43,384 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:43,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2019-01-12 23:31:43,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:43,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:43,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:43,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:43,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:43,609 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 23:31:43,705 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-12 23:31:43,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:43,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 23:31:43,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 23:31:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 23:31:43,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-12 23:31:43,706 INFO L87 Difference]: Start difference. First operand 6420 states and 14014 transitions. Second operand 11 states. [2019-01-12 23:31:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:45,369 INFO L93 Difference]: Finished difference Result 11999 states and 26445 transitions. [2019-01-12 23:31:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 23:31:45,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-12 23:31:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:45,379 INFO L225 Difference]: With dead ends: 11999 [2019-01-12 23:31:45,379 INFO L226 Difference]: Without dead ends: 7701 [2019-01-12 23:31:45,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-12 23:31:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2019-01-12 23:31:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 5784. [2019-01-12 23:31:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-01-12 23:31:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 12637 transitions. [2019-01-12 23:31:45,445 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 12637 transitions. Word has length 96 [2019-01-12 23:31:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:45,446 INFO L480 AbstractCegarLoop]: Abstraction has 5784 states and 12637 transitions. [2019-01-12 23:31:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 23:31:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 12637 transitions. [2019-01-12 23:31:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:45,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:45,453 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-12 23:31:45,453 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 397601140, now seen corresponding path program 1 times [2019-01-12 23:31:45,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 23:31:45,712 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 23:31:46,073 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-12 23:31:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 23:31:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 23:31:46,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 23:31:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 23:31:46,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 23:31:46,075 INFO L87 Difference]: Start difference. First operand 5784 states and 12637 transitions. Second operand 6 states. [2019-01-12 23:31:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 23:31:46,525 INFO L93 Difference]: Finished difference Result 6561 states and 14352 transitions. [2019-01-12 23:31:46,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 23:31:46,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-12 23:31:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 23:31:46,534 INFO L225 Difference]: With dead ends: 6561 [2019-01-12 23:31:46,534 INFO L226 Difference]: Without dead ends: 6561 [2019-01-12 23:31:46,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 23:31:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6561 states. [2019-01-12 23:31:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6561 to 5967. [2019-01-12 23:31:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5967 states. [2019-01-12 23:31:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5967 states to 5967 states and 13034 transitions. [2019-01-12 23:31:46,595 INFO L78 Accepts]: Start accepts. Automaton has 5967 states and 13034 transitions. Word has length 96 [2019-01-12 23:31:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 23:31:46,596 INFO L480 AbstractCegarLoop]: Abstraction has 5967 states and 13034 transitions. [2019-01-12 23:31:46,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 23:31:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5967 states and 13034 transitions. [2019-01-12 23:31:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 23:31:46,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 23:31:46,602 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-12 23:31:46,602 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 23:31:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 23:31:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2019-01-12 23:31:46,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 23:31:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 23:31:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:46,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 23:31:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 23:31:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:31:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 23:31:46,683 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 23:31:46,881 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-12 23:31:46,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:31:46 BasicIcfg [2019-01-12 23:31:46,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 23:31:46,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 23:31:46,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 23:31:46,884 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 23:31:46,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:30:43" (3/4) ... [2019-01-12 23:31:46,890 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 23:31:47,061 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 23:31:47,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 23:31:47,063 INFO L168 Benchmark]: Toolchain (without parser) took 66180.22 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 952.7 MB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 352.9 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,063 INFO L168 Benchmark]: CDTParser took 0.15 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-12 23:31:47,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,064 INFO L168 Benchmark]: Boogie Preprocessor took 61.27 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-12 23:31:47,065 INFO L168 Benchmark]: RCFGBuilder took 1278.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,069 INFO L168 Benchmark]: TraceAbstraction took 63714.52 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,070 INFO L168 Benchmark]: Witness Printer took 177.86 ms. Allocated memory is still 4.9 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-01-12 23:31:47,074 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.15 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 880.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.27 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 1278.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63714.52 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. * Witness Printer took 177.86 ms. Allocated memory is still 4.9 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t319; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t319, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t320; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t320, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 63.5s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10917 SDtfs, 12880 SDslu, 26336 SDs, 0 SdLazy, 12246 SolverSat, 758 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 107 SyntacticMatches, 37 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 18.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 186730 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3049 NumberOfCodeBlocks, 3049 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2914 ConstructedInterpolants, 0 QuantifiedInterpolants, 663187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...