./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/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_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-barrier.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/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_40198329-1517-462d-ab57-7a0d7b7d882c/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 504de2e820c504d0b98f5b71c19407f1b43c0dd9338639fad4f2fe6ea2f6854f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:42:25,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:42:25,830 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:42:25,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:42:25,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:42:25,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:42:25,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:42:25,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:42:25,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:42:25,860 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:42:25,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:42:25,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:42:25,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:42:25,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:42:25,863 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:42:25,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:42:25,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:42:25,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:42:25,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:42:25,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:42:25,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:42:25,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:42:25,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:42:25,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:42:25,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:42:25,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:42:25,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:42:25,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:42:25,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:42:25,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:42:25,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:42:25,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:42:25,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:42:25,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:42:25,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:42:25,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:42:25,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:42:25,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:42:25,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:42:25,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:42:25,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:42:25,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:42:25,873 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_40198329-1517-462d-ab57-7a0d7b7d882c/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_40198329-1517-462d-ab57-7a0d7b7d882c/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 -> 504de2e820c504d0b98f5b71c19407f1b43c0dd9338639fad4f2fe6ea2f6854f [2023-11-29 04:42:26,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:42:26,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:42:26,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:42:26,129 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:42:26,130 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:42:26,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2023-11-29 04:42:28,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:42:29,032 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:42:29,033 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2023-11-29 04:42:29,042 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/data/32261a988/2163eef8a1cd47cf9d21ceef5cfdaa6e/FLAG91e81e3b3 [2023-11-29 04:42:29,055 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/data/32261a988/2163eef8a1cd47cf9d21ceef5cfdaa6e [2023-11-29 04:42:29,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:42:29,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:42:29,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:42:29,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:42:29,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:42:29,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab659da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29, skipping insertion in model container [2023-11-29 04:42:29,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:42:29,281 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_40198329-1517-462d-ab57-7a0d7b7d882c/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[4800,4813] [2023-11-29 04:42:29,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:42:29,299 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:42:29,331 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_40198329-1517-462d-ab57-7a0d7b7d882c/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[4800,4813] [2023-11-29 04:42:29,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:42:29,340 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:42:29,340 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:42:29,348 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:42:29,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29 WrapperNode [2023-11-29 04:42:29,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:42:29,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:42:29,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:42:29,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:42:29,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,398 INFO L138 Inliner]: procedures = 25, calls = 98, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 270 [2023-11-29 04:42:29,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:42:29,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:42:29,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:42:29,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:42:29,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,427 INFO L175 MemorySlicer]: Split 14 memory accesses to 7 slices as follows [2, 2, 2, 2, 2, 2, 2]. 14 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 1, 1, 1]. [2023-11-29 04:42:29,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:42:29,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:42:29,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:42:29,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:42:29,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (1/1) ... [2023-11-29 04:42:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:42:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:42:29,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:42:29,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40198329-1517-462d-ab57-7a0d7b7d882c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:42:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:42:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:42:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:42:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:42:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:42:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:42:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:42:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:42:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 04:42:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 04:42:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 04:42:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 04:42:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 04:42:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 04:42:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 04:42:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 04:42:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 04:42:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 04:42:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-29 04:42:29,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-29 04:42:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-29 04:42:29,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-29 04:42:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:42:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:42:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:42:29,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:42:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:42:29,542 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 04:42:29,688 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:42:29,690 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:42:30,008 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:42:30,253 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:42:30,253 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:42:30,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:42:30 BoogieIcfgContainer [2023-11-29 04:42:30,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:42:30,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:42:30,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:42:30,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:42:30,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:42:29" (1/3) ... [2023-11-29 04:42:30,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abece5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:42:30, skipping insertion in model container [2023-11-29 04:42:30,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:42:29" (2/3) ... [2023-11-29 04:42:30,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abece5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:42:30, skipping insertion in model container [2023-11-29 04:42:30,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:42:30" (3/3) ... [2023-11-29 04:42:30,262 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2023-11-29 04:42:30,270 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:42:30,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:42:30,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:42:30,279 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:42:30,365 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-11-29 04:42:30,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 79 transitions, 224 flow [2023-11-29 04:42:30,437 INFO L124 PetriNetUnfolderBase]: 4/65 cut-off events. [2023-11-29 04:42:30,438 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:42:30,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 65 events. 4/65 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 150 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 75. Up to 3 conditions per place. [2023-11-29 04:42:30,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 79 transitions, 224 flow [2023-11-29 04:42:30,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 64 transitions, 176 flow [2023-11-29 04:42:30,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:42:30,465 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;@502bdefa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:42:30,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 04:42:30,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:42:30,492 INFO L124 PetriNetUnfolderBase]: 4/63 cut-off events. [2023-11-29 04:42:30,492 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:42:30,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:42:30,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:30,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:42:30,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 240787083, now seen corresponding path program 1 times [2023-11-29 04:42:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:42:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139034290] [2023-11-29 04:42:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:42:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:42:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:42:30,958 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 04:42:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:42:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139034290] [2023-11-29 04:42:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139034290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:42:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:42:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:42:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554287069] [2023-11-29 04:42:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:42:30,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:42:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:42:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:42:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:42:31,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2023-11-29 04:42:31,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:31,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:42:31,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2023-11-29 04:42:31,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:42:32,964 INFO L124 PetriNetUnfolderBase]: 8227/12717 cut-off events. [2023-11-29 04:42:32,964 INFO L125 PetriNetUnfolderBase]: For 1709/1709 co-relation queries the response was YES. [2023-11-29 04:42:33,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26300 conditions, 12717 events. 8227/12717 cut-off events. For 1709/1709 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 88392 event pairs, 5835 based on Foata normal form. 70/11383 useless extension candidates. Maximal degree in co-relation 25768. Up to 9819 conditions per place. [2023-11-29 04:42:33,137 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 59 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-11-29 04:42:33,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 85 transitions, 364 flow [2023-11-29 04:42:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:42:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:42:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 04:42:33,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104417670682731 [2023-11-29 04:42:33,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 04:42:33,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 04:42:33,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:42:33,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 04:42:33,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 04:42:33,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:33,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:33,169 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 176 flow. Second operand 3 states and 152 transitions. [2023-11-29 04:42:33,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 85 transitions, 364 flow [2023-11-29 04:42:33,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 316 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-29 04:42:33,252 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 152 flow [2023-11-29 04:42:33,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2023-11-29 04:42:33,259 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -9 predicate places. [2023-11-29 04:42:33,259 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 152 flow [2023-11-29 04:42:33,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:33,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:42:33,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:33,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:42:33,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:42:33,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1691575991, now seen corresponding path program 2 times [2023-11-29 04:42:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:42:33,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198808764] [2023-11-29 04:42:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:42:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:42:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:42:33,462 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 04:42:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:42:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198808764] [2023-11-29 04:42:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198808764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:42:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:42:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:42:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975715686] [2023-11-29 04:42:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:42:33,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:42:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:42:33,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:42:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:42:33,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2023-11-29 04:42:33,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:33,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:42:33,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2023-11-29 04:42:33,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:42:34,909 INFO L124 PetriNetUnfolderBase]: 6859/10105 cut-off events. [2023-11-29 04:42:34,909 INFO L125 PetriNetUnfolderBase]: For 1008/1008 co-relation queries the response was YES. [2023-11-29 04:42:34,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20322 conditions, 10105 events. 6859/10105 cut-off events. For 1008/1008 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 60799 event pairs, 4335 based on Foata normal form. 146/9421 useless extension candidates. Maximal degree in co-relation 8992. Up to 8031 conditions per place. [2023-11-29 04:42:34,970 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 57 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-11-29 04:42:34,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 320 flow [2023-11-29 04:42:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:42:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:42:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 04:42:34,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024096385542169 [2023-11-29 04:42:34,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 04:42:34,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 04:42:34,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:42:34,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 04:42:34,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 04:42:34,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:34,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:34,977 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 152 flow. Second operand 3 states and 150 transitions. [2023-11-29 04:42:34,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 320 flow [2023-11-29 04:42:34,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:42:34,980 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 156 flow [2023-11-29 04:42:34,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-29 04:42:34,981 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2023-11-29 04:42:34,982 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 156 flow [2023-11-29 04:42:34,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:34,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:42:34,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:34,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:42:34,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:42:34,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1833911318, now seen corresponding path program 1 times [2023-11-29 04:42:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:42:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764482637] [2023-11-29 04:42:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:42:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:42:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:42:36,080 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 04:42:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:42:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764482637] [2023-11-29 04:42:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764482637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:42:36,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:42:36,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:42:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730354428] [2023-11-29 04:42:36,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:42:36,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:42:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:42:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:42:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:42:36,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:42:36,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 156 flow. Second operand has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:42:36,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:42:36,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:42:36,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:42:47,967 INFO L124 PetriNetUnfolderBase]: 102639/133020 cut-off events. [2023-11-29 04:42:47,967 INFO L125 PetriNetUnfolderBase]: For 7855/7855 co-relation queries the response was YES. [2023-11-29 04:42:48,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273449 conditions, 133020 events. 102639/133020 cut-off events. For 7855/7855 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 739198 event pairs, 36062 based on Foata normal form. 1/129451 useless extension candidates. Maximal degree in co-relation 121297. Up to 109795 conditions per place. [2023-11-29 04:42:48,751 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 279 selfloop transitions, 81 changer transitions 39/408 dead transitions. [2023-11-29 04:42:48,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 408 transitions, 1742 flow [2023-11-29 04:42:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:42:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 04:42:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 820 transitions. [2023-11-29 04:42:48,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3528399311531842 [2023-11-29 04:42:48,759 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 820 transitions. [2023-11-29 04:42:48,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 820 transitions. [2023-11-29 04:42:48,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:42:48,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 820 transitions. [2023-11-29 04:42:48,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 29.285714285714285) internal successors, (820), 28 states have internal predecessors, (820), 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 04:42:48,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 83.0) internal successors, (2407), 29 states have internal predecessors, (2407), 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 04:42:48,777 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 83.0) internal successors, (2407), 29 states have internal predecessors, (2407), 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 04:42:48,777 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 156 flow. Second operand 28 states and 820 transitions. [2023-11-29 04:42:48,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 408 transitions, 1742 flow [2023-11-29 04:42:48,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 408 transitions, 1714 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:42:48,837 INFO L231 Difference]: Finished difference. Result has 111 places, 144 transitions, 594 flow [2023-11-29 04:42:48,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=594, PETRI_PLACES=111, PETRI_TRANSITIONS=144} [2023-11-29 04:42:48,839 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2023-11-29 04:42:48,839 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 144 transitions, 594 flow [2023-11-29 04:42:48,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:42:48,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:42:48,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:48,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:42:48,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:42:48,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 283677240, now seen corresponding path program 2 times [2023-11-29 04:42:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:42:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021044571] [2023-11-29 04:42:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:42:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:42:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:42:48,952 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 04:42:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:42:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021044571] [2023-11-29 04:42:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021044571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:42:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:42:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:42:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198358344] [2023-11-29 04:42:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:42:48,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:42:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:42:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:42:48,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:42:48,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2023-11-29 04:42:48,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 144 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:42:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2023-11-29 04:42:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:42:53,298 INFO L124 PetriNetUnfolderBase]: 26020/38886 cut-off events. [2023-11-29 04:42:53,298 INFO L125 PetriNetUnfolderBase]: For 13336/13462 co-relation queries the response was YES. [2023-11-29 04:42:53,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85540 conditions, 38886 events. 26020/38886 cut-off events. For 13336/13462 co-relation queries the response was YES. Maximal size of possible extension queue 1315. Compared 278279 event pairs, 16559 based on Foata normal form. 572/34030 useless extension candidates. Maximal degree in co-relation 85516. Up to 26149 conditions per place. [2023-11-29 04:42:53,806 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 58 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2023-11-29 04:42:53,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 162 transitions, 762 flow [2023-11-29 04:42:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:42:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:42:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-29 04:42:53,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024096385542169 [2023-11-29 04:42:53,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-29 04:42:53,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-29 04:42:53,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:42:53,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-29 04:42:53,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 04:42:53,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:53,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:42:53,820 INFO L175 Difference]: Start difference. First operand has 111 places, 144 transitions, 594 flow. Second operand 3 states and 150 transitions. [2023-11-29 04:42:53,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 162 transitions, 762 flow [2023-11-29 04:42:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 760 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 04:42:53,938 INFO L231 Difference]: Finished difference. Result has 111 places, 143 transitions, 599 flow [2023-11-29 04:42:53,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=111, PETRI_TRANSITIONS=143} [2023-11-29 04:42:53,939 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 32 predicate places. [2023-11-29 04:42:53,940 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 143 transitions, 599 flow [2023-11-29 04:42:53,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:42:53,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:42:53,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:53,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:42:53,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:42:53,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash -684797070, now seen corresponding path program 3 times [2023-11-29 04:42:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:42:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826750250] [2023-11-29 04:42:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:42:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:42:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:42:54,972 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 04:42:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:42:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826750250] [2023-11-29 04:42:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826750250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:42:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:42:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:42:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759206494] [2023-11-29 04:42:54,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:42:54,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:42:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:42:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:42:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:42:55,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:42:55,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 143 transitions, 599 flow. Second operand has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:42:55,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:42:55,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:42:55,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:43:07,837 INFO L124 PetriNetUnfolderBase]: 93061/121383 cut-off events. [2023-11-29 04:43:07,838 INFO L125 PetriNetUnfolderBase]: For 112872/112872 co-relation queries the response was YES. [2023-11-29 04:43:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328815 conditions, 121383 events. 93061/121383 cut-off events. For 112872/112872 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 667918 event pairs, 33327 based on Foata normal form. 1/118222 useless extension candidates. Maximal degree in co-relation 226975. Up to 100355 conditions per place. [2023-11-29 04:43:08,839 INFO L140 encePairwiseOnDemand]: 64/83 looper letters, 365 selfloop transitions, 90 changer transitions 64/528 dead transitions. [2023-11-29 04:43:08,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 528 transitions, 2888 flow [2023-11-29 04:43:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 04:43:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-11-29 04:43:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 954 transitions. [2023-11-29 04:43:08,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33805811481218995 [2023-11-29 04:43:08,845 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 954 transitions. [2023-11-29 04:43:08,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 954 transitions. [2023-11-29 04:43:08,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:43:08,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 954 transitions. [2023-11-29 04:43:08,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 28.058823529411764) internal successors, (954), 34 states have internal predecessors, (954), 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 04:43:08,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 83.0) internal successors, (2905), 35 states have internal predecessors, (2905), 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 04:43:08,856 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 83.0) internal successors, (2905), 35 states have internal predecessors, (2905), 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 04:43:08,856 INFO L175 Difference]: Start difference. First operand has 111 places, 143 transitions, 599 flow. Second operand 34 states and 954 transitions. [2023-11-29 04:43:08,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 528 transitions, 2888 flow [2023-11-29 04:43:10,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 528 transitions, 2876 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:43:10,387 INFO L231 Difference]: Finished difference. Result has 161 places, 232 transitions, 1319 flow [2023-11-29 04:43:10,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1319, PETRI_PLACES=161, PETRI_TRANSITIONS=232} [2023-11-29 04:43:10,388 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 82 predicate places. [2023-11-29 04:43:10,388 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 232 transitions, 1319 flow [2023-11-29 04:43:10,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:43:10,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:43:10,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:10,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:43:10,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:43:10,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1602263642, now seen corresponding path program 4 times [2023-11-29 04:43:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580088639] [2023-11-29 04:43:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:10,477 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 04:43:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580088639] [2023-11-29 04:43:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580088639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:10,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:43:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589708854] [2023-11-29 04:43:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:10,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:43:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:43:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:43:10,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2023-11-29 04:43:10,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 232 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:43:10,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:43:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2023-11-29 04:43:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:43:14,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [30#L102-4true, 18#L154true, 107#true, 190#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), 21#L59true, Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), 82#L129true, Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 75#L193-4true, 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), 38#L166-1true, Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,119 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:43:14,119 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:43:14,120 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:43:14,120 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:43:14,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [30#L102-4true, 18#L154true, 107#true, 190#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), 21#L59true, Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), 82#L129true, Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), 10#L194-1true, Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), 38#L166-1true, Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,278 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,279 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,279 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,279 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [30#L102-4true, 107#true, 190#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), 82#L129true, Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 75#L193-4true, 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), 38#L166-1true, Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), 25#L66true, Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), 13#L151true, Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,532 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,532 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,532 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,532 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [42#L103-1true, 18#L154true, 190#true, 107#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), 21#L59true, Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), 82#L129true, Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 75#L193-4true, 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), 38#L166-1true, Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,571 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,571 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,571 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,571 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:43:14,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [30#L102-4true, 190#true, 107#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), 82#L129true, Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), 10#L194-1true, Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), 38#L166-1true, Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), 25#L66true, Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), 13#L151true, Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,654 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,654 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,654 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,654 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [42#L103-1true, 18#L154true, 107#true, 190#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), 21#L59true, Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), 82#L129true, Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), 10#L194-1true, 38#L166-1true, Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,687 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,687 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,687 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,687 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [42#L103-1true, 190#true, 107#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), 82#L129true, Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 75#L193-4true, 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), 38#L166-1true, Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), 25#L66true, Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), 13#L151true, Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,732 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,732 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,732 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,733 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:43:14,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L126-->L129: Formula: (= (+ v_~temp_10~0_2 1) v_~y_7~0_3) InVars {~temp_10~0=v_~temp_10~0_2} OutVars{~temp_10~0=v_~temp_10~0_2, ~y_7~0=v_~y_7~0_3} AuxVars[] AssignedVars[~y_7~0][108], [42#L103-1true, 190#true, 107#true, Black: 251#(and (= ~x_6~0 1) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), Black: 229#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_10~0 0)), Black: 233#(and (= ~x_0~0 ~x_6~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 243#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 259#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 215#(and (= ~y_1~0 0) (or (= ~x_0~0 1) (not (= ~x_6~0 0))) (= ~y_7~0 0) (or (= ~temp_4~0 0) (not (= ~x_6~0 0)))), Black: 239#(and (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~y_1~0 1) (= ~temp_5~0 0)), Black: 219#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_10~0 0)), Black: 217#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1)), Black: 211#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 265#(and (= ~x_0~0 ~x_6~0) (= ~y_1~0 ~y_7~0) (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 227#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), Black: 231#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_11~0 0) (= ~temp_5~0 0)), Black: 257#(and (= ~temp_10~0 ~y_1~0) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_6~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 198#(and (= ~y_7~0 1) (= ~x_6~0 0) (= ~x_0~0 1) (= ~temp_5~0 0)), Black: 207#(and (= (+ ~temp_11~0 1) ~x_0~0) (= (+ ~temp_4~0 1) ~y_7~0)), Black: 245#(and (= ~x_6~0 0) (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_5~0 1)), Black: 223#(and (= ~y_1~0 0) (= ~temp_4~0 0) (= ~x_6~0 0) (= ~y_7~0 0) (= ~x_0~0 1) (= ~temp_11~0 0)), 82#L129true, Black: 202#(and (= ~y_1~0 ~y_7~0) (= ~x_0~0 2) (= ~temp_10~0 0)), 37#L91true, Black: 99#(= ~f1_8~0 (* 256 (div ~f1_8~0 256))), 286#true, Black: 132#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 0) (= ~temp_11~0 0)), Black: 104#(= ~f2_3~0 (* 256 (div ~f2_3~0 256))), Black: 110#(and (= ~y_1~0 0) (= ~x_0~0 0) (= ~x_6~0 0) (= ~y_7~0 0)), Black: 164#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~y_1~0 (+ ~y_7~0 1)) (= ~x_0~0 ~x_6~0)), Black: 148#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 118#(and (= ~y_1~0 ~y_7~0) (= (+ ~x_0~0 2) ~x_6~0)), 10#L194-1true, Black: 152#(and (= ~y_7~0 1) (= ~y_1~0 1) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0) (= ~temp_5~0 0)), Black: 158#(and (= ~y_1~0 ~y_7~0) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), 38#L166-1true, Black: 136#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_10~0 0)), 25#L66true, Black: 146#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_5~0 0) (= ~temp_10~0 0)), Black: 140#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 2) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 138#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_0~0 0) (= ~x_6~0 1) (= ~temp_11~0 1) (= ~temp_10~0 0)), Black: 160#(and (= ~y_1~0 (+ ~y_7~0 1)) (= ~temp_4~0 ~y_7~0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 128#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 144#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~temp_11~0 (+ ~x_0~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), 13#L151true, Black: 187#(= (* 256 (div ~f2_9~0 256)) ~f2_9~0)]) [2023-11-29 04:43:14,845 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:43:14,845 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:43:14,845 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:43:14,845 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:43:15,985 INFO L124 PetriNetUnfolderBase]: 29992/44976 cut-off events. [2023-11-29 04:43:15,985 INFO L125 PetriNetUnfolderBase]: For 42663/44792 co-relation queries the response was YES. [2023-11-29 04:43:16,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115223 conditions, 44976 events. 29992/44976 cut-off events. For 42663/44792 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 319954 event pairs, 20219 based on Foata normal form. 586/39432 useless extension candidates. Maximal degree in co-relation 115179. Up to 28315 conditions per place. [2023-11-29 04:43:16,465 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 62 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2023-11-29 04:43:16,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 244 transitions, 1472 flow [2023-11-29 04:43:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:43:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:43:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 04:43:16,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6104417670682731 [2023-11-29 04:43:16,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 04:43:16,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 04:43:16,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:43:16,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 04:43:16,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 04:43:16,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:43:16,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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 04:43:16,470 INFO L175 Difference]: Start difference. First operand has 161 places, 232 transitions, 1319 flow. Second operand 3 states and 152 transitions. [2023-11-29 04:43:16,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 244 transitions, 1472 flow [2023-11-29 04:43:17,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 244 transitions, 1271 flow, removed 99 selfloop flow, removed 3 redundant places. [2023-11-29 04:43:17,170 INFO L231 Difference]: Finished difference. Result has 156 places, 222 transitions, 1084 flow [2023-11-29 04:43:17,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=156, PETRI_TRANSITIONS=222} [2023-11-29 04:43:17,171 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 77 predicate places. [2023-11-29 04:43:17,171 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 222 transitions, 1084 flow [2023-11-29 04:43:17,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 04:43:17,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:43:17,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:17,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:43:17,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:43:17,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1355752238, now seen corresponding path program 5 times [2023-11-29 04:43:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779842267] [2023-11-29 04:43:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:18,031 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 04:43:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779842267] [2023-11-29 04:43:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779842267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:18,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:18,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:43:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573176047] [2023-11-29 04:43:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:18,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:43:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:43:18,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:43:18,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:43:18,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 222 transitions, 1084 flow. Second operand has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:43:18,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:43:18,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:43:18,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:43:32,511 INFO L124 PetriNetUnfolderBase]: 90207/117910 cut-off events. [2023-11-29 04:43:32,511 INFO L125 PetriNetUnfolderBase]: For 255237/255261 co-relation queries the response was YES. [2023-11-29 04:43:33,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371943 conditions, 117910 events. 90207/117910 cut-off events. For 255237/255261 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 637209 event pairs, 31946 based on Foata normal form. 17/114687 useless extension candidates. Maximal degree in co-relation 342040. Up to 95409 conditions per place. [2023-11-29 04:43:33,538 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 394 selfloop transitions, 94 changer transitions 67/564 dead transitions. [2023-11-29 04:43:33,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 564 transitions, 3555 flow [2023-11-29 04:43:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-29 04:43:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-29 04:43:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 838 transitions. [2023-11-29 04:43:33,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3481512255920233 [2023-11-29 04:43:33,543 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 838 transitions. [2023-11-29 04:43:33,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 838 transitions. [2023-11-29 04:43:33,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:43:33,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 838 transitions. [2023-11-29 04:43:33,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 28.896551724137932) internal successors, (838), 29 states have internal predecessors, (838), 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 04:43:33,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 83.0) internal successors, (2490), 30 states have internal predecessors, (2490), 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 04:43:33,552 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 83.0) internal successors, (2490), 30 states have internal predecessors, (2490), 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 04:43:33,552 INFO L175 Difference]: Start difference. First operand has 156 places, 222 transitions, 1084 flow. Second operand 29 states and 838 transitions. [2023-11-29 04:43:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 564 transitions, 3555 flow [2023-11-29 04:43:36,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 564 transitions, 3545 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:43:36,710 INFO L231 Difference]: Finished difference. Result has 195 places, 283 transitions, 1812 flow [2023-11-29 04:43:36,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1812, PETRI_PLACES=195, PETRI_TRANSITIONS=283} [2023-11-29 04:43:36,712 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 116 predicate places. [2023-11-29 04:43:36,712 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 283 transitions, 1812 flow [2023-11-29 04:43:36,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:43:36,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:43:36,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:36,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:43:36,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:43:36,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -665236766, now seen corresponding path program 6 times [2023-11-29 04:43:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:43:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004766559] [2023-11-29 04:43:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:43:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:37,506 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 04:43:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:43:37,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004766559] [2023-11-29 04:43:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004766559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:43:37,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:43:37,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:43:37,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046489130] [2023-11-29 04:43:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:43:37,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:43:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:43:37,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:43:37,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:43:37,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:43:37,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 283 transitions, 1812 flow. Second operand has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:43:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:43:37,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:43:37,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:44:03,520 INFO L124 PetriNetUnfolderBase]: 138391/180826 cut-off events. [2023-11-29 04:44:03,520 INFO L125 PetriNetUnfolderBase]: For 765224/765292 co-relation queries the response was YES. [2023-11-29 04:44:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657140 conditions, 180826 events. 138391/180826 cut-off events. For 765224/765292 co-relation queries the response was YES. Maximal size of possible extension queue 2775. Compared 1033569 event pairs, 39034 based on Foata normal form. 45/175639 useless extension candidates. Maximal degree in co-relation 657076. Up to 118209 conditions per place. [2023-11-29 04:44:05,413 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 1015 selfloop transitions, 339 changer transitions 38/1401 dead transitions. [2023-11-29 04:44:05,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1401 transitions, 10544 flow [2023-11-29 04:44:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-11-29 04:44:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-11-29 04:44:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 2558 transitions. [2023-11-29 04:44:05,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33139007643477136 [2023-11-29 04:44:05,424 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 2558 transitions. [2023-11-29 04:44:05,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 2558 transitions. [2023-11-29 04:44:05,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:44:05,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 2558 transitions. [2023-11-29 04:44:05,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 27.50537634408602) internal successors, (2558), 93 states have internal predecessors, (2558), 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 04:44:05,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 83.0) internal successors, (7802), 94 states have internal predecessors, (7802), 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 04:44:05,450 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 83.0) internal successors, (7802), 94 states have internal predecessors, (7802), 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 04:44:05,450 INFO L175 Difference]: Start difference. First operand has 195 places, 283 transitions, 1812 flow. Second operand 93 states and 2558 transitions. [2023-11-29 04:44:05,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1401 transitions, 10544 flow [2023-11-29 04:44:53,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1401 transitions, 10292 flow, removed 90 selfloop flow, removed 5 redundant places. [2023-11-29 04:44:53,295 INFO L231 Difference]: Finished difference. Result has 309 places, 640 transitions, 6367 flow [2023-11-29 04:44:53,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=6367, PETRI_PLACES=309, PETRI_TRANSITIONS=640} [2023-11-29 04:44:53,296 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 230 predicate places. [2023-11-29 04:44:53,296 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 640 transitions, 6367 flow [2023-11-29 04:44:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:44:53,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:44:53,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:44:53,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:44:53,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:44:53,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:44:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -327370190, now seen corresponding path program 7 times [2023-11-29 04:44:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:44:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620651696] [2023-11-29 04:44:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:44:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:44:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:44:54,031 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 04:44:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:44:54,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620651696] [2023-11-29 04:44:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620651696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:44:54,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:44:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 04:44:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613061808] [2023-11-29 04:44:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:44:54,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:44:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:44:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:44:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:44:54,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:44:54,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 640 transitions, 6367 flow. Second operand has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:44:54,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:44:54,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:44:54,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:45:38,752 INFO L124 PetriNetUnfolderBase]: 173205/226454 cut-off events. [2023-11-29 04:45:38,752 INFO L125 PetriNetUnfolderBase]: For 2089854/2089878 co-relation queries the response was YES. [2023-11-29 04:45:40,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982992 conditions, 226454 events. 173205/226454 cut-off events. For 2089854/2089878 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 1332120 event pairs, 53003 based on Foata normal form. 17/219958 useless extension candidates. Maximal degree in co-relation 982889. Up to 177521 conditions per place. [2023-11-29 04:45:41,657 INFO L140 encePairwiseOnDemand]: 64/83 looper letters, 1175 selfloop transitions, 323 changer transitions 38/1545 dead transitions. [2023-11-29 04:45:41,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1545 transitions, 15839 flow [2023-11-29 04:45:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-29 04:45:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-11-29 04:45:41,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 2007 transitions. [2023-11-29 04:45:41,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340573561853046 [2023-11-29 04:45:41,662 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 2007 transitions. [2023-11-29 04:45:41,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 2007 transitions. [2023-11-29 04:45:41,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:45:41,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 2007 transitions. [2023-11-29 04:45:41,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 28.267605633802816) internal successors, (2007), 71 states have internal predecessors, (2007), 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 04:45:41,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 83.0) internal successors, (5976), 72 states have internal predecessors, (5976), 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 04:45:41,673 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 83.0) internal successors, (5976), 72 states have internal predecessors, (5976), 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 04:45:41,673 INFO L175 Difference]: Start difference. First operand has 309 places, 640 transitions, 6367 flow. Second operand 71 states and 2007 transitions. [2023-11-29 04:45:41,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1545 transitions, 15839 flow [2023-11-29 04:50:59,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1545 transitions, 13167 flow, removed 1317 selfloop flow, removed 3 redundant places. [2023-11-29 04:50:59,218 INFO L231 Difference]: Finished difference. Result has 396 places, 907 transitions, 8361 flow [2023-11-29 04:50:59,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=3773, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8361, PETRI_PLACES=396, PETRI_TRANSITIONS=907} [2023-11-29 04:50:59,219 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 317 predicate places. [2023-11-29 04:50:59,220 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 907 transitions, 8361 flow [2023-11-29 04:50:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.55) internal successors, (351), 20 states have internal predecessors, (351), 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 04:50:59,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:50:59,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:59,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:50:59,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 04:50:59,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 723874338, now seen corresponding path program 8 times [2023-11-29 04:50:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:50:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502927562] [2023-11-29 04:50:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:50:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:59,711 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 04:50:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:50:59,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502927562] [2023-11-29 04:50:59,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502927562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:50:59,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:50:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-29 04:50:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661262599] [2023-11-29 04:50:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:50:59,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:50:59,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:50:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:50:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2023-11-29 04:50:59,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2023-11-29 04:50:59,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 907 transitions, 8361 flow. Second operand has 19 states, 19 states have (on average 17.68421052631579) internal successors, (336), 19 states have internal predecessors, (336), 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 04:50:59,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:50:59,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2023-11-29 04:50:59,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand