./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:32:42,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:32:42,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:32:42,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:32:42,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:32:42,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:32:42,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:32:42,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:32:42,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:32:42,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:32:42,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:32:42,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:32:42,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:32:42,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:32:42,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:32:42,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:32:42,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:32:42,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:32:42,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:32:42,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:32:42,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:32:42,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:32:42,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:32:42,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:32:42,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:32:42,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:32:42,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:32:42,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:32:42,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:32:42,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:32:42,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:32:42,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:32:42,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:32:42,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:32:42,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:32:42,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:32:42,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:32:42,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:32:42,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:32:42,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:32:42,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:32:42,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:32:42,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:32:42,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:32:42,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:32:42,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:32:42,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:32:42,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:32:42,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:32:42,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:32:42,182 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:32:42,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:32:42,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:32:42,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:32:42,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:32:42,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:32:42,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:32:42,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:32:42,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:32:42,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:32:42,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:32:42,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:32:42,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:32:42,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:32:42,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:32:42,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:32:42,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:32:42,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:32:42,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:32:42,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:32:42,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:32:42,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:32:42,188 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:32:42,188 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:32:42,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:32:42,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ 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(reach_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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2022-10-17 10:32:42,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:32:42,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:32:42,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:32:42,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:32:42,482 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:32:42,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-10-17 10:32:42,576 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/data/b87cd8b10/b63945ec1ca64308998bb5193cdde542/FLAGacacc3229 [2022-10-17 10:32:43,154 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:32:43,156 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-10-17 10:32:43,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/data/b87cd8b10/b63945ec1ca64308998bb5193cdde542/FLAGacacc3229 [2022-10-17 10:32:43,415 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/data/b87cd8b10/b63945ec1ca64308998bb5193cdde542 [2022-10-17 10:32:43,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:32:43,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:32:43,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:32:43,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:32:43,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:32:43,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:32:43" (1/1) ... [2022-10-17 10:32:43,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736145d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:43, skipping insertion in model container [2022-10-17 10:32:43,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:32:43" (1/1) ... [2022-10-17 10:32:43,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:32:43,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:32:43,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-10-17 10:32:43,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:32:43,971 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:32:43,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-10-17 10:32:44,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:32:44,076 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:32:44,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44 WrapperNode [2022-10-17 10:32:44,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:32:44,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:32:44,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:32:44,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:32:44,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,141 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2022-10-17 10:32:44,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:32:44,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:32:44,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:32:44,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:32:44,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:32:44,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:32:44,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:32:44,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:32:44,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (1/1) ... [2022-10-17 10:32:44,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:32:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:32:44,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:32:44,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:32:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:32:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:32:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:32:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:32:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:32:44,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:32:44,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:32:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:32:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:32:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:32:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:32:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:32:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:32:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:32:44,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:32:44,294 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:32:44,447 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:32:44,450 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:32:45,322 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:32:45,926 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:32:45,927 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:32:45,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:32:45 BoogieIcfgContainer [2022-10-17 10:32:45,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:32:45,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:32:45,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:32:45,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:32:45,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:32:43" (1/3) ... [2022-10-17 10:32:45,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd721a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:32:45, skipping insertion in model container [2022-10-17 10:32:45,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:32:44" (2/3) ... [2022-10-17 10:32:45,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd721a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:32:45, skipping insertion in model container [2022-10-17 10:32:45,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:32:45" (3/3) ... [2022-10-17 10:32:45,945 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-10-17 10:32:45,954 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:32:45,965 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:32:45,966 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:32:45,966 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:32:46,041 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:32:46,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-10-17 10:32:46,202 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-10-17 10:32:46,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:32:46,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-10-17 10:32:46,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-10-17 10:32:46,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-10-17 10:32:46,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:32:46,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@249a29a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:32:46,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:32:46,275 INFO L130 PetriNetUnfolder]: 0/61 cut-off events. [2022-10-17 10:32:46,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:32:46,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:46,277 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:46,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1971532455, now seen corresponding path program 1 times [2022-10-17 10:32:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:46,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832353618] [2022-10-17 10:32:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:47,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832353618] [2022-10-17 10:32:47,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832353618] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:47,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:47,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:32:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924716582] [2022-10-17 10:32:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:32:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:47,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:32:47,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:32:47,165 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-10-17 10:32:47,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:47,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:47,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-10-17 10:32:47,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:47,374 INFO L130 PetriNetUnfolder]: 57/326 cut-off events. [2022-10-17 10:32:47,375 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-10-17 10:32:47,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 326 events. 57/326 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1333 event pairs, 11 based on Foata normal form. 14/321 useless extension candidates. Maximal degree in co-relation 398. Up to 75 conditions per place. [2022-10-17 10:32:47,381 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 13 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-10-17 10:32:47,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 272 flow [2022-10-17 10:32:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:32:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:32:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2022-10-17 10:32:47,400 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2022-10-17 10:32:47,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2022-10-17 10:32:47,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2022-10-17 10:32:47,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:47,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2022-10-17 10:32:47,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:47,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:47,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:47,423 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 329 transitions. [2022-10-17 10:32:47,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 272 flow [2022-10-17 10:32:47,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 115 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:32:47,434 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-10-17 10:32:47,436 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-10-17 10:32:47,441 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-10-17 10:32:47,441 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-10-17 10:32:47,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:47,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:47,443 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:47,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:32:47,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1797647236, now seen corresponding path program 1 times [2022-10-17 10:32:47,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:47,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997451530] [2022-10-17 10:32:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:47,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997451530] [2022-10-17 10:32:47,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997451530] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:47,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:47,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:32:47,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495717861] [2022-10-17 10:32:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:47,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:32:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:47,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:32:47,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:32:48,001 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 117 [2022-10-17 10:32:48,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:48,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:48,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 117 [2022-10-17 10:32:48,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:48,615 INFO L130 PetriNetUnfolder]: 330/1071 cut-off events. [2022-10-17 10:32:48,615 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-10-17 10:32:48,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 1071 events. 330/1071 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7220 event pairs, 59 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1646. Up to 257 conditions per place. [2022-10-17 10:32:48,624 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 18 selfloop transitions, 2 changer transitions 45/147 dead transitions. [2022-10-17 10:32:48,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 147 transitions, 426 flow [2022-10-17 10:32:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:32:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:32:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions. [2022-10-17 10:32:48,630 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8736942070275404 [2022-10-17 10:32:48,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 920 transitions. [2022-10-17 10:32:48,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions. [2022-10-17 10:32:48,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:48,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions. [2022-10-17 10:32:48,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:48,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:48,641 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:48,641 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 9 states and 920 transitions. [2022-10-17 10:32:48,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 147 transitions, 426 flow [2022-10-17 10:32:48,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:32:48,646 INFO L231 Difference]: Finished difference. Result has 132 places, 98 transitions, 222 flow [2022-10-17 10:32:48,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=222, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2022-10-17 10:32:48,647 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2022-10-17 10:32:48,647 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 222 flow [2022-10-17 10:32:48,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:48,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:48,649 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:48,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:32:48,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash 370340767, now seen corresponding path program 1 times [2022-10-17 10:32:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:48,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862636711] [2022-10-17 10:32:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:49,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862636711] [2022-10-17 10:32:49,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862636711] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:49,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:32:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978888536] [2022-10-17 10:32:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:32:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:32:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:32:49,474 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-10-17 10:32:49,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 222 flow. Second operand has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:49,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:49,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-10-17 10:32:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:50,140 INFO L130 PetriNetUnfolder]: 333/804 cut-off events. [2022-10-17 10:32:50,141 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-10-17 10:32:50,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 804 events. 333/804 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4413 event pairs, 83 based on Foata normal form. 19/803 useless extension candidates. Maximal degree in co-relation 1517. Up to 330 conditions per place. [2022-10-17 10:32:50,149 INFO L137 encePairwiseOnDemand]: 104/117 looper letters, 20 selfloop transitions, 11 changer transitions 43/153 dead transitions. [2022-10-17 10:32:50,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 514 flow [2022-10-17 10:32:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-17 10:32:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-10-17 10:32:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1472 transitions. [2022-10-17 10:32:50,155 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8387464387464387 [2022-10-17 10:32:50,156 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1472 transitions. [2022-10-17 10:32:50,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1472 transitions. [2022-10-17 10:32:50,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:50,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1472 transitions. [2022-10-17 10:32:50,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 98.13333333333334) internal successors, (1472), 15 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:50,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:50,170 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:50,171 INFO L175 Difference]: Start difference. First operand has 132 places, 98 transitions, 222 flow. Second operand 15 states and 1472 transitions. [2022-10-17 10:32:50,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 514 flow [2022-10-17 10:32:50,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 153 transitions, 474 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-10-17 10:32:50,181 INFO L231 Difference]: Finished difference. Result has 131 places, 105 transitions, 305 flow [2022-10-17 10:32:50,181 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=105} [2022-10-17 10:32:50,182 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2022-10-17 10:32:50,183 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 105 transitions, 305 flow [2022-10-17 10:32:50,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:50,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:50,184 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:50,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:32:50,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1340345933, now seen corresponding path program 1 times [2022-10-17 10:32:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:50,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79096883] [2022-10-17 10:32:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:50,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79096883] [2022-10-17 10:32:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79096883] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:51,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:32:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636112843] [2022-10-17 10:32:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:51,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:32:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:32:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:32:51,166 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-10-17 10:32:51,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 105 transitions, 305 flow. Second operand has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:51,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:51,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-10-17 10:32:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:51,795 INFO L130 PetriNetUnfolder]: 273/716 cut-off events. [2022-10-17 10:32:51,795 INFO L131 PetriNetUnfolder]: For 1683/1767 co-relation queries the response was YES. [2022-10-17 10:32:51,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 716 events. 273/716 cut-off events. For 1683/1767 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3757 event pairs, 149 based on Foata normal form. 19/707 useless extension candidates. Maximal degree in co-relation 2223. Up to 308 conditions per place. [2022-10-17 10:32:51,806 INFO L137 encePairwiseOnDemand]: 104/117 looper letters, 21 selfloop transitions, 13 changer transitions 29/141 dead transitions. [2022-10-17 10:32:51,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 141 transitions, 675 flow [2022-10-17 10:32:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:32:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-10-17 10:32:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1349 transitions. [2022-10-17 10:32:51,813 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8235653235653235 [2022-10-17 10:32:51,813 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1349 transitions. [2022-10-17 10:32:51,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1349 transitions. [2022-10-17 10:32:51,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:51,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1349 transitions. [2022-10-17 10:32:51,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.35714285714286) internal successors, (1349), 14 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:51,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:51,832 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:51,832 INFO L175 Difference]: Start difference. First operand has 131 places, 105 transitions, 305 flow. Second operand 14 states and 1349 transitions. [2022-10-17 10:32:51,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 141 transitions, 675 flow [2022-10-17 10:32:51,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 141 transitions, 657 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-10-17 10:32:51,844 INFO L231 Difference]: Finished difference. Result has 137 places, 107 transitions, 383 flow [2022-10-17 10:32:51,844 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=107} [2022-10-17 10:32:51,846 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2022-10-17 10:32:51,851 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 107 transitions, 383 flow [2022-10-17 10:32:51,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:51,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:51,853 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:51,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:32:51,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1529354793, now seen corresponding path program 1 times [2022-10-17 10:32:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:51,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295965879] [2022-10-17 10:32:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:51,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:52,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295965879] [2022-10-17 10:32:52,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295965879] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:52,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:52,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-17 10:32:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768356553] [2022-10-17 10:32:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:52,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-17 10:32:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-17 10:32:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:32:52,740 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 117 [2022-10-17 10:32:52,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 107 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:52,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:52,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 117 [2022-10-17 10:32:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:53,330 INFO L130 PetriNetUnfolder]: 226/651 cut-off events. [2022-10-17 10:32:53,331 INFO L131 PetriNetUnfolder]: For 4034/4116 co-relation queries the response was YES. [2022-10-17 10:32:53,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 651 events. 226/651 cut-off events. For 4034/4116 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3288 event pairs, 67 based on Foata normal form. 15/639 useless extension candidates. Maximal degree in co-relation 2588. Up to 231 conditions per place. [2022-10-17 10:32:53,341 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 30 selfloop transitions, 7 changer transitions 25/140 dead transitions. [2022-10-17 10:32:53,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 823 flow [2022-10-17 10:32:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:32:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:32:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1253 transitions. [2022-10-17 10:32:53,346 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8238001314924391 [2022-10-17 10:32:53,346 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1253 transitions. [2022-10-17 10:32:53,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1253 transitions. [2022-10-17 10:32:53,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:53,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1253 transitions. [2022-10-17 10:32:53,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.38461538461539) internal successors, (1253), 13 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:53,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:53,358 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:53,359 INFO L175 Difference]: Start difference. First operand has 137 places, 107 transitions, 383 flow. Second operand 13 states and 1253 transitions. [2022-10-17 10:32:53,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 823 flow [2022-10-17 10:32:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 140 transitions, 770 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-10-17 10:32:53,371 INFO L231 Difference]: Finished difference. Result has 141 places, 107 transitions, 374 flow [2022-10-17 10:32:53,372 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=374, PETRI_PLACES=141, PETRI_TRANSITIONS=107} [2022-10-17 10:32:53,375 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-10-17 10:32:53,375 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 107 transitions, 374 flow [2022-10-17 10:32:53,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.45454545454545) internal successors, (1028), 11 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:53,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:53,377 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:32:53,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 523682302, now seen corresponding path program 1 times [2022-10-17 10:32:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:53,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218404022] [2022-10-17 10:32:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:53,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218404022] [2022-10-17 10:32:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218404022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:53,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:53,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:32:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489350574] [2022-10-17 10:32:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:53,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:32:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:53,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:32:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:32:53,731 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-10-17 10:32:53,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 107 transitions, 374 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:53,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:53,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-10-17 10:32:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:54,338 INFO L130 PetriNetUnfolder]: 463/1150 cut-off events. [2022-10-17 10:32:54,338 INFO L131 PetriNetUnfolder]: For 7379/8027 co-relation queries the response was YES. [2022-10-17 10:32:54,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 1150 events. 463/1150 cut-off events. For 7379/8027 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7098 event pairs, 85 based on Foata normal form. 15/1116 useless extension candidates. Maximal degree in co-relation 4703. Up to 338 conditions per place. [2022-10-17 10:32:54,359 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 44 selfloop transitions, 2 changer transitions 15/143 dead transitions. [2022-10-17 10:32:54,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 827 flow [2022-10-17 10:32:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:32:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:32:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2022-10-17 10:32:54,363 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8522588522588522 [2022-10-17 10:32:54,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2022-10-17 10:32:54,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2022-10-17 10:32:54,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:54,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2022-10-17 10:32:54,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:54,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:54,370 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:54,371 INFO L175 Difference]: Start difference. First operand has 141 places, 107 transitions, 374 flow. Second operand 7 states and 698 transitions. [2022-10-17 10:32:54,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 827 flow [2022-10-17 10:32:54,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 143 transitions, 670 flow, removed 71 selfloop flow, removed 17 redundant places. [2022-10-17 10:32:54,389 INFO L231 Difference]: Finished difference. Result has 129 places, 108 transitions, 339 flow [2022-10-17 10:32:54,390 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=129, PETRI_TRANSITIONS=108} [2022-10-17 10:32:54,390 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 7 predicate places. [2022-10-17 10:32:54,391 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 108 transitions, 339 flow [2022-10-17 10:32:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:54,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:54,392 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:54,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:32:54,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1197702892, now seen corresponding path program 2 times [2022-10-17 10:32:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:54,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222563515] [2022-10-17 10:32:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:54,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222563515] [2022-10-17 10:32:54,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222563515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:54,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:54,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:32:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840141538] [2022-10-17 10:32:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:54,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:32:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:32:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:32:54,681 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-10-17 10:32:54,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 108 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:54,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:54,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-10-17 10:32:54,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:55,643 INFO L130 PetriNetUnfolder]: 1541/3251 cut-off events. [2022-10-17 10:32:55,644 INFO L131 PetriNetUnfolder]: For 8847/9049 co-relation queries the response was YES. [2022-10-17 10:32:55,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9487 conditions, 3251 events. 1541/3251 cut-off events. For 8847/9049 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 24480 event pairs, 100 based on Foata normal form. 12/3141 useless extension candidates. Maximal degree in co-relation 9418. Up to 947 conditions per place. [2022-10-17 10:32:55,676 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 51 selfloop transitions, 13 changer transitions 37/183 dead transitions. [2022-10-17 10:32:55,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 183 transitions, 932 flow [2022-10-17 10:32:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:32:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:32:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2022-10-17 10:32:55,681 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.864957264957265 [2022-10-17 10:32:55,681 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1012 transitions. [2022-10-17 10:32:55,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1012 transitions. [2022-10-17 10:32:55,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:55,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1012 transitions. [2022-10-17 10:32:55,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.2) internal successors, (1012), 10 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:55,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:55,690 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:55,690 INFO L175 Difference]: Start difference. First operand has 129 places, 108 transitions, 339 flow. Second operand 10 states and 1012 transitions. [2022-10-17 10:32:55,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 183 transitions, 932 flow [2022-10-17 10:32:55,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 925 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-10-17 10:32:55,702 INFO L231 Difference]: Finished difference. Result has 137 places, 117 transitions, 418 flow [2022-10-17 10:32:55,702 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=137, PETRI_TRANSITIONS=117} [2022-10-17 10:32:55,703 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2022-10-17 10:32:55,703 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 117 transitions, 418 flow [2022-10-17 10:32:55,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:55,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:55,704 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:55,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:32:55,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2068682215, now seen corresponding path program 1 times [2022-10-17 10:32:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:55,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046036936] [2022-10-17 10:32:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046036936] [2022-10-17 10:32:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046036936] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:55,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:55,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:32:55,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380173135] [2022-10-17 10:32:55,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:55,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:32:56,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:56,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:32:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:32:56,001 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-10-17 10:32:56,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 117 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:56,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:56,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-10-17 10:32:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:56,981 INFO L130 PetriNetUnfolder]: 1253/2939 cut-off events. [2022-10-17 10:32:56,981 INFO L131 PetriNetUnfolder]: For 9790/9996 co-relation queries the response was YES. [2022-10-17 10:32:57,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 2939 events. 1253/2939 cut-off events. For 9790/9996 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24012 event pairs, 68 based on Foata normal form. 68/2950 useless extension candidates. Maximal degree in co-relation 10223. Up to 550 conditions per place. [2022-10-17 10:32:57,010 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 57 selfloop transitions, 24 changer transitions 43/205 dead transitions. [2022-10-17 10:32:57,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 205 transitions, 1280 flow [2022-10-17 10:32:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:32:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:32:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1314 transitions. [2022-10-17 10:32:57,016 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.863905325443787 [2022-10-17 10:32:57,016 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1314 transitions. [2022-10-17 10:32:57,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1314 transitions. [2022-10-17 10:32:57,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:57,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1314 transitions. [2022-10-17 10:32:57,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.07692307692308) internal successors, (1314), 13 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:57,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:57,030 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:57,030 INFO L175 Difference]: Start difference. First operand has 137 places, 117 transitions, 418 flow. Second operand 13 states and 1314 transitions. [2022-10-17 10:32:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 205 transitions, 1280 flow [2022-10-17 10:32:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 205 transitions, 1250 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-10-17 10:32:57,059 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 598 flow [2022-10-17 10:32:57,059 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=598, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2022-10-17 10:32:57,060 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 30 predicate places. [2022-10-17 10:32:57,060 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 598 flow [2022-10-17 10:32:57,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:57,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:57,061 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:57,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:32:57,061 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:57,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:57,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1756063999, now seen corresponding path program 1 times [2022-10-17 10:32:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:57,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515670171] [2022-10-17 10:32:57,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515670171] [2022-10-17 10:32:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515670171] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:57,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:57,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:32:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635555469] [2022-10-17 10:32:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:57,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:32:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:32:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:32:57,448 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-10-17 10:32:57,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 598 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:57,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:57,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-10-17 10:32:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:32:58,393 INFO L130 PetriNetUnfolder]: 1064/2713 cut-off events. [2022-10-17 10:32:58,394 INFO L131 PetriNetUnfolder]: For 11471/11687 co-relation queries the response was YES. [2022-10-17 10:32:58,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10530 conditions, 2713 events. 1064/2713 cut-off events. For 11471/11687 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 23637 event pairs, 65 based on Foata normal form. 40/2696 useless extension candidates. Maximal degree in co-relation 10450. Up to 490 conditions per place. [2022-10-17 10:32:58,421 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 38 selfloop transitions, 22 changer transitions 60/201 dead transitions. [2022-10-17 10:32:58,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 201 transitions, 1328 flow [2022-10-17 10:32:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-17 10:32:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-10-17 10:32:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1582 transitions. [2022-10-17 10:32:58,427 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8450854700854701 [2022-10-17 10:32:58,427 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1582 transitions. [2022-10-17 10:32:58,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1582 transitions. [2022-10-17 10:32:58,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:32:58,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1582 transitions. [2022-10-17 10:32:58,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 98.875) internal successors, (1582), 16 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:58,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:58,439 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:58,439 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 598 flow. Second operand 16 states and 1582 transitions. [2022-10-17 10:32:58,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 201 transitions, 1328 flow [2022-10-17 10:32:58,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 201 transitions, 1234 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-10-17 10:32:58,533 INFO L231 Difference]: Finished difference. Result has 168 places, 124 transitions, 553 flow [2022-10-17 10:32:58,534 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=553, PETRI_PLACES=168, PETRI_TRANSITIONS=124} [2022-10-17 10:32:58,536 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 46 predicate places. [2022-10-17 10:32:58,536 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 124 transitions, 553 flow [2022-10-17 10:32:58,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:58,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:32:58,537 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:32:58,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:32:58,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:32:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:32:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 838159654, now seen corresponding path program 1 times [2022-10-17 10:32:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:32:58,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014702088] [2022-10-17 10:32:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:32:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:32:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:32:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:32:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:32:59,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014702088] [2022-10-17 10:32:59,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014702088] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:32:59,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:32:59,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-17 10:32:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059573553] [2022-10-17 10:32:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:32:59,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-17 10:32:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:32:59,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-17 10:32:59,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-10-17 10:32:59,646 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2022-10-17 10:32:59,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 124 transitions, 553 flow. Second operand has 15 states, 15 states have (on average 87.73333333333333) internal successors, (1316), 15 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:32:59,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:32:59,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2022-10-17 10:32:59,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:33:00,466 INFO L130 PetriNetUnfolder]: 330/1968 cut-off events. [2022-10-17 10:33:00,467 INFO L131 PetriNetUnfolder]: For 5187/5353 co-relation queries the response was YES. [2022-10-17 10:33:00,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6182 conditions, 1968 events. 330/1968 cut-off events. For 5187/5353 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 20938 event pairs, 9 based on Foata normal form. 3/1868 useless extension candidates. Maximal degree in co-relation 6090. Up to 263 conditions per place. [2022-10-17 10:33:00,534 INFO L137 encePairwiseOnDemand]: 102/117 looper letters, 31 selfloop transitions, 11 changer transitions 36/171 dead transitions. [2022-10-17 10:33:00,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 983 flow [2022-10-17 10:33:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-17 10:33:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-10-17 10:33:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1533 transitions. [2022-10-17 10:33:00,541 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.770739064856712 [2022-10-17 10:33:00,541 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1533 transitions. [2022-10-17 10:33:00,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1533 transitions. [2022-10-17 10:33:00,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:33:00,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1533 transitions. [2022-10-17 10:33:00,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 90.17647058823529) internal successors, (1533), 17 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:00,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 117.0) internal successors, (2106), 18 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:00,554 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 117.0) internal successors, (2106), 18 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:00,554 INFO L175 Difference]: Start difference. First operand has 168 places, 124 transitions, 553 flow. Second operand 17 states and 1533 transitions. [2022-10-17 10:33:00,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 983 flow [2022-10-17 10:33:00,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 171 transitions, 797 flow, removed 70 selfloop flow, removed 19 redundant places. [2022-10-17 10:33:00,634 INFO L231 Difference]: Finished difference. Result has 167 places, 128 transitions, 532 flow [2022-10-17 10:33:00,635 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=532, PETRI_PLACES=167, PETRI_TRANSITIONS=128} [2022-10-17 10:33:00,637 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 45 predicate places. [2022-10-17 10:33:00,637 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 128 transitions, 532 flow [2022-10-17 10:33:00,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 87.73333333333333) internal successors, (1316), 15 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:00,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:33:00,638 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:33:00,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:33:00,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:33:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:33:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash -505736020, now seen corresponding path program 2 times [2022-10-17 10:33:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:33:00,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787735050] [2022-10-17 10:33:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:33:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:33:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:33:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:33:00,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:33:00,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787735050] [2022-10-17 10:33:00,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787735050] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:33:00,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:33:00,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:33:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944447492] [2022-10-17 10:33:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:33:00,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:33:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:33:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:33:00,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:33:00,980 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-10-17 10:33:00,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 128 transitions, 532 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:00,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:33:00,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-10-17 10:33:00,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:33:01,410 INFO L130 PetriNetUnfolder]: 271/1648 cut-off events. [2022-10-17 10:33:01,410 INFO L131 PetriNetUnfolder]: For 2205/2284 co-relation queries the response was YES. [2022-10-17 10:33:01,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 1648 events. 271/1648 cut-off events. For 2205/2284 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16878 event pairs, 21 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 4299. Up to 176 conditions per place. [2022-10-17 10:33:01,424 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 23 selfloop transitions, 1 changer transitions 20/145 dead transitions. [2022-10-17 10:33:01,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 145 transitions, 726 flow [2022-10-17 10:33:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:33:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:33:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 691 transitions. [2022-10-17 10:33:01,426 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8437118437118437 [2022-10-17 10:33:01,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 691 transitions. [2022-10-17 10:33:01,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 691 transitions. [2022-10-17 10:33:01,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:33:01,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 691 transitions. [2022-10-17 10:33:01,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:01,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:01,431 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:01,431 INFO L175 Difference]: Start difference. First operand has 167 places, 128 transitions, 532 flow. Second operand 7 states and 691 transitions. [2022-10-17 10:33:01,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 145 transitions, 726 flow [2022-10-17 10:33:01,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 145 transitions, 673 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-10-17 10:33:01,465 INFO L231 Difference]: Finished difference. Result has 158 places, 121 transitions, 468 flow [2022-10-17 10:33:01,465 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=158, PETRI_TRANSITIONS=121} [2022-10-17 10:33:01,466 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 36 predicate places. [2022-10-17 10:33:01,466 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 121 transitions, 468 flow [2022-10-17 10:33:01,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:01,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:33:01,467 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:33:01,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:33:01,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:33:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:33:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash -889506486, now seen corresponding path program 3 times [2022-10-17 10:33:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:33:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016172748] [2022-10-17 10:33:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:33:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:33:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:33:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:33:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:33:02,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016172748] [2022-10-17 10:33:02,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016172748] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:33:02,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:33:02,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-10-17 10:33:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023848311] [2022-10-17 10:33:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:33:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-17 10:33:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:33:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-17 10:33:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-10-17 10:33:02,832 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 117 [2022-10-17 10:33:02,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 121 transitions, 468 flow. Second operand has 14 states, 14 states have (on average 91.57142857142857) internal successors, (1282), 14 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:02,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:33:02,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 117 [2022-10-17 10:33:02,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:33:03,323 INFO L130 PetriNetUnfolder]: 136/982 cut-off events. [2022-10-17 10:33:03,323 INFO L131 PetriNetUnfolder]: For 1057/1085 co-relation queries the response was YES. [2022-10-17 10:33:03,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 982 events. 136/982 cut-off events. For 1057/1085 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8667 event pairs, 1 based on Foata normal form. 8/948 useless extension candidates. Maximal degree in co-relation 2416. Up to 126 conditions per place. [2022-10-17 10:33:03,331 INFO L137 encePairwiseOnDemand]: 105/117 looper letters, 29 selfloop transitions, 6 changer transitions 16/147 dead transitions. [2022-10-17 10:33:03,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 147 transitions, 696 flow [2022-10-17 10:33:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:33:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-10-17 10:33:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-10-17 10:33:03,335 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8041310541310541 [2022-10-17 10:33:03,335 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-10-17 10:33:03,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-10-17 10:33:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:33:03,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-10-17 10:33:03,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:03,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:03,343 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 117.0) internal successors, (1521), 13 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:03,343 INFO L175 Difference]: Start difference. First operand has 158 places, 121 transitions, 468 flow. Second operand 12 states and 1129 transitions. [2022-10-17 10:33:03,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 147 transitions, 696 flow [2022-10-17 10:33:03,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 147 transitions, 647 flow, removed 22 selfloop flow, removed 10 redundant places. [2022-10-17 10:33:03,361 INFO L231 Difference]: Finished difference. Result has 158 places, 122 transitions, 487 flow [2022-10-17 10:33:03,361 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=487, PETRI_PLACES=158, PETRI_TRANSITIONS=122} [2022-10-17 10:33:03,362 INFO L287 CegarLoopForPetriNet]: 122 programPoint places, 36 predicate places. [2022-10-17 10:33:03,362 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 122 transitions, 487 flow [2022-10-17 10:33:03,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 91.57142857142857) internal successors, (1282), 14 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:33:03,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:33:03,363 INFO L208 CegarLoopForPetriNet]: 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] [2022-10-17 10:33:03,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:33:03,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:33:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:33:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -399536262, now seen corresponding path program 4 times [2022-10-17 10:33:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:33:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916304975] [2022-10-17 10:33:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:33:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:33:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:33:03,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:33:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:33:03,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:33:03,518 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:33:03,519 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:33:03,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:33:03,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:33:03,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:33:03,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:33:03,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:33:03,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:33:03,523 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:33:03,529 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:33:03,529 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:33:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:33:03 BasicIcfg [2022-10-17 10:33:03,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:33:03,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:33:03,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:33:03,718 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:33:03,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:32:45" (3/4) ... [2022-10-17 10:33:03,720 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:33:03,850 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:33:03,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:33:03,851 INFO L158 Benchmark]: Toolchain (without parser) took 20432.47ms. Allocated memory was 90.2MB in the beginning and 484.4MB in the end (delta: 394.3MB). Free memory was 60.7MB in the beginning and 297.8MB in the end (delta: -237.2MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,852 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:33:03,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 50.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.35ms. Allocated memory is still 90.2MB. Free memory was 50.0MB in the beginning and 46.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,853 INFO L158 Benchmark]: Boogie Preprocessor took 56.73ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 44.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,853 INFO L158 Benchmark]: RCFGBuilder took 1730.17ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 44.5MB in the beginning and 87.1MB in the end (delta: -42.7MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,854 INFO L158 Benchmark]: TraceAbstraction took 17784.14ms. Allocated memory was 119.5MB in the beginning and 484.4MB in the end (delta: 364.9MB). Free memory was 87.1MB in the beginning and 326.2MB in the end (delta: -239.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,854 INFO L158 Benchmark]: Witness Printer took 133.07ms. Allocated memory is still 484.4MB. Free memory was 326.2MB in the beginning and 297.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-10-17 10:33:03,856 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 90.2MB. Free memory was 59.4MB in the beginning and 59.3MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 50.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.35ms. Allocated memory is still 90.2MB. Free memory was 50.0MB in the beginning and 46.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.73ms. Allocated memory is still 90.2MB. Free memory was 46.9MB in the beginning and 44.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1730.17ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 44.5MB in the beginning and 87.1MB in the end (delta: -42.7MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17784.14ms. Allocated memory was 119.5MB in the beginning and 484.4MB in the end (delta: 364.9MB). Free memory was 87.1MB in the beginning and 326.2MB in the end (delta: -239.0MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Witness Printer took 133.07ms. Allocated memory is still 484.4MB. Free memory was 326.2MB in the beginning and 297.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L726] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L727] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L728] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L729] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t515; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L848] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L849] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 599 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1074 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1782 IncrementalHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 103 mSDtfsCounter, 1782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=8, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 961 ConstructedInterpolants, 0 QuantifiedInterpolants, 5292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:33:03,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52ab6d70-4df0-4b57-b874-58196fce8402/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE