./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:28:45,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:28:45,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:28:45,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:28:45,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:28:46,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:28:46,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:28:46,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:28:46,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:28:46,007 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:28:46,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:28:46,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:28:46,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:28:46,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:28:46,009 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:28:46,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:28:46,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:28:46,011 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:28:46,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:28:46,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:28:46,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:28:46,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:28:46,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:28:46,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:28:46,014 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:28:46,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:28:46,015 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:28:46,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:28:46,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:28:46,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:28:46,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:28:46,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:46,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:28:46,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:28:46,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:28:46,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:28:46,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:28:46,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:28:46,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:28:46,019 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:28:46,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:28:46,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:28:46,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/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_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 035ec41aa2053cde8ee24830f9eb7cf444ea0c142ead33ef0c1fe95c3a7de39e [2023-11-29 02:28:46,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:28:46,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:28:46,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:28:46,316 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:28:46,317 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:28:46,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix020.oepc.i [2023-11-29 02:28:49,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:28:49,397 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:28:49,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/sv-benchmarks/c/pthread-wmm/mix020.oepc.i [2023-11-29 02:28:49,416 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/data/aeb5054e6/2aea8130d3094848bbc28c90dd70f0c9/FLAG30b93fa17 [2023-11-29 02:28:49,430 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/data/aeb5054e6/2aea8130d3094848bbc28c90dd70f0c9 [2023-11-29 02:28:49,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:28:49,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:28:49,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:49,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:28:49,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:28:49,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:49" (1/1) ... [2023-11-29 02:28:49,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329f836a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:49, skipping insertion in model container [2023-11-29 02:28:49,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:49" (1/1) ... [2023-11-29 02:28:49,500 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:28:49,698 WARN L240 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_2f8bc423-9911-467a-93a6-4eab21dfa438/sv-benchmarks/c/pthread-wmm/mix020.oepc.i[945,958] [2023-11-29 02:28:49,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:49,922 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:28:49,935 WARN L240 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_2f8bc423-9911-467a-93a6-4eab21dfa438/sv-benchmarks/c/pthread-wmm/mix020.oepc.i[945,958] [2023-11-29 02:28:49,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:50,028 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:28:50,028 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:28:50,036 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:28:50,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50 WrapperNode [2023-11-29 02:28:50,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:50,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:50,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:28:50,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:28:50,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,098 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-29 02:28:50,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:50,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:28:50,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:28:50,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:28:50,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,138 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 02:28:50,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:28:50,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:28:50,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:28:50,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:28:50,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (1/1) ... [2023-11-29 02:28:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:50,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:28:50,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:28:50,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:28:50,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:28:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:28:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:28:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:28:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:28:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:28:50,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:28:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:28:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:28:50,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:28:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:28:50,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:28:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:28:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:28:50,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:28:50,244 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:28:50,407 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:28:50,409 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:28:50,742 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:28:50,937 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:28:50,938 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:28:50,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:50 BoogieIcfgContainer [2023-11-29 02:28:50,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:28:50,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:28:50,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:28:50,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:28:50,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:28:49" (1/3) ... [2023-11-29 02:28:50,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678d1866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:50, skipping insertion in model container [2023-11-29 02:28:50,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:50" (2/3) ... [2023-11-29 02:28:50,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678d1866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:50, skipping insertion in model container [2023-11-29 02:28:50,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:50" (3/3) ... [2023-11-29 02:28:50,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-11-29 02:28:50,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:28:50,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:28:50,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 02:28:50,976 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:28:51,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:28:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2023-11-29 02:28:51,128 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-29 02:28:51,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:28:51,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-29 02:28:51,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2023-11-29 02:28:51,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2023-11-29 02:28:51,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:28:51,158 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=LoopHeads, 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;@64c18efa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:28:51,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 02:28:51,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:28:51,165 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 02:28:51,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:28:51,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:51,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 02:28:51,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:28:51,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash 12242167, now seen corresponding path program 1 times [2023-11-29 02:28:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541171] [2023-11-29 02:28:51,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:28:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541171] [2023-11-29 02:28:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:28:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527099406] [2023-11-29 02:28:51,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:51,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:51,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2023-11-29 02:28:51,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2023-11-29 02:28:51,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:51,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2023-11-29 02:28:51,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:52,619 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2023-11-29 02:28:52,619 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-29 02:28:52,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 28499 event pairs, 443 based on Foata normal form. 135/4199 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2023-11-29 02:28:52,665 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-29 02:28:52,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2023-11-29 02:28:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-29 02:28:52,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2023-11-29 02:28:52,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-29 02:28:52,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-29 02:28:52,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:52,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-29 02:28:52,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2023-11-29 02:28:52,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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) [2023-11-29 02:28:52,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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) [2023-11-29 02:28:52,694 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2023-11-29 02:28:52,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2023-11-29 02:28:52,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:28:52,702 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2023-11-29 02:28:52,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-11-29 02:28:52,709 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2023-11-29 02:28:52,709 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2023-11-29 02:28:52,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2023-11-29 02:28:52,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:52,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:28:52,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:28:52,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:28:52,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -959684712, now seen corresponding path program 1 times [2023-11-29 02:28:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273277181] [2023-11-29 02:28:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:28:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:53,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273277181] [2023-11-29 02:28:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273277181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:28:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710576249] [2023-11-29 02:28:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:53,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:28:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:28:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:28:53,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2023-11-29 02:28:53,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-29 02:28:53,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:53,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2023-11-29 02:28:53,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:58,382 INFO L124 PetriNetUnfolderBase]: 28756/41030 cut-off events. [2023-11-29 02:28:58,382 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2023-11-29 02:28:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82082 conditions, 41030 events. 28756/41030 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 1848. Compared 287665 event pairs, 6922 based on Foata normal form. 0/39954 useless extension candidates. Maximal degree in co-relation 82072. Up to 16239 conditions per place. [2023-11-29 02:28:58,666 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 48 selfloop transitions, 7 changer transitions 96/163 dead transitions. [2023-11-29 02:28:58,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 163 transitions, 660 flow [2023-11-29 02:28:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:28:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:28:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 297 transitions. [2023-11-29 02:28:58,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2023-11-29 02:28:58,672 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 297 transitions. [2023-11-29 02:28:58,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 297 transitions. [2023-11-29 02:28:58,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:58,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 297 transitions. [2023-11-29 02:28:58,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 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) [2023-11-29 02:28:58,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:28:58,680 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:28:58,680 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 9 states and 297 transitions. [2023-11-29 02:28:58,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 163 transitions, 660 flow [2023-11-29 02:28:58,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 163 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:58,687 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 188 flow [2023-11-29 02:28:58,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-29 02:28:58,688 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-11-29 02:28:58,688 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 188 flow [2023-11-29 02:28:58,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2023-11-29 02:28:58,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:58,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:28:58,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:28:58,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:28:58,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1886012231, now seen corresponding path program 1 times [2023-11-29 02:28:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:58,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068885732] [2023-11-29 02:28:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:28:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:58,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068885732] [2023-11-29 02:28:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068885732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:28:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310471609] [2023-11-29 02:28:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:28:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:28:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:28:58,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2023-11-29 02:28:58,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2023-11-29 02:28:58,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:58,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2023-11-29 02:28:58,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:02,344 INFO L124 PetriNetUnfolderBase]: 15842/24780 cut-off events. [2023-11-29 02:29:02,345 INFO L125 PetriNetUnfolderBase]: For 21446/22926 co-relation queries the response was YES. [2023-11-29 02:29:02,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65227 conditions, 24780 events. 15842/24780 cut-off events. For 21446/22926 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 194075 event pairs, 4163 based on Foata normal form. 690/24506 useless extension candidates. Maximal degree in co-relation 65209. Up to 14194 conditions per place. [2023-11-29 02:29:02,621 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 34 selfloop transitions, 3 changer transitions 43/100 dead transitions. [2023-11-29 02:29:02,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 512 flow [2023-11-29 02:29:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:29:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2023-11-29 02:29:02,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6297376093294461 [2023-11-29 02:29:02,624 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 216 transitions. [2023-11-29 02:29:02,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 216 transitions. [2023-11-29 02:29:02,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:02,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 216 transitions. [2023-11-29 02:29:02,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 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) [2023-11-29 02:29:02,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:02,628 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:02,628 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 188 flow. Second operand 7 states and 216 transitions. [2023-11-29 02:29:02,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 512 flow [2023-11-29 02:29:02,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 462 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-29 02:29:02,808 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 177 flow [2023-11-29 02:29:02,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2023-11-29 02:29:02,810 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-11-29 02:29:02,810 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 177 flow [2023-11-29 02:29:02,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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) [2023-11-29 02:29:02,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:02,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:02,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:29:02,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:02,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1960942580, now seen corresponding path program 1 times [2023-11-29 02:29:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285254809] [2023-11-29 02:29:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285254809] [2023-11-29 02:29:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285254809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:03,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:03,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:29:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734227275] [2023-11-29 02:29:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:03,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:03,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:29:03,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-29 02:29:03,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:03,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:29:03,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:06,783 INFO L124 PetriNetUnfolderBase]: 17095/26399 cut-off events. [2023-11-29 02:29:06,783 INFO L125 PetriNetUnfolderBase]: For 23074/23501 co-relation queries the response was YES. [2023-11-29 02:29:06,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68041 conditions, 26399 events. 17095/26399 cut-off events. For 23074/23501 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 201879 event pairs, 5502 based on Foata normal form. 753/26766 useless extension candidates. Maximal degree in co-relation 68020. Up to 17877 conditions per place. [2023-11-29 02:29:06,971 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 40 selfloop transitions, 5 changer transitions 47/110 dead transitions. [2023-11-29 02:29:06,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 587 flow [2023-11-29 02:29:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:29:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2023-11-29 02:29:06,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384839650145773 [2023-11-29 02:29:06,973 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 219 transitions. [2023-11-29 02:29:06,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 219 transitions. [2023-11-29 02:29:06,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:06,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 219 transitions. [2023-11-29 02:29:06,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 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) [2023-11-29 02:29:06,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:06,976 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:06,976 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 177 flow. Second operand 7 states and 219 transitions. [2023-11-29 02:29:06,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 587 flow [2023-11-29 02:29:08,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 561 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 02:29:08,124 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 214 flow [2023-11-29 02:29:08,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2023-11-29 02:29:08,125 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-11-29 02:29:08,125 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 214 flow [2023-11-29 02:29:08,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2023-11-29 02:29:08,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:08,125 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] [2023-11-29 02:29:08,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:29:08,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:08,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110091, now seen corresponding path program 1 times [2023-11-29 02:29:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780187616] [2023-11-29 02:29:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:08,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780187616] [2023-11-29 02:29:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780187616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:08,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86683380] [2023-11-29 02:29:08,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:08,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:08,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:29:08,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2023-11-29 02:29:08,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:08,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:29:08,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:12,957 INFO L124 PetriNetUnfolderBase]: 28186/42449 cut-off events. [2023-11-29 02:29:12,958 INFO L125 PetriNetUnfolderBase]: For 30276/34075 co-relation queries the response was YES. [2023-11-29 02:29:13,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103029 conditions, 42449 events. 28186/42449 cut-off events. For 30276/34075 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 320034 event pairs, 4740 based on Foata normal form. 1666/42806 useless extension candidates. Maximal degree in co-relation 103009. Up to 20987 conditions per place. [2023-11-29 02:29:13,229 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 56 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2023-11-29 02:29:13,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 428 flow [2023-11-29 02:29:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:29:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2023-11-29 02:29:13,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2023-11-29 02:29:13,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 137 transitions. [2023-11-29 02:29:13,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 137 transitions. [2023-11-29 02:29:13,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:13,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 137 transitions. [2023-11-29 02:29:13,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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) [2023-11-29 02:29:13,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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) [2023-11-29 02:29:13,234 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 states have internal predecessors, (245), 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) [2023-11-29 02:29:13,234 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 214 flow. Second operand 4 states and 137 transitions. [2023-11-29 02:29:13,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 428 flow [2023-11-29 02:29:13,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 419 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 02:29:13,667 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 251 flow [2023-11-29 02:29:13,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-29 02:29:13,668 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2023-11-29 02:29:13,668 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 251 flow [2023-11-29 02:29:13,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2023-11-29 02:29:13,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:13,669 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] [2023-11-29 02:29:13,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:29:13,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:13,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1503201267, now seen corresponding path program 1 times [2023-11-29 02:29:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136643153] [2023-11-29 02:29:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136643153] [2023-11-29 02:29:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136643153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:14,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051905631] [2023-11-29 02:29:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:14,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:14,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:14,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:14,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:29:14,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2023-11-29 02:29:14,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:14,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:29:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:20,570 INFO L124 PetriNetUnfolderBase]: 32071/49418 cut-off events. [2023-11-29 02:29:20,570 INFO L125 PetriNetUnfolderBase]: For 48641/51549 co-relation queries the response was YES. [2023-11-29 02:29:20,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131668 conditions, 49418 events. 32071/49418 cut-off events. For 48641/51549 co-relation queries the response was YES. Maximal size of possible extension queue 2439. Compared 407016 event pairs, 11945 based on Foata normal form. 997/46772 useless extension candidates. Maximal degree in co-relation 131647. Up to 21045 conditions per place. [2023-11-29 02:29:20,896 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 86 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2023-11-29 02:29:20,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 655 flow [2023-11-29 02:29:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:29:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2023-11-29 02:29:20,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588921282798834 [2023-11-29 02:29:20,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 226 transitions. [2023-11-29 02:29:20,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 226 transitions. [2023-11-29 02:29:20,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:20,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 226 transitions. [2023-11-29 02:29:20,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 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) [2023-11-29 02:29:20,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:20,901 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:29:20,901 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 251 flow. Second operand 7 states and 226 transitions. [2023-11-29 02:29:20,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 655 flow [2023-11-29 02:29:20,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 119 transitions, 647 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:20,918 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 336 flow [2023-11-29 02:29:20,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2023-11-29 02:29:20,919 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2023-11-29 02:29:20,919 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 336 flow [2023-11-29 02:29:20,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2023-11-29 02:29:20,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:20,919 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] [2023-11-29 02:29:20,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:29:20,920 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:20,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1933217435, now seen corresponding path program 1 times [2023-11-29 02:29:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188820103] [2023-11-29 02:29:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:21,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188820103] [2023-11-29 02:29:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188820103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529449447] [2023-11-29 02:29:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:21,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:21,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2023-11-29 02:29:21,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2023-11-29 02:29:21,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:21,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2023-11-29 02:29:21,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:32,862 INFO L124 PetriNetUnfolderBase]: 64933/96244 cut-off events. [2023-11-29 02:29:32,862 INFO L125 PetriNetUnfolderBase]: For 160234/164986 co-relation queries the response was YES. [2023-11-29 02:29:33,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282383 conditions, 96244 events. 64933/96244 cut-off events. For 160234/164986 co-relation queries the response was YES. Maximal size of possible extension queue 4212. Compared 794367 event pairs, 7815 based on Foata normal form. 1314/92917 useless extension candidates. Maximal degree in co-relation 282357. Up to 36035 conditions per place. [2023-11-29 02:29:33,429 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 123 selfloop transitions, 32 changer transitions 5/176 dead transitions. [2023-11-29 02:29:33,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 176 transitions, 1191 flow [2023-11-29 02:29:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:29:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2023-11-29 02:29:33,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2023-11-29 02:29:33,431 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 273 transitions. [2023-11-29 02:29:33,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 273 transitions. [2023-11-29 02:29:33,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:33,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 273 transitions. [2023-11-29 02:29:33,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 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) [2023-11-29 02:29:33,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:29:33,434 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:29:33,434 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 336 flow. Second operand 9 states and 273 transitions. [2023-11-29 02:29:33,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 176 transitions, 1191 flow [2023-11-29 02:29:36,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 176 transitions, 1144 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:36,662 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 683 flow [2023-11-29 02:29:36,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=683, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-11-29 02:29:36,662 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-11-29 02:29:36,663 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 683 flow [2023-11-29 02:29:36,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2023-11-29 02:29:36,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:36,663 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] [2023-11-29 02:29:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:29:36,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:36,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1535091525, now seen corresponding path program 2 times [2023-11-29 02:29:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104244848] [2023-11-29 02:29:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104244848] [2023-11-29 02:29:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104244848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:36,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:36,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:29:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018834009] [2023-11-29 02:29:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:36,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:29:36,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 683 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2023-11-29 02:29:36,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:36,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:29:36,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:46,732 INFO L124 PetriNetUnfolderBase]: 50580/75012 cut-off events. [2023-11-29 02:29:46,732 INFO L125 PetriNetUnfolderBase]: For 159926/169606 co-relation queries the response was YES. [2023-11-29 02:29:47,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223729 conditions, 75012 events. 50580/75012 cut-off events. For 159926/169606 co-relation queries the response was YES. Maximal size of possible extension queue 2902. Compared 579561 event pairs, 5439 based on Foata normal form. 3565/76551 useless extension candidates. Maximal degree in co-relation 223695. Up to 30397 conditions per place. [2023-11-29 02:29:47,187 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 78 selfloop transitions, 10 changer transitions 12/139 dead transitions. [2023-11-29 02:29:47,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 139 transitions, 1091 flow [2023-11-29 02:29:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:29:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:29:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-29 02:29:47,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7183673469387755 [2023-11-29 02:29:47,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-29 02:29:47,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-29 02:29:47,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:47,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-29 02:29:47,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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) [2023-11-29 02:29:47,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-29 02:29:47,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 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) [2023-11-29 02:29:47,191 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 683 flow. Second operand 5 states and 176 transitions. [2023-11-29 02:29:47,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 139 transitions, 1091 flow [2023-11-29 02:29:49,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 139 transitions, 1031 flow, removed 30 selfloop flow, removed 0 redundant places. [2023-11-29 02:29:49,956 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 588 flow [2023-11-29 02:29:49,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2023-11-29 02:29:49,956 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-11-29 02:29:49,956 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 588 flow [2023-11-29 02:29:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2023-11-29 02:29:49,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:49,957 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] [2023-11-29 02:29:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:29:49,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:49,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash -977078932, now seen corresponding path program 1 times [2023-11-29 02:29:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422263858] [2023-11-29 02:29:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422263858] [2023-11-29 02:29:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422263858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:50,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:50,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251724701] [2023-11-29 02:29:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:50,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:29:50,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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) [2023-11-29 02:29:50,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:50,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:29:50,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:57,234 INFO L124 PetriNetUnfolderBase]: 36532/53572 cut-off events. [2023-11-29 02:29:57,234 INFO L125 PetriNetUnfolderBase]: For 112001/118205 co-relation queries the response was YES. [2023-11-29 02:29:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168717 conditions, 53572 events. 36532/53572 cut-off events. For 112001/118205 co-relation queries the response was YES. Maximal size of possible extension queue 2464. Compared 393767 event pairs, 3139 based on Foata normal form. 2263/53935 useless extension candidates. Maximal degree in co-relation 168679. Up to 18556 conditions per place. [2023-11-29 02:29:57,567 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 91 selfloop transitions, 14 changer transitions 3/145 dead transitions. [2023-11-29 02:29:57,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 145 transitions, 1083 flow [2023-11-29 02:29:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:29:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:29:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-29 02:29:57,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2023-11-29 02:29:57,569 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-29 02:29:57,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-29 02:29:57,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:57,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-29 02:29:57,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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) [2023-11-29 02:29:57,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-29 02:29:57,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-29 02:29:57,572 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 588 flow. Second operand 6 states and 213 transitions. [2023-11-29 02:29:57,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 145 transitions, 1083 flow [2023-11-29 02:29:57,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 1045 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-29 02:29:57,773 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 618 flow [2023-11-29 02:29:57,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2023-11-29 02:29:57,774 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2023-11-29 02:29:57,774 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 618 flow [2023-11-29 02:29:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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) [2023-11-29 02:29:57,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:57,774 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] [2023-11-29 02:29:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:29:57,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:29:57,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1566305322, now seen corresponding path program 1 times [2023-11-29 02:29:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83636159] [2023-11-29 02:29:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83636159] [2023-11-29 02:29:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83636159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:29:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967453719] [2023-11-29 02:29:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:58,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:58,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:58,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 02:29:58,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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) [2023-11-29 02:29:58,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:58,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 02:29:58,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:07,548 INFO L124 PetriNetUnfolderBase]: 36899/63755 cut-off events. [2023-11-29 02:30:07,548 INFO L125 PetriNetUnfolderBase]: For 129408/142629 co-relation queries the response was YES. [2023-11-29 02:30:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194480 conditions, 63755 events. 36899/63755 cut-off events. For 129408/142629 co-relation queries the response was YES. Maximal size of possible extension queue 4403. Compared 646002 event pairs, 10652 based on Foata normal form. 1363/59354 useless extension candidates. Maximal degree in co-relation 194444. Up to 19016 conditions per place. [2023-11-29 02:30:07,975 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 77 selfloop transitions, 12 changer transitions 27/166 dead transitions. [2023-11-29 02:30:07,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 166 transitions, 1254 flow [2023-11-29 02:30:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:30:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:30:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 290 transitions. [2023-11-29 02:30:07,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6575963718820862 [2023-11-29 02:30:07,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 290 transitions. [2023-11-29 02:30:07,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 290 transitions. [2023-11-29 02:30:07,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:07,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 290 transitions. [2023-11-29 02:30:07,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 32.22222222222222) internal successors, (290), 9 states have internal predecessors, (290), 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) [2023-11-29 02:30:07,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:30:07,981 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:30:07,981 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 618 flow. Second operand 9 states and 290 transitions. [2023-11-29 02:30:07,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 166 transitions, 1254 flow [2023-11-29 02:30:10,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 166 transitions, 1223 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-29 02:30:10,582 INFO L231 Difference]: Finished difference. Result has 101 places, 87 transitions, 637 flow [2023-11-29 02:30:10,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=637, PETRI_PLACES=101, PETRI_TRANSITIONS=87} [2023-11-29 02:30:10,583 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2023-11-29 02:30:10,583 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 637 flow [2023-11-29 02:30:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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) [2023-11-29 02:30:10,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:10,584 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] [2023-11-29 02:30:10,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:30:10,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:30:10,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1288617176, now seen corresponding path program 2 times [2023-11-29 02:30:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112339280] [2023-11-29 02:30:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:10,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112339280] [2023-11-29 02:30:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112339280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:10,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:30:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368327289] [2023-11-29 02:30:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:10,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:30:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:30:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:30:10,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:30:10,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 637 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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) [2023-11-29 02:30:10,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:10,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:30:10,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:23,768 INFO L124 PetriNetUnfolderBase]: 68763/100632 cut-off events. [2023-11-29 02:30:23,768 INFO L125 PetriNetUnfolderBase]: For 227570/236860 co-relation queries the response was YES. [2023-11-29 02:30:24,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333360 conditions, 100632 events. 68763/100632 cut-off events. For 227570/236860 co-relation queries the response was YES. Maximal size of possible extension queue 4848. Compared 798813 event pairs, 4880 based on Foata normal form. 2302/100405 useless extension candidates. Maximal degree in co-relation 333319. Up to 37044 conditions per place. [2023-11-29 02:30:24,340 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 92 selfloop transitions, 18 changer transitions 19/161 dead transitions. [2023-11-29 02:30:24,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 161 transitions, 1305 flow [2023-11-29 02:30:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:30:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:30:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 02:30:24,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647230320699709 [2023-11-29 02:30:24,342 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 02:30:24,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 02:30:24,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:24,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 02:30:24,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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) [2023-11-29 02:30:24,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:30:24,345 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 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) [2023-11-29 02:30:24,345 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 637 flow. Second operand 7 states and 228 transitions. [2023-11-29 02:30:24,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 161 transitions, 1305 flow [2023-11-29 02:30:37,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 161 transitions, 1210 flow, removed 45 selfloop flow, removed 10 redundant places. [2023-11-29 02:30:37,358 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 587 flow [2023-11-29 02:30:37,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-11-29 02:30:37,358 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 36 predicate places. [2023-11-29 02:30:37,359 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 587 flow [2023-11-29 02:30:37,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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) [2023-11-29 02:30:37,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:37,359 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] [2023-11-29 02:30:37,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:30:37,359 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:30:37,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash -196675465, now seen corresponding path program 1 times [2023-11-29 02:30:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77606461] [2023-11-29 02:30:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:37,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:37,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77606461] [2023-11-29 02:30:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77606461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:37,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:30:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360468012] [2023-11-29 02:30:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:37,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:30:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:30:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:30:37,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2023-11-29 02:30:37,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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) [2023-11-29 02:30:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:37,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2023-11-29 02:30:37,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:46,616 INFO L124 PetriNetUnfolderBase]: 45110/75270 cut-off events. [2023-11-29 02:30:46,617 INFO L125 PetriNetUnfolderBase]: For 221126/237800 co-relation queries the response was YES. [2023-11-29 02:30:47,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259440 conditions, 75270 events. 45110/75270 cut-off events. For 221126/237800 co-relation queries the response was YES. Maximal size of possible extension queue 5341. Compared 731726 event pairs, 12897 based on Foata normal form. 1024/69609 useless extension candidates. Maximal degree in co-relation 259405. Up to 28646 conditions per place. [2023-11-29 02:30:47,197 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 66 selfloop transitions, 11 changer transitions 75/180 dead transitions. [2023-11-29 02:30:47,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 180 transitions, 1439 flow [2023-11-29 02:30:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:30:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:30:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2023-11-29 02:30:47,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2023-11-29 02:30:47,199 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 232 transitions. [2023-11-29 02:30:47,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 232 transitions. [2023-11-29 02:30:47,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:47,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 232 transitions. [2023-11-29 02:30:47,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 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) [2023-11-29 02:30:47,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-29 02:30:47,201 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-29 02:30:47,201 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 587 flow. Second operand 8 states and 232 transitions. [2023-11-29 02:30:47,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 180 transitions, 1439 flow [2023-11-29 02:31:01,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 180 transitions, 1312 flow, removed 52 selfloop flow, removed 7 redundant places. [2023-11-29 02:31:01,622 INFO L231 Difference]: Finished difference. Result has 95 places, 72 transitions, 472 flow [2023-11-29 02:31:01,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=472, PETRI_PLACES=95, PETRI_TRANSITIONS=72} [2023-11-29 02:31:01,623 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-11-29 02:31:01,623 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 72 transitions, 472 flow [2023-11-29 02:31:01,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 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) [2023-11-29 02:31:01,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:01,624 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] [2023-11-29 02:31:01,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:31:01,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:31:01,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 452725989, now seen corresponding path program 2 times [2023-11-29 02:31:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353046770] [2023-11-29 02:31:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:31:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:02,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353046770] [2023-11-29 02:31:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353046770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:02,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:31:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025461478] [2023-11-29 02:31:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:02,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:31:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:31:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:02,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 02:31:02,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 72 transitions, 472 flow. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2023-11-29 02:31:02,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:02,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 02:31:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:05,065 INFO L124 PetriNetUnfolderBase]: 10076/18010 cut-off events. [2023-11-29 02:31:05,065 INFO L125 PetriNetUnfolderBase]: For 26315/29106 co-relation queries the response was YES. [2023-11-29 02:31:05,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51549 conditions, 18010 events. 10076/18010 cut-off events. For 26315/29106 co-relation queries the response was YES. Maximal size of possible extension queue 1371. Compared 162389 event pairs, 3244 based on Foata normal form. 423/16148 useless extension candidates. Maximal degree in co-relation 51513. Up to 4833 conditions per place. [2023-11-29 02:31:05,187 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 66 selfloop transitions, 8 changer transitions 21/139 dead transitions. [2023-11-29 02:31:05,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 139 transitions, 944 flow [2023-11-29 02:31:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:31:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:31:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 254 transitions. [2023-11-29 02:31:05,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2023-11-29 02:31:05,189 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 254 transitions. [2023-11-29 02:31:05,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 254 transitions. [2023-11-29 02:31:05,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:05,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 254 transitions. [2023-11-29 02:31:05,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 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) [2023-11-29 02:31:05,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-29 02:31:05,191 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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) [2023-11-29 02:31:05,192 INFO L175 Difference]: Start difference. First operand has 95 places, 72 transitions, 472 flow. Second operand 8 states and 254 transitions. [2023-11-29 02:31:05,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 139 transitions, 944 flow [2023-11-29 02:31:06,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 139 transitions, 869 flow, removed 17 selfloop flow, removed 9 redundant places. [2023-11-29 02:31:06,121 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 499 flow [2023-11-29 02:31:06,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=499, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2023-11-29 02:31:06,122 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2023-11-29 02:31:06,122 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 499 flow [2023-11-29 02:31:06,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2023-11-29 02:31:06,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:06,122 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] [2023-11-29 02:31:06,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:31:06,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:31:06,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1467132769, now seen corresponding path program 3 times [2023-11-29 02:31:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:06,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891915627] [2023-11-29 02:31:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:31:06,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:06,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891915627] [2023-11-29 02:31:06,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891915627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:06,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:06,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:06,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501028282] [2023-11-29 02:31:06,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:06,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:06,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:06,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:06,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2023-11-29 02:31:06,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2023-11-29 02:31:06,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:06,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2023-11-29 02:31:06,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:09,032 INFO L124 PetriNetUnfolderBase]: 14737/26065 cut-off events. [2023-11-29 02:31:09,032 INFO L125 PetriNetUnfolderBase]: For 45182/50169 co-relation queries the response was YES. [2023-11-29 02:31:09,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76367 conditions, 26065 events. 14737/26065 cut-off events. For 45182/50169 co-relation queries the response was YES. Maximal size of possible extension queue 2099. Compared 244372 event pairs, 4247 based on Foata normal form. 512/23443 useless extension candidates. Maximal degree in co-relation 76332. Up to 10897 conditions per place. [2023-11-29 02:31:09,144 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 39 selfloop transitions, 1 changer transitions 48/119 dead transitions. [2023-11-29 02:31:09,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 857 flow [2023-11-29 02:31:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:31:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:31:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2023-11-29 02:31:09,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5884353741496599 [2023-11-29 02:31:09,145 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 173 transitions. [2023-11-29 02:31:09,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 173 transitions. [2023-11-29 02:31:09,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:09,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 173 transitions. [2023-11-29 02:31:09,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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) [2023-11-29 02:31:09,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-29 02:31:09,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 49.0) internal successors, (343), 7 states have internal predecessors, (343), 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) [2023-11-29 02:31:09,147 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 499 flow. Second operand 6 states and 173 transitions. [2023-11-29 02:31:09,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 857 flow [2023-11-29 02:31:10,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 119 transitions, 843 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-29 02:31:10,256 INFO L231 Difference]: Finished difference. Result has 97 places, 62 transitions, 359 flow [2023-11-29 02:31:10,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=359, PETRI_PLACES=97, PETRI_TRANSITIONS=62} [2023-11-29 02:31:10,257 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places. [2023-11-29 02:31:10,257 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 62 transitions, 359 flow [2023-11-29 02:31:10,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2023-11-29 02:31:10,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:10,257 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] [2023-11-29 02:31:10,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:31:10,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:31:10,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 202929323, now seen corresponding path program 4 times [2023-11-29 02:31:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212558377] [2023-11-29 02:31:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:31:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212558377] [2023-11-29 02:31:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212558377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:31:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753576296] [2023-11-29 02:31:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:31:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:31:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:10,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2023-11-29 02:31:10,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 62 transitions, 359 flow. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2023-11-29 02:31:10,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:10,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2023-11-29 02:31:10,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:12,145 INFO L124 PetriNetUnfolderBase]: 4999/8993 cut-off events. [2023-11-29 02:31:12,145 INFO L125 PetriNetUnfolderBase]: For 12308/13504 co-relation queries the response was YES. [2023-11-29 02:31:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25623 conditions, 8993 events. 4999/8993 cut-off events. For 12308/13504 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 72526 event pairs, 1375 based on Foata normal form. 83/8132 useless extension candidates. Maximal degree in co-relation 25588. Up to 3106 conditions per place. [2023-11-29 02:31:12,209 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 50 selfloop transitions, 10 changer transitions 20/113 dead transitions. [2023-11-29 02:31:12,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 693 flow [2023-11-29 02:31:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:31:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:31:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 267 transitions. [2023-11-29 02:31:12,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2023-11-29 02:31:12,211 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 267 transitions. [2023-11-29 02:31:12,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 267 transitions. [2023-11-29 02:31:12,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:12,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 267 transitions. [2023-11-29 02:31:12,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 29.666666666666668) internal successors, (267), 9 states have internal predecessors, (267), 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) [2023-11-29 02:31:12,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:31:12,213 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 49.0) internal successors, (490), 10 states have internal predecessors, (490), 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) [2023-11-29 02:31:12,214 INFO L175 Difference]: Start difference. First operand has 97 places, 62 transitions, 359 flow. Second operand 9 states and 267 transitions. [2023-11-29 02:31:12,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 693 flow [2023-11-29 02:31:12,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 645 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-11-29 02:31:12,377 INFO L231 Difference]: Finished difference. Result has 94 places, 66 transitions, 388 flow [2023-11-29 02:31:12,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=388, PETRI_PLACES=94, PETRI_TRANSITIONS=66} [2023-11-29 02:31:12,377 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-11-29 02:31:12,378 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 66 transitions, 388 flow [2023-11-29 02:31:12,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 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) [2023-11-29 02:31:12,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:12,378 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] [2023-11-29 02:31:12,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:31:12,378 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 02:31:12,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash -763099939, now seen corresponding path program 5 times [2023-11-29 02:31:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426193192] [2023-11-29 02:31:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:31:12,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:31:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:31:12,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:31:12,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:31:12,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-29 02:31:12,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-29 02:31:12,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-29 02:31:12,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-29 02:31:12,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-29 02:31:12,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-29 02:31:12,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-29 02:31:12,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:31:12,534 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:31:12,541 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:31:12,541 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:31:12,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:31:12,716 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:31:12,717 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:31:12,718 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:31:12,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:31:12 BasicIcfg [2023-11-29 02:31:12,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:31:12,748 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:31:12,748 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:31:12,748 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:31:12,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:50" (3/4) ... [2023-11-29 02:31:12,750 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 02:31:12,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:31:12,779 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:31:12,780 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:31:12,780 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:31:12,857 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:31:12,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:31:12,858 INFO L158 Benchmark]: Toolchain (without parser) took 143424.88ms. Allocated memory was 165.7MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 129.5MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2023-11-29 02:31:12,859 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:31:12,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.30ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 116.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.01ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 113.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,860 INFO L158 Benchmark]: Boogie Preprocessor took 63.06ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 109.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,860 INFO L158 Benchmark]: RCFGBuilder took 775.79ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 55.5MB in the end (delta: 53.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,861 INFO L158 Benchmark]: TraceAbstraction took 141806.27ms. Allocated memory was 165.7MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 54.6MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. [2023-11-29 02:31:12,861 INFO L158 Benchmark]: Witness Printer took 109.57ms. Allocated memory is still 10.9GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,863 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.30ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 116.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.01ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 113.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.06ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 109.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 775.79ms. Allocated memory is still 165.7MB. Free memory was 109.1MB in the beginning and 55.5MB in the end (delta: 53.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 141806.27ms. Allocated memory was 165.7MB in the beginning and 10.9GB in the end (delta: 10.7GB). Free memory was 54.6MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. * Witness Printer took 109.57ms. Allocated memory is still 10.9GB. Free memory was 6.1GB in the beginning and 6.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=1, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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$$choice2=0, x=1, y=2, z=1] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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$$choice2=0, x=1, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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$$choice2=0, x=1, y=2, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 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: 141.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 135.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1110 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1066 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3172 IncrementalHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 95 mSDtfsCounter, 3172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=7, InterpolantAutomatonStates: 104, 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.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 2797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2023-11-29 02:31:12,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f8bc423-9911-467a-93a6-4eab21dfa438/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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