./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer --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 e4336846228c37865706e98397140a73ec7d90c3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-11-15 23:55:02,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:02,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:02,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:02,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:02,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:02,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:02,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:02,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:02,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:02,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:02,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:02,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:02,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:02,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:02,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:02,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:02,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:02,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:02,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:03,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:03,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:03,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:03,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:03,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:03,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:03,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:03,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:03,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:03,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:03,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:03,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:03,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:03,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:03,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:03,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:03,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:03,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:03,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:03,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:03,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:03,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:55:03,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:03,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:03,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:03,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:03,031 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:03,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:03,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:03,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:03,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:03,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:03,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:55:03,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:55:03,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:55:03,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:03,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:03,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:03,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:55:03,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:03,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:03,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:55:03,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:55:03,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:55:03,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:03,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:55:03,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:55:03,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:03,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:55:03,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:55:03,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer 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 -> e4336846228c37865706e98397140a73ec7d90c3 [2019-11-15 23:55:03,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:03,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:03,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:03,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:03,095 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:03,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-11-15 23:55:03,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/data/fc035969b/249589e742b84341908d8f789c07241e/FLAGde819b327 [2019-11-15 23:55:03,731 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:03,731 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/sv-benchmarks/c/pthread-wmm/mix009_rmo.oepc.i [2019-11-15 23:55:03,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/data/fc035969b/249589e742b84341908d8f789c07241e/FLAGde819b327 [2019-11-15 23:55:04,167 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/data/fc035969b/249589e742b84341908d8f789c07241e [2019-11-15 23:55:04,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:04,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:04,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:04,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:04,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:04,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582e0139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04, skipping insertion in model container [2019-11-15 23:55:04,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:04,252 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:04,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:04,736 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:04,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:04,902 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:04,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04 WrapperNode [2019-11-15 23:55:04,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:04,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:04,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:04,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:04,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:04,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:04,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:04,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:04,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:04,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... [2019-11-15 23:55:05,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:05,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:05,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:05,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:05,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/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-11-15 23:55:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:55:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:55:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:55:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:55:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:55:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:55:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:55:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:55:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:55:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:05,093 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:55:05,753 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:05,753 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:55:05,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:05 BoogieIcfgContainer [2019-11-15 23:55:05,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:05,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:55:05,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:55:05,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:55:05,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:55:04" (1/3) ... [2019-11-15 23:55:05,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9f30d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:05, skipping insertion in model container [2019-11-15 23:55:05,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:04" (2/3) ... [2019-11-15 23:55:05,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9f30d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:05, skipping insertion in model container [2019-11-15 23:55:05,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:05" (3/3) ... [2019-11-15 23:55:05,765 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc.i [2019-11-15 23:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,824 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,824 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,825 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,825 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,825 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,826 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,826 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,826 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,826 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,827 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,827 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,827 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,827 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,828 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,828 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,828 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,828 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,829 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,830 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,831 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,832 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,832 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,834 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,834 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,848 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,849 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,850 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,851 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,852 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,852 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,852 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,853 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,853 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,860 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,860 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:55:05,873 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:55:05,873 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:55:05,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:55:05,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:55:05,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:55:05,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:55:05,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:55:05,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:05,917 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:05,917 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:55:05,917 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:05,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:55:05,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143 places, 181 transitions [2019-11-15 23:55:08,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-11-15 23:55:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-11-15 23:55:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:55:08,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:08,590 INFO L380 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] [2019-11-15 23:55:08,592 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1224986376, now seen corresponding path program 1 times [2019-11-15 23:55:08,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:08,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679662016] [2019-11-15 23:55:08,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:08,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:08,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679662016] [2019-11-15 23:55:08,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:08,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:08,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381821538] [2019-11-15 23:55:08,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:08,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:08,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:08,890 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-11-15 23:55:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:09,909 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-11-15 23:55:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:09,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 23:55:09,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:10,195 INFO L225 Difference]: With dead ends: 33593 [2019-11-15 23:55:10,195 INFO L226 Difference]: Without dead ends: 25705 [2019-11-15 23:55:10,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-11-15 23:55:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-11-15 23:55:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-11-15 23:55:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-11-15 23:55:11,768 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-11-15 23:55:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:11,770 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-11-15 23:55:11,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-11-15 23:55:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:55:11,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:11,792 INFO L380 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] [2019-11-15 23:55:11,792 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -739593163, now seen corresponding path program 1 times [2019-11-15 23:55:11,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:11,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555852071] [2019-11-15 23:55:11,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:11,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:11,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:11,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555852071] [2019-11-15 23:55:11,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:11,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:11,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939548449] [2019-11-15 23:55:11,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:11,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:11,960 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-11-15 23:55:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:13,412 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-11-15 23:55:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:13,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:55:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:13,596 INFO L225 Difference]: With dead ends: 41083 [2019-11-15 23:55:13,596 INFO L226 Difference]: Without dead ends: 40547 [2019-11-15 23:55:13,597 INFO L600 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-11-15 23:55:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-11-15 23:55:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-11-15 23:55:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-11-15 23:55:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-11-15 23:55:15,351 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-11-15 23:55:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:15,353 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-11-15 23:55:15,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-11-15 23:55:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:55:15,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:15,360 INFO L380 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-11-15 23:55:15,360 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash 919931139, now seen corresponding path program 1 times [2019-11-15 23:55:15,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:15,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470974106] [2019-11-15 23:55:15,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:15,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470974106] [2019-11-15 23:55:15,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:15,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:15,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809475617] [2019-11-15 23:55:15,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:15,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:15,489 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-11-15 23:55:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,107 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-11-15 23:55:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:16,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 23:55:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,347 INFO L225 Difference]: With dead ends: 49780 [2019-11-15 23:55:16,347 INFO L226 Difference]: Without dead ends: 49276 [2019-11-15 23:55:16,348 INFO L600 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-11-15 23:55:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-11-15 23:55:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-11-15 23:55:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-11-15 23:55:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-11-15 23:55:18,220 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-11-15 23:55:18,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:18,220 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-11-15 23:55:18,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-11-15 23:55:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:55:18,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:18,231 INFO L380 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] [2019-11-15 23:55:18,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash 261792169, now seen corresponding path program 1 times [2019-11-15 23:55:18,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:18,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862837617] [2019-11-15 23:55:18,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:18,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:18,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862837617] [2019-11-15 23:55:18,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:18,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:18,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989554748] [2019-11-15 23:55:18,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:18,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:18,278 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-11-15 23:55:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:18,586 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-11-15 23:55:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:18,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-15 23:55:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:18,770 INFO L225 Difference]: With dead ends: 61089 [2019-11-15 23:55:18,770 INFO L226 Difference]: Without dead ends: 61089 [2019-11-15 23:55:18,771 INFO L600 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-11-15 23:55:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-11-15 23:55:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-11-15 23:55:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-11-15 23:55:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-11-15 23:55:20,755 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-11-15 23:55:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:20,755 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-11-15 23:55:20,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-11-15 23:55:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:55:20,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:20,772 INFO L380 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] [2019-11-15 23:55:20,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1705100553, now seen corresponding path program 1 times [2019-11-15 23:55:20,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:20,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285853513] [2019-11-15 23:55:20,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:20,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:20,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:20,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285853513] [2019-11-15 23:55:20,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:20,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:20,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774067503] [2019-11-15 23:55:20,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:20,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:20,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:20,887 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-11-15 23:55:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:21,802 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-11-15 23:55:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:21,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 23:55:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:21,947 INFO L225 Difference]: With dead ends: 63758 [2019-11-15 23:55:21,947 INFO L226 Difference]: Without dead ends: 63758 [2019-11-15 23:55:21,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:55:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-11-15 23:55:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-11-15 23:55:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-11-15 23:55:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-11-15 23:55:24,109 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-11-15 23:55:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:24,110 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-11-15 23:55:24,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-11-15 23:55:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:55:24,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:24,130 INFO L380 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] [2019-11-15 23:55:24,131 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash 792915384, now seen corresponding path program 1 times [2019-11-15 23:55:24,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:24,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036724432] [2019-11-15 23:55:24,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:24,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:24,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036724432] [2019-11-15 23:55:24,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:24,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:55:24,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46742827] [2019-11-15 23:55:24,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:24,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:24,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:24,239 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-11-15 23:55:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:25,592 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-11-15 23:55:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:55:25,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-15 23:55:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:25,775 INFO L225 Difference]: With dead ends: 83687 [2019-11-15 23:55:25,776 INFO L226 Difference]: Without dead ends: 83687 [2019-11-15 23:55:25,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-11-15 23:55:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-11-15 23:55:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-11-15 23:55:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-11-15 23:55:31,286 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-11-15 23:55:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:31,286 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-11-15 23:55:31,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-11-15 23:55:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:55:31,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:31,304 INFO L380 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] [2019-11-15 23:55:31,305 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1680419065, now seen corresponding path program 1 times [2019-11-15 23:55:31,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:31,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262909456] [2019-11-15 23:55:31,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:31,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262909456] [2019-11-15 23:55:31,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:31,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:31,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736526695] [2019-11-15 23:55:31,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:31,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:31,388 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-11-15 23:55:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:31,470 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-11-15 23:55:31,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:31,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 23:55:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:31,494 INFO L225 Difference]: With dead ends: 12161 [2019-11-15 23:55:31,494 INFO L226 Difference]: Without dead ends: 10676 [2019-11-15 23:55:31,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-11-15 23:55:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-11-15 23:55:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-11-15 23:55:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-11-15 23:55:31,687 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-11-15 23:55:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:31,687 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-11-15 23:55:31,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-11-15 23:55:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:55:31,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:31,689 INFO L380 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] [2019-11-15 23:55:31,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash 200257268, now seen corresponding path program 1 times [2019-11-15 23:55:31,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:31,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58258505] [2019-11-15 23:55:31,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:31,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58258505] [2019-11-15 23:55:31,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:31,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:31,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004039211] [2019-11-15 23:55:31,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:31,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:31,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:31,779 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-11-15 23:55:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:32,323 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-11-15 23:55:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:55:32,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 23:55:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:32,345 INFO L225 Difference]: With dead ends: 13184 [2019-11-15 23:55:32,345 INFO L226 Difference]: Without dead ends: 13121 [2019-11-15 23:55:32,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:55:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-11-15 23:55:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-11-15 23:55:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-11-15 23:55:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-11-15 23:55:32,560 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-11-15 23:55:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:32,560 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-11-15 23:55:32,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-11-15 23:55:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:55:32,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:32,564 INFO L380 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] [2019-11-15 23:55:32,564 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1281020880, now seen corresponding path program 1 times [2019-11-15 23:55:32,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:32,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669256271] [2019-11-15 23:55:32,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:32,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:32,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669256271] [2019-11-15 23:55:32,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:32,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:32,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584097327] [2019-11-15 23:55:32,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:32,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:32,630 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-11-15 23:55:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:32,821 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-11-15 23:55:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:32,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 23:55:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:32,849 INFO L225 Difference]: With dead ends: 12864 [2019-11-15 23:55:32,849 INFO L226 Difference]: Without dead ends: 12864 [2019-11-15 23:55:32,850 INFO L600 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-11-15 23:55:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-11-15 23:55:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-11-15 23:55:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-11-15 23:55:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-11-15 23:55:33,052 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-11-15 23:55:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:33,052 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-11-15 23:55:33,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-11-15 23:55:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:55:33,056 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:33,056 INFO L380 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] [2019-11-15 23:55:33,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1271136081, now seen corresponding path program 1 times [2019-11-15 23:55:33,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:33,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345114161] [2019-11-15 23:55:33,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:33,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:33,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:33,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345114161] [2019-11-15 23:55:33,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:33,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:33,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586179281] [2019-11-15 23:55:33,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:33,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:33,159 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-11-15 23:55:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:33,638 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-11-15 23:55:33,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:55:33,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-15 23:55:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:33,659 INFO L225 Difference]: With dead ends: 14221 [2019-11-15 23:55:33,659 INFO L226 Difference]: Without dead ends: 14160 [2019-11-15 23:55:33,660 INFO L600 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-11-15 23:55:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-11-15 23:55:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-11-15 23:55:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-11-15 23:55:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-11-15 23:55:34,425 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-11-15 23:55:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:34,426 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-11-15 23:55:34,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-11-15 23:55:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:55:34,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:34,432 INFO L380 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-11-15 23:55:34,432 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:34,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash -818987422, now seen corresponding path program 1 times [2019-11-15 23:55:34,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:34,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737170151] [2019-11-15 23:55:34,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:34,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:34,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:34,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737170151] [2019-11-15 23:55:34,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:34,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:34,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305466785] [2019-11-15 23:55:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:34,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:34,496 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 3 states. [2019-11-15 23:55:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:34,740 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-11-15 23:55:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:34,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:55:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:34,761 INFO L225 Difference]: With dead ends: 14051 [2019-11-15 23:55:34,761 INFO L226 Difference]: Without dead ends: 14051 [2019-11-15 23:55:34,762 INFO L600 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-11-15 23:55:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-11-15 23:55:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-11-15 23:55:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-11-15 23:55:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-11-15 23:55:34,962 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-11-15 23:55:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:34,962 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-11-15 23:55:34,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-11-15 23:55:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:55:34,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:34,969 INFO L380 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-11-15 23:55:34,969 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1258221921, now seen corresponding path program 1 times [2019-11-15 23:55:34,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:34,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342463740] [2019-11-15 23:55:34,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:34,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:34,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:35,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342463740] [2019-11-15 23:55:35,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:35,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:35,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168295552] [2019-11-15 23:55:35,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:35,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:35,039 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 4 states. [2019-11-15 23:55:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:35,471 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-11-15 23:55:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:35,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 23:55:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:35,496 INFO L225 Difference]: With dead ends: 16799 [2019-11-15 23:55:35,496 INFO L226 Difference]: Without dead ends: 16799 [2019-11-15 23:55:35,496 INFO L600 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-11-15 23:55:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-11-15 23:55:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-11-15 23:55:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-11-15 23:55:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-11-15 23:55:35,731 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-11-15 23:55:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:35,731 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-11-15 23:55:35,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-11-15 23:55:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:35,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:35,741 INFO L380 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] [2019-11-15 23:55:35,741 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1009468776, now seen corresponding path program 1 times [2019-11-15 23:55:35,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:35,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407156319] [2019-11-15 23:55:35,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:35,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:35,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:35,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407156319] [2019-11-15 23:55:35,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:35,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:35,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044232670] [2019-11-15 23:55:35,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:35,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:35,883 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 6 states. [2019-11-15 23:55:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:36,521 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-11-15 23:55:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:36,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-15 23:55:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:36,543 INFO L225 Difference]: With dead ends: 16275 [2019-11-15 23:55:36,544 INFO L226 Difference]: Without dead ends: 16275 [2019-11-15 23:55:36,544 INFO L600 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-11-15 23:55:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-11-15 23:55:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-11-15 23:55:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-11-15 23:55:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-11-15 23:55:36,770 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-11-15 23:55:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:36,770 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-11-15 23:55:36,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-11-15 23:55:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:36,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:36,781 INFO L380 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] [2019-11-15 23:55:36,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:36,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1208289177, now seen corresponding path program 1 times [2019-11-15 23:55:36,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:36,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712382499] [2019-11-15 23:55:36,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:36,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:36,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712382499] [2019-11-15 23:55:36,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:36,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:36,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100877493] [2019-11-15 23:55:36,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:36,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:36,898 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 6 states. [2019-11-15 23:55:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:37,556 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-11-15 23:55:37,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:55:37,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-15 23:55:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:37,582 INFO L225 Difference]: With dead ends: 18162 [2019-11-15 23:55:37,582 INFO L226 Difference]: Without dead ends: 18162 [2019-11-15 23:55:37,582 INFO L600 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-11-15 23:55:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-11-15 23:55:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-11-15 23:55:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-11-15 23:55:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-11-15 23:55:37,822 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-11-15 23:55:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:37,823 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-11-15 23:55:37,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-11-15 23:55:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:37,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:37,835 INFO L380 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] [2019-11-15 23:55:37,835 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1419640090, now seen corresponding path program 1 times [2019-11-15 23:55:37,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:37,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940108915] [2019-11-15 23:55:37,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:37,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:37,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:37,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940108915] [2019-11-15 23:55:37,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:37,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:37,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407040806] [2019-11-15 23:55:37,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:37,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:37,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:37,919 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 5 states. [2019-11-15 23:55:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:38,317 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-11-15 23:55:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:55:38,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 23:55:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:38,347 INFO L225 Difference]: With dead ends: 21457 [2019-11-15 23:55:38,347 INFO L226 Difference]: Without dead ends: 21457 [2019-11-15 23:55:38,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-15 23:55:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-11-15 23:55:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-11-15 23:55:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-11-15 23:55:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-11-15 23:55:38,636 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-11-15 23:55:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-11-15 23:55:38,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-11-15 23:55:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:38,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:38,649 INFO L380 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] [2019-11-15 23:55:38,649 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 909105913, now seen corresponding path program 1 times [2019-11-15 23:55:38,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:38,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252843573] [2019-11-15 23:55:38,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:38,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252843573] [2019-11-15 23:55:38,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:38,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:38,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614527862] [2019-11-15 23:55:38,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:38,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:38,733 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 5 states. [2019-11-15 23:55:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:39,377 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-11-15 23:55:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:39,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 23:55:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:39,417 INFO L225 Difference]: With dead ends: 26409 [2019-11-15 23:55:39,417 INFO L226 Difference]: Without dead ends: 26409 [2019-11-15 23:55:39,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:55:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-11-15 23:55:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-11-15 23:55:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-11-15 23:55:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-11-15 23:55:39,793 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-11-15 23:55:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:39,793 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-11-15 23:55:39,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-11-15 23:55:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:39,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:39,809 INFO L380 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] [2019-11-15 23:55:39,809 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -898348550, now seen corresponding path program 1 times [2019-11-15 23:55:39,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:39,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437916991] [2019-11-15 23:55:39,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:39,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:39,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:39,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437916991] [2019-11-15 23:55:39,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:39,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:39,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783221655] [2019-11-15 23:55:39,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:39,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:39,883 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-11-15 23:55:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:40,542 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-11-15 23:55:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:40,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 23:55:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:40,585 INFO L225 Difference]: With dead ends: 27971 [2019-11-15 23:55:40,585 INFO L226 Difference]: Without dead ends: 27836 [2019-11-15 23:55:40,586 INFO L600 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-11-15 23:55:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-11-15 23:55:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-11-15 23:55:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-11-15 23:55:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-11-15 23:55:41,441 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-11-15 23:55:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:41,442 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-11-15 23:55:41,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-11-15 23:55:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:41,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:41,452 INFO L380 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] [2019-11-15 23:55:41,452 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1599667387, now seen corresponding path program 1 times [2019-11-15 23:55:41,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:41,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752725130] [2019-11-15 23:55:41,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:41,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:41,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:41,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752725130] [2019-11-15 23:55:41,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:41,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:55:41,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767386943] [2019-11-15 23:55:41,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:41,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:41,630 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 7 states. [2019-11-15 23:55:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:42,185 INFO L93 Difference]: Finished difference Result 23115 states and 64212 transitions. [2019-11-15 23:55:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:55:42,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-11-15 23:55:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:42,215 INFO L225 Difference]: With dead ends: 23115 [2019-11-15 23:55:42,215 INFO L226 Difference]: Without dead ends: 23115 [2019-11-15 23:55:42,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:55:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2019-11-15 23:55:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 18811. [2019-11-15 23:55:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2019-11-15 23:55:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52247 transitions. [2019-11-15 23:55:42,496 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52247 transitions. Word has length 69 [2019-11-15 23:55:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:42,496 INFO L462 AbstractCegarLoop]: Abstraction has 18811 states and 52247 transitions. [2019-11-15 23:55:42,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52247 transitions. [2019-11-15 23:55:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:42,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:42,504 INFO L380 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] [2019-11-15 23:55:42,505 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1807796228, now seen corresponding path program 1 times [2019-11-15 23:55:42,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:42,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845579838] [2019-11-15 23:55:42,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:42,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845579838] [2019-11-15 23:55:42,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:42,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:42,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423369445] [2019-11-15 23:55:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:42,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:42,595 INFO L87 Difference]: Start difference. First operand 18811 states and 52247 transitions. Second operand 5 states. [2019-11-15 23:55:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:42,649 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-11-15 23:55:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:55:42,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-15 23:55:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:42,655 INFO L225 Difference]: With dead ends: 6133 [2019-11-15 23:55:42,655 INFO L226 Difference]: Without dead ends: 5263 [2019-11-15 23:55:42,656 INFO L600 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-11-15 23:55:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-11-15 23:55:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-11-15 23:55:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-11-15 23:55:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-11-15 23:55:42,710 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-11-15 23:55:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:42,710 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-11-15 23:55:42,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-11-15 23:55:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:55:42,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:42,714 INFO L380 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] [2019-11-15 23:55:42,714 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1763644192, now seen corresponding path program 1 times [2019-11-15 23:55:42,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:42,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076275802] [2019-11-15 23:55:42,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:42,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076275802] [2019-11-15 23:55:42,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:42,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:42,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764145837] [2019-11-15 23:55:42,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:42,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:42,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:42,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:42,760 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-11-15 23:55:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:42,802 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-11-15 23:55:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:42,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-15 23:55:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:42,810 INFO L225 Difference]: With dead ends: 5858 [2019-11-15 23:55:42,811 INFO L226 Difference]: Without dead ends: 5858 [2019-11-15 23:55:42,811 INFO L600 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-11-15 23:55:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-11-15 23:55:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-11-15 23:55:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-11-15 23:55:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-11-15 23:55:42,889 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-11-15 23:55:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:42,889 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-11-15 23:55:42,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-11-15 23:55:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:55:42,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:42,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:42,896 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1221048589, now seen corresponding path program 1 times [2019-11-15 23:55:42,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:42,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145550502] [2019-11-15 23:55:42,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:42,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:42,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145550502] [2019-11-15 23:55:42,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:42,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:42,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105050824] [2019-11-15 23:55:42,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:43,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:43,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:43,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:43,001 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-11-15 23:55:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:43,170 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-11-15 23:55:43,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:55:43,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-15 23:55:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:43,175 INFO L225 Difference]: With dead ends: 5724 [2019-11-15 23:55:43,175 INFO L226 Difference]: Without dead ends: 5724 [2019-11-15 23:55:43,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-11-15 23:55:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-11-15 23:55:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-11-15 23:55:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-11-15 23:55:43,232 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-11-15 23:55:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:43,232 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-11-15 23:55:43,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-11-15 23:55:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:55:43,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:43,237 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:43,238 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 521761746, now seen corresponding path program 1 times [2019-11-15 23:55:43,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:43,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663205954] [2019-11-15 23:55:43,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:43,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663205954] [2019-11-15 23:55:43,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:43,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:55:43,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473396243] [2019-11-15 23:55:43,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:43,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:43,327 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-11-15 23:55:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:43,780 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-11-15 23:55:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:55:43,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-11-15 23:55:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:43,785 INFO L225 Difference]: With dead ends: 5823 [2019-11-15 23:55:43,786 INFO L226 Difference]: Without dead ends: 5770 [2019-11-15 23:55:43,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:55:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-11-15 23:55:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-11-15 23:55:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-11-15 23:55:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-11-15 23:55:43,845 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-11-15 23:55:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:43,846 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-11-15 23:55:43,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-11-15 23:55:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:55:43,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:43,851 INFO L380 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-11-15 23:55:43,851 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1512586684, now seen corresponding path program 1 times [2019-11-15 23:55:43,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:43,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613924579] [2019-11-15 23:55:43,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:43,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613924579] [2019-11-15 23:55:43,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:43,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:43,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273143492] [2019-11-15 23:55:43,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:43,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:43,945 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 5 states. [2019-11-15 23:55:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:44,333 INFO L93 Difference]: Finished difference Result 4679 states and 10281 transitions. [2019-11-15 23:55:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:55:44,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-15 23:55:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:44,339 INFO L225 Difference]: With dead ends: 4679 [2019-11-15 23:55:44,339 INFO L226 Difference]: Without dead ends: 4679 [2019-11-15 23:55:44,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2019-11-15 23:55:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4257. [2019-11-15 23:55:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4257 states. [2019-11-15 23:55:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 9317 transitions. [2019-11-15 23:55:44,387 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 9317 transitions. Word has length 96 [2019-11-15 23:55:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:44,388 INFO L462 AbstractCegarLoop]: Abstraction has 4257 states and 9317 transitions. [2019-11-15 23:55:44,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 9317 transitions. [2019-11-15 23:55:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:55:44,392 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:44,393 INFO L380 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-11-15 23:55:44,393 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:44,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742303, now seen corresponding path program 1 times [2019-11-15 23:55:44,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:44,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410570898] [2019-11-15 23:55:44,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:44,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410570898] [2019-11-15 23:55:44,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:44,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:44,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922225958] [2019-11-15 23:55:44,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:44,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:44,471 INFO L87 Difference]: Start difference. First operand 4257 states and 9317 transitions. Second operand 4 states. [2019-11-15 23:55:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:44,577 INFO L93 Difference]: Finished difference Result 5241 states and 11450 transitions. [2019-11-15 23:55:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:44,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:55:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:44,581 INFO L225 Difference]: With dead ends: 5241 [2019-11-15 23:55:44,581 INFO L226 Difference]: Without dead ends: 5241 [2019-11-15 23:55:44,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5241 states. [2019-11-15 23:55:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5241 to 4568. [2019-11-15 23:55:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4568 states. [2019-11-15 23:55:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 10013 transitions. [2019-11-15 23:55:44,635 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 10013 transitions. Word has length 96 [2019-11-15 23:55:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:44,635 INFO L462 AbstractCegarLoop]: Abstraction has 4568 states and 10013 transitions. [2019-11-15 23:55:44,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 10013 transitions. [2019-11-15 23:55:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:44,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:44,640 INFO L380 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, 1, 1] [2019-11-15 23:55:44,640 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1749984676, now seen corresponding path program 1 times [2019-11-15 23:55:44,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:44,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407809741] [2019-11-15 23:55:44,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:44,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407809741] [2019-11-15 23:55:44,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:44,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:55:44,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084586909] [2019-11-15 23:55:44,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:55:44,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:44,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:55:44,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:55:44,722 INFO L87 Difference]: Start difference. First operand 4568 states and 10013 transitions. Second operand 5 states. [2019-11-15 23:55:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:44,883 INFO L93 Difference]: Finished difference Result 5253 states and 11535 transitions. [2019-11-15 23:55:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:55:44,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 23:55:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:44,890 INFO L225 Difference]: With dead ends: 5253 [2019-11-15 23:55:44,890 INFO L226 Difference]: Without dead ends: 5253 [2019-11-15 23:55:44,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2019-11-15 23:55:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4124. [2019-11-15 23:55:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-11-15 23:55:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 9024 transitions. [2019-11-15 23:55:44,958 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 9024 transitions. Word has length 98 [2019-11-15 23:55:44,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:44,959 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 9024 transitions. [2019-11-15 23:55:44,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:55:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 9024 transitions. [2019-11-15 23:55:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:44,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:44,966 INFO L380 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, 1, 1] [2019-11-15 23:55:44,966 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -912178621, now seen corresponding path program 1 times [2019-11-15 23:55:44,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:44,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158284124] [2019-11-15 23:55:44,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:44,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:45,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158284124] [2019-11-15 23:55:45,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:45,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:55:45,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766994993] [2019-11-15 23:55:45,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:45,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:45,156 INFO L87 Difference]: Start difference. First operand 4124 states and 9024 transitions. Second operand 7 states. [2019-11-15 23:55:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:45,516 INFO L93 Difference]: Finished difference Result 5493 states and 11957 transitions. [2019-11-15 23:55:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:55:45,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-15 23:55:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:45,522 INFO L225 Difference]: With dead ends: 5493 [2019-11-15 23:55:45,522 INFO L226 Difference]: Without dead ends: 5447 [2019-11-15 23:55:45,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2019-11-15 23:55:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 4537. [2019-11-15 23:55:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-11-15 23:55:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 9883 transitions. [2019-11-15 23:55:45,575 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 9883 transitions. Word has length 98 [2019-11-15 23:55:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:45,576 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 9883 transitions. [2019-11-15 23:55:45,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 9883 transitions. [2019-11-15 23:55:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:45,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:45,581 INFO L380 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, 1, 1] [2019-11-15 23:55:45,581 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1651849282, now seen corresponding path program 1 times [2019-11-15 23:55:45,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:45,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711109834] [2019-11-15 23:55:45,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:45,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:45,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:45,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711109834] [2019-11-15 23:55:45,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:45,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:45,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614648599] [2019-11-15 23:55:45,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:45,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:45,694 INFO L87 Difference]: Start difference. First operand 4537 states and 9883 transitions. Second operand 6 states. [2019-11-15 23:55:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:46,020 INFO L93 Difference]: Finished difference Result 5078 states and 11081 transitions. [2019-11-15 23:55:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:46,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 23:55:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:46,025 INFO L225 Difference]: With dead ends: 5078 [2019-11-15 23:55:46,025 INFO L226 Difference]: Without dead ends: 5078 [2019-11-15 23:55:46,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:55:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-11-15 23:55:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 4753. [2019-11-15 23:55:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2019-11-15 23:55:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 10359 transitions. [2019-11-15 23:55:46,077 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 10359 transitions. Word has length 98 [2019-11-15 23:55:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:46,077 INFO L462 AbstractCegarLoop]: Abstraction has 4753 states and 10359 transitions. [2019-11-15 23:55:46,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 10359 transitions. [2019-11-15 23:55:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:46,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:46,083 INFO L380 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, 1, 1] [2019-11-15 23:55:46,083 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 278839715, now seen corresponding path program 1 times [2019-11-15 23:55:46,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:46,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937482154] [2019-11-15 23:55:46,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:46,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:46,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:46,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937482154] [2019-11-15 23:55:46,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:46,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:46,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135711572] [2019-11-15 23:55:46,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:46,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:46,240 INFO L87 Difference]: Start difference. First operand 4753 states and 10359 transitions. Second operand 6 states. [2019-11-15 23:55:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:46,798 INFO L93 Difference]: Finished difference Result 6469 states and 13998 transitions. [2019-11-15 23:55:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:55:46,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 23:55:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:46,807 INFO L225 Difference]: With dead ends: 6469 [2019-11-15 23:55:46,807 INFO L226 Difference]: Without dead ends: 6455 [2019-11-15 23:55:46,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-11-15 23:55:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5136. [2019-11-15 23:55:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5136 states. [2019-11-15 23:55:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 11302 transitions. [2019-11-15 23:55:46,894 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 11302 transitions. Word has length 98 [2019-11-15 23:55:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:46,894 INFO L462 AbstractCegarLoop]: Abstraction has 5136 states and 11302 transitions. [2019-11-15 23:55:46,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 11302 transitions. [2019-11-15 23:55:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:46,901 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:46,901 INFO L380 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, 1, 1] [2019-11-15 23:55:46,902 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:46,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash 490190628, now seen corresponding path program 1 times [2019-11-15 23:55:46,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:46,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518562248] [2019-11-15 23:55:46,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:46,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:46,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:47,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518562248] [2019-11-15 23:55:47,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:47,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:55:47,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669467117] [2019-11-15 23:55:47,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:47,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:47,060 INFO L87 Difference]: Start difference. First operand 5136 states and 11302 transitions. Second operand 6 states. [2019-11-15 23:55:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:47,342 INFO L93 Difference]: Finished difference Result 5447 states and 11744 transitions. [2019-11-15 23:55:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:55:47,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 23:55:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:47,349 INFO L225 Difference]: With dead ends: 5447 [2019-11-15 23:55:47,349 INFO L226 Difference]: Without dead ends: 5407 [2019-11-15 23:55:47,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2019-11-15 23:55:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 4742. [2019-11-15 23:55:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4742 states. [2019-11-15 23:55:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 10299 transitions. [2019-11-15 23:55:47,427 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 10299 transitions. Word has length 98 [2019-11-15 23:55:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:47,428 INFO L462 AbstractCegarLoop]: Abstraction has 4742 states and 10299 transitions. [2019-11-15 23:55:47,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 10299 transitions. [2019-11-15 23:55:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:47,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:47,434 INFO L380 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, 1, 1] [2019-11-15 23:55:47,435 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash 971941412, now seen corresponding path program 1 times [2019-11-15 23:55:47,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:47,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440729991] [2019-11-15 23:55:47,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:47,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:47,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:47,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-11-15 23:55:47,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440729991] [2019-11-15 23:55:47,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:47,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:55:47,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673270589] [2019-11-15 23:55:47,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:55:47,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:55:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:55:47,788 INFO L87 Difference]: Start difference. First operand 4742 states and 10299 transitions. Second operand 11 states. [2019-11-15 23:55:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:49,412 INFO L93 Difference]: Finished difference Result 5466 states and 11852 transitions. [2019-11-15 23:55:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:55:49,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-11-15 23:55:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:49,419 INFO L225 Difference]: With dead ends: 5466 [2019-11-15 23:55:49,419 INFO L226 Difference]: Without dead ends: 5466 [2019-11-15 23:55:49,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:55:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-11-15 23:55:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 4905. [2019-11-15 23:55:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-11-15 23:55:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10657 transitions. [2019-11-15 23:55:49,534 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10657 transitions. Word has length 98 [2019-11-15 23:55:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:49,534 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10657 transitions. [2019-11-15 23:55:49,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:55:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10657 transitions. [2019-11-15 23:55:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:49,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:49,541 INFO L380 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, 1, 1] [2019-11-15 23:55:49,542 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2084314939, now seen corresponding path program 1 times [2019-11-15 23:55:49,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:49,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857144771] [2019-11-15 23:55:49,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:55:49,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857144771] [2019-11-15 23:55:49,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:49,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:55:49,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130925020] [2019-11-15 23:55:49,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:55:49,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:55:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:55:49,708 INFO L87 Difference]: Start difference. First operand 4905 states and 10657 transitions. Second operand 7 states. [2019-11-15 23:55:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:49,908 INFO L93 Difference]: Finished difference Result 5970 states and 12894 transitions. [2019-11-15 23:55:49,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:55:49,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-11-15 23:55:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:49,916 INFO L225 Difference]: With dead ends: 5970 [2019-11-15 23:55:49,916 INFO L226 Difference]: Without dead ends: 5970 [2019-11-15 23:55:49,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2019-11-15 23:55:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 4579. [2019-11-15 23:55:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-15 23:55:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 9878 transitions. [2019-11-15 23:55:49,995 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 9878 transitions. Word has length 98 [2019-11-15 23:55:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:49,995 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 9878 transitions. [2019-11-15 23:55:49,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:55:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 9878 transitions. [2019-11-15 23:55:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:50,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:50,001 INFO L380 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, 1, 1] [2019-11-15 23:55:50,002 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1391213242, now seen corresponding path program 1 times [2019-11-15 23:55:50,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:50,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521734799] [2019-11-15 23:55:50,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:50,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:50,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:50,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-11-15 23:55:50,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521734799] [2019-11-15 23:55:50,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:50,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:55:50,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764612234] [2019-11-15 23:55:50,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:55:50,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:50,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:55:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:50,275 INFO L87 Difference]: Start difference. First operand 4579 states and 9878 transitions. Second operand 10 states. [2019-11-15 23:55:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:50,995 INFO L93 Difference]: Finished difference Result 13638 states and 29903 transitions. [2019-11-15 23:55:50,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:55:50,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-11-15 23:55:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:51,006 INFO L225 Difference]: With dead ends: 13638 [2019-11-15 23:55:51,007 INFO L226 Difference]: Without dead ends: 8300 [2019-11-15 23:55:51,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:55:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2019-11-15 23:55:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 4068. [2019-11-15 23:55:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2019-11-15 23:55:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 8722 transitions. [2019-11-15 23:55:51,096 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 8722 transitions. Word has length 98 [2019-11-15 23:55:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:51,096 INFO L462 AbstractCegarLoop]: Abstraction has 4068 states and 8722 transitions. [2019-11-15 23:55:51,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:55:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 8722 transitions. [2019-11-15 23:55:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:55:51,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:51,102 INFO L380 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, 1, 1] [2019-11-15 23:55:51,102 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -920238160, now seen corresponding path program 2 times [2019-11-15 23:55:51,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:51,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701668475] [2019-11-15 23:55:51,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:51,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:51,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:51,233 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:51,233 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:55:51,439 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:55:51,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:55:51 BasicIcfg [2019-11-15 23:55:51,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:55:51,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:55:51,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:55:51,450 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:55:51,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:05" (3/4) ... [2019-11-15 23:55:51,453 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:55:51,655 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b23331ec-1146-4b5d-acf5-7acd5c03e358/bin/uautomizer/witness.graphml [2019-11-15 23:55:51,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:55:51,659 INFO L168 Benchmark]: Toolchain (without parser) took 47485.59 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 944.7 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,659 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:51,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.51 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,662 INFO L168 Benchmark]: Boogie Preprocessor took 39.78 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-11-15 23:55:51,665 INFO L168 Benchmark]: RCFGBuilder took 750.49 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,665 INFO L168 Benchmark]: TraceAbstraction took 45693.59 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.1 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 987.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,666 INFO L168 Benchmark]: Witness Printer took 206.31 ms. Allocated memory is still 4.9 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:51,668 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.51 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.78 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 750.49 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45693.59 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.1 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 987.1 MB. Max. memory is 11.5 GB. * Witness Printer took 206.31 ms. Allocated memory is still 4.9 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 75.0 MB). Peak memory consumption was 75.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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t249; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 pthread_t t250; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=3, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=3, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=3, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 45.5s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9101 SDtfs, 9569 SDslu, 20602 SDs, 0 SdLazy, 8122 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 84 SyntacticMatches, 20 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 73437 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2310 ConstructedInterpolants, 0 QuantifiedInterpolants, 582479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...