./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/mult-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/mult-dist.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:15:11,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:15:11,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:15:11,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:15:11,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:15:11,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:15:11,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:15:11,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:15:11,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:15:11,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:15:11,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:15:11,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:15:11,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:15:11,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:15:11,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:15:11,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:15:11,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:15:11,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:15:11,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:15:11,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:15:11,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:15:11,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:15:11,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:15:11,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:15:11,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:15:11,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:15:11,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:15:11,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:15:11,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:15:11,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:15:11,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:15:11,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:15:11,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:15:11,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:15:11,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:15:11,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:15:11,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:15:11,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:15:11,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:15:11,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:15:11,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:15:11,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:15:11,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:15:11,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:15:11,723 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:15:11,723 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:15:11,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:15:11,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:15:11,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:15:11,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:15:11,725 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:15:11,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:15:11,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:15:11,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:15:11,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:15:11,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:15:11,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:15:11,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:15:11,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:15:11,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:15:11,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:15:11,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:15:11,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:15:11,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:15:11,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:15:11,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:15:11,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:15:11,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:15:11,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:15:11,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:15:11,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:15:11,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:15:11,731 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:15:11,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:15:11,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:15:11,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/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_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22a326532494b0b5126a81d8882f3e958ed0a5a46e6da0f77df1a4da18ba846 [2022-11-20 12:15:11,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:15:12,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:15:12,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:15:12,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:15:12,037 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:15:12,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/mult-dist.wvr.c [2022-11-20 12:15:15,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:15:15,425 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:15:15,425 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/sv-benchmarks/c/weaver/mult-dist.wvr.c [2022-11-20 12:15:15,461 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/data/688de986f/f918071f7b1d4469b73f7cdb64e66473/FLAG402e2e86f [2022-11-20 12:15:15,481 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/data/688de986f/f918071f7b1d4469b73f7cdb64e66473 [2022-11-20 12:15:15,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:15:15,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:15:15,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:15:15,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:15:15,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:15:15,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d66e861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15, skipping insertion in model container [2022-11-20 12:15:15,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:15:15,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:15:15,718 WARN L237 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_b71dec5d-ec27-45c9-a83e-143d316fad4b/sv-benchmarks/c/weaver/mult-dist.wvr.c[2116,2129] [2022-11-20 12:15:15,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:15:15,734 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:15:15,757 WARN L237 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_b71dec5d-ec27-45c9-a83e-143d316fad4b/sv-benchmarks/c/weaver/mult-dist.wvr.c[2116,2129] [2022-11-20 12:15:15,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:15:15,773 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:15:15,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15 WrapperNode [2022-11-20 12:15:15,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:15:15,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:15:15,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:15:15,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:15:15,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,809 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-11-20 12:15:15,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:15:15,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:15:15,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:15:15,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:15:15,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,834 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:15:15,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:15:15,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:15:15,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:15:15,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (1/1) ... [2022-11-20 12:15:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:15:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:15,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:15:15,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:15:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:15:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 12:15:15,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 12:15:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 12:15:15,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 12:15:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 12:15:15,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 12:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:15:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:15:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:15:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:15:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:15:15,918 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:15:16,015 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:15:16,017 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:15:16,338 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:15:16,347 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:15:16,348 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 12:15:16,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:16 BoogieIcfgContainer [2022-11-20 12:15:16,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:15:16,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:15:16,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:15:16,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:15:16,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:15:15" (1/3) ... [2022-11-20 12:15:16,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72734535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:16, skipping insertion in model container [2022-11-20 12:15:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:15" (2/3) ... [2022-11-20 12:15:16,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72734535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:16, skipping insertion in model container [2022-11-20 12:15:16,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:16" (3/3) ... [2022-11-20 12:15:16,376 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2022-11-20 12:15:16,385 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:15:16,412 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:15:16,413 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:15:16,413 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:15:16,505 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 12:15:16,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2022-11-20 12:15:16,606 INFO L130 PetriNetUnfolder]: 7/104 cut-off events. [2022-11-20 12:15:16,606 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:15:16,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 7/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-11-20 12:15:16,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 238 flow [2022-11-20 12:15:16,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 204 flow [2022-11-20 12:15:16,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:15:16,655 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e469d50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:15:16,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 12:15:16,728 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-11-20 12:15:16,728 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 12:15:16,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:16,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:16,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 683718309, now seen corresponding path program 1 times [2022-11-20 12:15:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060992310] [2022-11-20 12:15:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:17,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060992310] [2022-11-20 12:15:17,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060992310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:15:17,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:15:17,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:15:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299654828] [2022-11-20 12:15:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:17,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:15:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:15:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:15:17,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2022-11-20 12:15:17,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:17,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:17,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2022-11-20 12:15:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:17,258 INFO L130 PetriNetUnfolder]: 3/89 cut-off events. [2022-11-20 12:15:17,258 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-20 12:15:17,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 89 events. 3/89 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 10/95 useless extension candidates. Maximal degree in co-relation 66. Up to 7 conditions per place. [2022-11-20 12:15:17,261 INFO L137 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 0 changer transitions 1/89 dead transitions. [2022-11-20 12:15:17,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 208 flow [2022-11-20 12:15:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:15:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 12:15:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-11-20 12:15:17,274 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2022-11-20 12:15:17,275 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2022-11-20 12:15:17,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2022-11-20 12:15:17,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:17,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2022-11-20 12:15:17,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:17,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:17,287 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:17,289 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 204 flow. Second operand 2 states and 202 transitions. [2022-11-20 12:15:17,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 208 flow [2022-11-20 12:15:17,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 12:15:17,296 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 182 flow [2022-11-20 12:15:17,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2022-11-20 12:15:17,303 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2022-11-20 12:15:17,303 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 182 flow [2022-11-20 12:15:17,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:17,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:17,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:17,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:15:17,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1955065448, now seen corresponding path program 1 times [2022-11-20 12:15:17,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:17,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815647737] [2022-11-20 12:15:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:18,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815647737] [2022-11-20 12:15:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815647737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:15:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:15:18,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:15:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69842192] [2022-11-20 12:15:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:18,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:15:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:18,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:15:18,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:15:18,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2022-11-20 12:15:18,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:18,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:18,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2022-11-20 12:15:18,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:18,541 INFO L130 PetriNetUnfolder]: 53/322 cut-off events. [2022-11-20 12:15:18,554 INFO L131 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-11-20 12:15:18,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 322 events. 53/322 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1278 event pairs, 7 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2022-11-20 12:15:18,558 INFO L137 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2022-11-20 12:15:18,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 354 flow [2022-11-20 12:15:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:15:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:15:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2022-11-20 12:15:18,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2022-11-20 12:15:18,567 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2022-11-20 12:15:18,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2022-11-20 12:15:18,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:18,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2022-11-20 12:15:18,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:18,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:18,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:18,583 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 182 flow. Second operand 7 states and 644 transitions. [2022-11-20 12:15:18,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 354 flow [2022-11-20 12:15:18,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:15:18,591 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 235 flow [2022-11-20 12:15:18,592 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2022-11-20 12:15:18,592 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2022-11-20 12:15:18,594 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 235 flow [2022-11-20 12:15:18,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:18,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:18,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:18,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:15:18,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -804793571, now seen corresponding path program 1 times [2022-11-20 12:15:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:18,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869198400] [2022-11-20 12:15:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:19,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869198400] [2022-11-20 12:15:19,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869198400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:15:19,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:15:19,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:15:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414255194] [2022-11-20 12:15:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:19,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:15:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:15:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:15:19,125 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:15:19,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:19,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:19,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:15:19,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:20,040 INFO L130 PetriNetUnfolder]: 1426/3119 cut-off events. [2022-11-20 12:15:20,040 INFO L131 PetriNetUnfolder]: For 250/251 co-relation queries the response was YES. [2022-11-20 12:15:20,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 3119 events. 1426/3119 cut-off events. For 250/251 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23906 event pairs, 714 based on Foata normal form. 0/2590 useless extension candidates. Maximal degree in co-relation 5794. Up to 1285 conditions per place. [2022-11-20 12:15:20,073 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 61 selfloop transitions, 9 changer transitions 5/144 dead transitions. [2022-11-20 12:15:20,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 497 flow [2022-11-20 12:15:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:15:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:15:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 770 transitions. [2022-11-20 12:15:20,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2022-11-20 12:15:20,078 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 770 transitions. [2022-11-20 12:15:20,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 770 transitions. [2022-11-20 12:15:20,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:20,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 770 transitions. [2022-11-20 12:15:20,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:20,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:20,087 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:20,087 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 235 flow. Second operand 9 states and 770 transitions. [2022-11-20 12:15:20,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 497 flow [2022-11-20 12:15:20,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 493 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-20 12:15:20,097 INFO L231 Difference]: Finished difference. Result has 109 places, 99 transitions, 285 flow [2022-11-20 12:15:20,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=109, PETRI_TRANSITIONS=99} [2022-11-20 12:15:20,101 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 13 predicate places. [2022-11-20 12:15:20,101 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 99 transitions, 285 flow [2022-11-20 12:15:20,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:20,102 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:20,102 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:20,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:15:20,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1347634693, now seen corresponding path program 2 times [2022-11-20 12:15:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169856443] [2022-11-20 12:15:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:20,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169856443] [2022-11-20 12:15:20,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169856443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:20,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549349812] [2022-11-20 12:15:20,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:15:20,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:20,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:20,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:15:20,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:15:20,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:15:20,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:15:20,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:21,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:28,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549349812] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:28,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:15:28,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2022-11-20 12:15:28,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543254370] [2022-11-20 12:15:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:15:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:15:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:15:28,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:15:28,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 99 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:28,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:28,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:15:28,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:29,078 INFO L130 PetriNetUnfolder]: 1398/3281 cut-off events. [2022-11-20 12:15:29,079 INFO L131 PetriNetUnfolder]: For 1786/1876 co-relation queries the response was YES. [2022-11-20 12:15:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 3281 events. 1398/3281 cut-off events. For 1786/1876 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27315 event pairs, 270 based on Foata normal form. 5/3214 useless extension candidates. Maximal degree in co-relation 7316. Up to 392 conditions per place. [2022-11-20 12:15:29,125 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 101 selfloop transitions, 26 changer transitions 1/200 dead transitions. [2022-11-20 12:15:29,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 895 flow [2022-11-20 12:15:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:15:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:15:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 917 transitions. [2022-11-20 12:15:29,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8570093457943925 [2022-11-20 12:15:29,143 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 917 transitions. [2022-11-20 12:15:29,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 917 transitions. [2022-11-20 12:15:29,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:29,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 917 transitions. [2022-11-20 12:15:29,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.7) internal successors, (917), 10 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:29,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:29,150 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:29,151 INFO L175 Difference]: Start difference. First operand has 109 places, 99 transitions, 285 flow. Second operand 10 states and 917 transitions. [2022-11-20 12:15:29,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 895 flow [2022-11-20 12:15:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 200 transitions, 864 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-20 12:15:29,165 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 501 flow [2022-11-20 12:15:29,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=501, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2022-11-20 12:15:29,168 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2022-11-20 12:15:29,168 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 501 flow [2022-11-20 12:15:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:29,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:29,169 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:29,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 12:15:29,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:29,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1337214113, now seen corresponding path program 3 times [2022-11-20 12:15:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:29,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040403644] [2022-11-20 12:15:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040403644] [2022-11-20 12:15:29,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040403644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477360147] [2022-11-20 12:15:29,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:15:29,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:29,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:29,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:15:29,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:15:29,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:15:29,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:15:29,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:30,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:33,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477360147] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:33,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:15:33,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2022-11-20 12:15:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846453646] [2022-11-20 12:15:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:33,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:15:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:15:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:15:33,334 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:15:33,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:33,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:33,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:15:33,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:34,277 INFO L130 PetriNetUnfolder]: 1917/4174 cut-off events. [2022-11-20 12:15:34,277 INFO L131 PetriNetUnfolder]: For 7416/7509 co-relation queries the response was YES. [2022-11-20 12:15:34,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12244 conditions, 4174 events. 1917/4174 cut-off events. For 7416/7509 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 36207 event pairs, 482 based on Foata normal form. 4/4022 useless extension candidates. Maximal degree in co-relation 12225. Up to 843 conditions per place. [2022-11-20 12:15:34,327 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 118 selfloop transitions, 37 changer transitions 1/228 dead transitions. [2022-11-20 12:15:34,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 228 transitions, 1400 flow [2022-11-20 12:15:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:15:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:15:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 822 transitions. [2022-11-20 12:15:34,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8535825545171339 [2022-11-20 12:15:34,331 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 822 transitions. [2022-11-20 12:15:34,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 822 transitions. [2022-11-20 12:15:34,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:34,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 822 transitions. [2022-11-20 12:15:34,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:34,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:34,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:34,336 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 501 flow. Second operand 9 states and 822 transitions. [2022-11-20 12:15:34,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 228 transitions, 1400 flow [2022-11-20 12:15:34,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 228 transitions, 1394 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-20 12:15:34,364 INFO L231 Difference]: Finished difference. Result has 136 places, 151 transitions, 859 flow [2022-11-20 12:15:34,365 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=859, PETRI_PLACES=136, PETRI_TRANSITIONS=151} [2022-11-20 12:15:34,366 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 40 predicate places. [2022-11-20 12:15:34,366 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 151 transitions, 859 flow [2022-11-20 12:15:34,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:34,366 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:34,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:34,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:15:34,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:34,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2018625659, now seen corresponding path program 4 times [2022-11-20 12:15:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:34,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429577972] [2022-11-20 12:15:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429577972] [2022-11-20 12:15:34,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429577972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:15:34,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:15:34,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:15:34,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027021467] [2022-11-20 12:15:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:15:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:15:34,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:15:34,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:15:34,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 151 transitions, 859 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:34,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:34,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:15:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:36,357 INFO L130 PetriNetUnfolder]: 3579/7945 cut-off events. [2022-11-20 12:15:36,357 INFO L131 PetriNetUnfolder]: For 21078/21085 co-relation queries the response was YES. [2022-11-20 12:15:36,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24748 conditions, 7945 events. 3579/7945 cut-off events. For 21078/21085 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 73832 event pairs, 1537 based on Foata normal form. 4/7748 useless extension candidates. Maximal degree in co-relation 24722. Up to 2278 conditions per place. [2022-11-20 12:15:36,573 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 135 selfloop transitions, 39 changer transitions 5/248 dead transitions. [2022-11-20 12:15:36,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 248 transitions, 1882 flow [2022-11-20 12:15:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:15:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:15:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 849 transitions. [2022-11-20 12:15:36,577 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7934579439252336 [2022-11-20 12:15:36,578 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 849 transitions. [2022-11-20 12:15:36,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 849 transitions. [2022-11-20 12:15:36,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:36,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 849 transitions. [2022-11-20 12:15:36,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.9) internal successors, (849), 10 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:36,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:36,583 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:36,585 INFO L175 Difference]: Start difference. First operand has 136 places, 151 transitions, 859 flow. Second operand 10 states and 849 transitions. [2022-11-20 12:15:36,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 248 transitions, 1882 flow [2022-11-20 12:15:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 248 transitions, 1864 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-11-20 12:15:36,715 INFO L231 Difference]: Finished difference. Result has 150 places, 162 transitions, 1116 flow [2022-11-20 12:15:36,715 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1116, PETRI_PLACES=150, PETRI_TRANSITIONS=162} [2022-11-20 12:15:36,718 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 54 predicate places. [2022-11-20 12:15:36,718 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 162 transitions, 1116 flow [2022-11-20 12:15:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:36,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:36,719 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:15:36,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1332461693, now seen corresponding path program 5 times [2022-11-20 12:15:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:36,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126914924] [2022-11-20 12:15:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:37,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:37,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126914924] [2022-11-20 12:15:37,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126914924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:37,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211368639] [2022-11-20 12:15:37,170 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 12:15:37,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:37,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:37,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:37,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:15:37,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:15:37,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:15:37,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:15:37,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:37,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211368639] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:39,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:15:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 10] total 17 [2022-11-20 12:15:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428584074] [2022-11-20 12:15:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:39,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:15:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:15:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:15:39,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:15:39,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 162 transitions, 1116 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:39,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:39,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:15:39,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:40,411 INFO L130 PetriNetUnfolder]: 2416/5311 cut-off events. [2022-11-20 12:15:40,411 INFO L131 PetriNetUnfolder]: For 22231/22382 co-relation queries the response was YES. [2022-11-20 12:15:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19172 conditions, 5311 events. 2416/5311 cut-off events. For 22231/22382 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 48475 event pairs, 661 based on Foata normal form. 4/5135 useless extension candidates. Maximal degree in co-relation 19140. Up to 1109 conditions per place. [2022-11-20 12:15:40,672 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 125 selfloop transitions, 44 changer transitions 2/243 dead transitions. [2022-11-20 12:15:40,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 243 transitions, 1948 flow [2022-11-20 12:15:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:15:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:15:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2022-11-20 12:15:40,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8556593977154725 [2022-11-20 12:15:40,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 824 transitions. [2022-11-20 12:15:40,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 824 transitions. [2022-11-20 12:15:40,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:40,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 824 transitions. [2022-11-20 12:15:40,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:40,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:40,688 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:40,689 INFO L175 Difference]: Start difference. First operand has 150 places, 162 transitions, 1116 flow. Second operand 9 states and 824 transitions. [2022-11-20 12:15:40,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 243 transitions, 1948 flow [2022-11-20 12:15:40,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 243 transitions, 1891 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-20 12:15:40,776 INFO L231 Difference]: Finished difference. Result has 156 places, 168 transitions, 1253 flow [2022-11-20 12:15:40,777 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1253, PETRI_PLACES=156, PETRI_TRANSITIONS=168} [2022-11-20 12:15:40,778 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 60 predicate places. [2022-11-20 12:15:40,778 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 168 transitions, 1253 flow [2022-11-20 12:15:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:40,779 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:40,779 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:40,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:15:40,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:15:40,986 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash -384661715, now seen corresponding path program 6 times [2022-11-20 12:15:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:40,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919868188] [2022-11-20 12:15:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:41,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:41,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919868188] [2022-11-20 12:15:41,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919868188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:41,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635229439] [2022-11-20 12:15:41,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 12:15:41,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:41,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:41,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:15:41,600 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-20 12:15:41,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:15:41,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:15:41,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:42,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:48,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635229439] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:48,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:15:48,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 13 [2022-11-20 12:15:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239922955] [2022-11-20 12:15:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:15:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:15:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:15:48,816 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:15:48,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 168 transitions, 1253 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:48,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:48,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:15:48,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:50,262 INFO L130 PetriNetUnfolder]: 2397/5380 cut-off events. [2022-11-20 12:15:50,263 INFO L131 PetriNetUnfolder]: For 26053/26205 co-relation queries the response was YES. [2022-11-20 12:15:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19679 conditions, 5380 events. 2397/5380 cut-off events. For 26053/26205 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 49054 event pairs, 627 based on Foata normal form. 5/5207 useless extension candidates. Maximal degree in co-relation 19644. Up to 1074 conditions per place. [2022-11-20 12:15:50,349 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 116 selfloop transitions, 51 changer transitions 2/241 dead transitions. [2022-11-20 12:15:50,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 241 transitions, 2064 flow [2022-11-20 12:15:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:15:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:15:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 822 transitions. [2022-11-20 12:15:50,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8535825545171339 [2022-11-20 12:15:50,353 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 822 transitions. [2022-11-20 12:15:50,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 822 transitions. [2022-11-20 12:15:50,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:50,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 822 transitions. [2022-11-20 12:15:50,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:50,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:50,358 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:50,358 INFO L175 Difference]: Start difference. First operand has 156 places, 168 transitions, 1253 flow. Second operand 9 states and 822 transitions. [2022-11-20 12:15:50,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 241 transitions, 2064 flow [2022-11-20 12:15:50,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 241 transitions, 2032 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-20 12:15:50,481 INFO L231 Difference]: Finished difference. Result has 165 places, 171 transitions, 1404 flow [2022-11-20 12:15:50,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1404, PETRI_PLACES=165, PETRI_TRANSITIONS=171} [2022-11-20 12:15:50,485 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 69 predicate places. [2022-11-20 12:15:50,485 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 171 transitions, 1404 flow [2022-11-20 12:15:50,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:50,486 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:50,486 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:50,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:15:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 12:15:50,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 821778523, now seen corresponding path program 1 times [2022-11-20 12:15:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569733962] [2022-11-20 12:15:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569733962] [2022-11-20 12:15:50,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569733962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:50,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724241784] [2022-11-20 12:15:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:50,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:50,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:50,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:51,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:15:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:51,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:15:51,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:51,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724241784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:15:51,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:15:51,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-20 12:15:51,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840026326] [2022-11-20 12:15:51,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:15:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:15:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:15:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:15:51,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:15:51,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 171 transitions, 1404 flow. Second operand has 14 states, 14 states have (on average 79.42857142857143) internal successors, (1112), 14 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:51,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:51,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:15:51,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:15:53,438 INFO L130 PetriNetUnfolder]: 4394/9327 cut-off events. [2022-11-20 12:15:53,438 INFO L131 PetriNetUnfolder]: For 46724/46727 co-relation queries the response was YES. [2022-11-20 12:15:53,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34140 conditions, 9327 events. 4394/9327 cut-off events. For 46724/46727 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 86812 event pairs, 625 based on Foata normal form. 29/9202 useless extension candidates. Maximal degree in co-relation 34102. Up to 1623 conditions per place. [2022-11-20 12:15:53,567 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 269 selfloop transitions, 91 changer transitions 5/434 dead transitions. [2022-11-20 12:15:53,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 434 transitions, 4566 flow [2022-11-20 12:15:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:15:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 12:15:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1399 transitions. [2022-11-20 12:15:53,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8171728971962616 [2022-11-20 12:15:53,572 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1399 transitions. [2022-11-20 12:15:53,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1399 transitions. [2022-11-20 12:15:53,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:15:53,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1399 transitions. [2022-11-20 12:15:53,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.4375) internal successors, (1399), 16 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:53,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:53,580 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:53,580 INFO L175 Difference]: Start difference. First operand has 165 places, 171 transitions, 1404 flow. Second operand 16 states and 1399 transitions. [2022-11-20 12:15:53,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 434 transitions, 4566 flow [2022-11-20 12:15:53,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 434 transitions, 4430 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-20 12:15:53,823 INFO L231 Difference]: Finished difference. Result has 187 places, 235 transitions, 2297 flow [2022-11-20 12:15:53,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2297, PETRI_PLACES=187, PETRI_TRANSITIONS=235} [2022-11-20 12:15:53,825 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 91 predicate places. [2022-11-20 12:15:53,825 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 235 transitions, 2297 flow [2022-11-20 12:15:53,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.42857142857143) internal successors, (1112), 14 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:53,826 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:15:53,826 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:15:53,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:15:54,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:54,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:15:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:15:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 557732247, now seen corresponding path program 2 times [2022-11-20 12:15:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:15:54,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805412287] [2022-11-20 12:15:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:15:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:15:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:15:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:15:54,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805412287] [2022-11-20 12:15:54,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805412287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:54,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668237330] [2022-11-20 12:15:54,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:15:54,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:15:54,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:15:54,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:15:54,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:15:54,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:15:54,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:15:54,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:15:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:15:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:54,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:15:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:15:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668237330] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:15:59,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:15:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 10] total 16 [2022-11-20 12:15:59,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084674453] [2022-11-20 12:15:59,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:15:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:15:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:15:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:15:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:15:59,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:15:59,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 235 transitions, 2297 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:15:59,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:15:59,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:15:59,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:00,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][361], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 116#true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), 17#L41-4true]) [2022-11-20 12:16:00,865 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-20 12:16:00,865 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,865 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,866 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][318], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 40#L41-3true, 116#true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)))]) [2022-11-20 12:16:00,866 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,867 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,867 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,867 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,868 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][260], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 116#true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), 17#L41-4true]) [2022-11-20 12:16:00,868 INFO L383 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-11-20 12:16:00,869 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,869 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,869 INFO L386 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2022-11-20 12:16:00,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][288], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, 116#true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)))]) [2022-11-20 12:16:00,870 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,870 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,870 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,870 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-20 12:16:00,924 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][318], [60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 116#true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 69#L42true, Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,925 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][288], [60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 116#true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), 69#L42true, Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,925 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,925 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][361], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 116#true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 41#L41-6true, 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,927 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-20 12:16:00,927 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,927 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,927 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,927 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][260], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), 60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 116#true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 41#L41-6true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,928 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-20 12:16:00,928 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,928 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,928 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-20 12:16:00,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][318], [60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 116#true, 40#L41-3true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,998 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-20 12:16:00,998 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,998 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,998 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][288], [60#L74-4true, Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 116#true, 40#L41-3true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3133#(and (< (mod thread1Thread1of1ForFork1_~i~0 4294967296) (mod ~a~0 4294967296)) (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0)), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:00,999 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-20 12:16:00,999 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:00,999 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:01,000 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 12:16:01,094 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L49-5-->L50: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~b~0_2 4294967296)) InVars {~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~b~0=v_~b~0_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][361], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 1639#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 116#true, 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), 113#true, 88#L75-2true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), 3#L50true, Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:01,095 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L49-5-->L49-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~b~0_1 4294967296))) InVars {~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~b~0=v_~b~0_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][260], [Black: 161#(<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)), Black: 120#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0)), Black: 630#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 637#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296))), Black: 1137#(= thread2Thread1of1ForFork2_~i~1 0), Black: 438#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 119#(and (= ~x_2~0 0) (= ~x_1~0 0)), Black: 1145#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 159#(or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))), Black: 454#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1150#(and (<= 0 (+ (* (div (- ~a~0) 4294967296) 4294967296) ~a~0)) (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1148#(and (<= ~b~0 (* (div ~b~0 4294967296) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 155#true, Black: 635#(and (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), 134#(= thread3Thread1of1ForFork0_~i~2 0), 2412#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)), Black: 146#(and (<= (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0) (+ (* (div ~a~0 4294967296) 4294967296) (* (div ~b~0 4294967296) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L49-6true, 21#L57-3true, Black: 144#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread2Thread1of1ForFork2_~i~1 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 142#(and (<= (+ ~b~0 ~a~0) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296))) (= thread3Thread1of1ForFork0_~i~2 0)), 3131#(and (< (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* (div ~b~0 4294967296) 4294967296)) ~b~0) (<= (+ (* (div ~a~0 4294967296) 4294967296) 1) ~a~0)), 116#true, 113#true, 1163#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 88#L75-2true, Black: 2616#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2618#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0))), Black: 2623#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2136#(= thread1Thread1of1ForFork1_~i~0 0), Black: 2633#(and (<= (div (+ ~b~0 ~a~0) 4294967296) (div (+ (- 1) ~b~0 ~a~0) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2614#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2631#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 2611#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1955#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 2629#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* (div ~a~0 4294967296) 4294967296) thread2Thread1of1ForFork2_~i~1 (* (div ~b~0 4294967296) 4294967296) 1) (+ (* 4294967296 (div thread2Thread1of1ForFork2_~i~1 4294967296)) ~b~0 ~a~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1951#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 2625#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 2627#(and (<= ~a~0 (* (div ~a~0 4294967296) 4294967296)) (< 0 (mod ~b~0 4294967296)) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))), 2125#(and (or (<= (div (+ ~b~0 ~a~0) 4294967296) (+ (div ~b~0 4294967296) (div (+ (- 1) ~a~0) 4294967296))) (<= (+ ~a~0 (* (div ~b~0 4294967296) 4294967296) 1) (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)))) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod (+ ~b~0 ~a~0) 4294967296))), Black: 1127#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1125#(and (< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 971#(< (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296) (* 4294967295 ~a~0)), Black: 1123#(and (or (<= (+ (* 4294967296 (div (+ ~b~0 ~a~0) 4294967296)) 1) (+ ~a~0 (* (div ~b~0 4294967296) 4294967296))) (<= (+ (div ~b~0 4294967296) (div ~a~0 4294967296) 1) (div (+ ~b~0 ~a~0) 4294967296))) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 1643#(and (< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)) (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296))), Black: 967#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0)), Black: 1641#(and (< (mod thread2Thread1of1ForFork2_~i~1 4294967296) (mod ~b~0 4294967296)) (< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0))), Black: 1463#(< (+ (* (div (* 4294967295 ~a~0) 4294967296) 4294967296) (mod thread2Thread1of1ForFork2_~i~1 4294967296)) (* 4294967295 ~a~0)), Black: 1459#(< (+ (mod thread2Thread1of1ForFork2_~i~1 4294967296) (* (div (+ (mod thread3Thread1of1ForFork0_~i~2 4294967296) (* 4294967295 ~a~0)) 4294967296) 4294967296)) (* 4294967295 ~a~0))]) [2022-11-20 12:16:01,095 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,095 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-20 12:16:01,154 INFO L130 PetriNetUnfolder]: 3946/9335 cut-off events. [2022-11-20 12:16:01,154 INFO L131 PetriNetUnfolder]: For 57086/57512 co-relation queries the response was YES. [2022-11-20 12:16:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36708 conditions, 9335 events. 3946/9335 cut-off events. For 57086/57512 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 93188 event pairs, 872 based on Foata normal form. 203/9227 useless extension candidates. Maximal degree in co-relation 36659. Up to 1091 conditions per place. [2022-11-20 12:16:01,278 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 269 selfloop transitions, 74 changer transitions 2/449 dead transitions. [2022-11-20 12:16:01,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 449 transitions, 5218 flow [2022-11-20 12:16:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:16:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:16:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 915 transitions. [2022-11-20 12:16:01,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8551401869158879 [2022-11-20 12:16:01,282 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 915 transitions. [2022-11-20 12:16:01,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 915 transitions. [2022-11-20 12:16:01,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:01,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 915 transitions. [2022-11-20 12:16:01,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:01,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:01,287 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:01,288 INFO L175 Difference]: Start difference. First operand has 187 places, 235 transitions, 2297 flow. Second operand 10 states and 915 transitions. [2022-11-20 12:16:01,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 449 transitions, 5218 flow [2022-11-20 12:16:01,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 449 transitions, 5166 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-11-20 12:16:01,665 INFO L231 Difference]: Finished difference. Result has 204 places, 288 transitions, 3251 flow [2022-11-20 12:16:01,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3251, PETRI_PLACES=204, PETRI_TRANSITIONS=288} [2022-11-20 12:16:01,666 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 108 predicate places. [2022-11-20 12:16:01,667 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 288 transitions, 3251 flow [2022-11-20 12:16:01,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:01,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:16:01,667 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:01,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-20 12:16:01,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 12:16:01,873 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:16:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1984915307, now seen corresponding path program 7 times [2022-11-20 12:16:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:01,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078373598] [2022-11-20 12:16:01,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:01,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:02,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078373598] [2022-11-20 12:16:02,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078373598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:16:02,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243868833] [2022-11-20 12:16:02,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 12:16:02,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:16:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:16:02,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:16:02,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:16:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:02,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:16:02,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:16:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:03,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:16:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243868833] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:16:08,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:16:08,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 14 [2022-11-20 12:16:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076437008] [2022-11-20 12:16:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:08,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:16:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:16:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:16:08,268 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:16:08,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 288 transitions, 3251 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:08,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:16:08,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:16:08,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:10,195 INFO L130 PetriNetUnfolder]: 3948/8773 cut-off events. [2022-11-20 12:16:10,195 INFO L131 PetriNetUnfolder]: For 75747/76150 co-relation queries the response was YES. [2022-11-20 12:16:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39333 conditions, 8773 events. 3948/8773 cut-off events. For 75747/76150 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 85324 event pairs, 869 based on Foata normal form. 123/8632 useless extension candidates. Maximal degree in co-relation 39275. Up to 1575 conditions per place. [2022-11-20 12:16:10,333 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 171 selfloop transitions, 124 changer transitions 2/382 dead transitions. [2022-11-20 12:16:10,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 382 transitions, 4757 flow [2022-11-20 12:16:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:16:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:16:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 822 transitions. [2022-11-20 12:16:10,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8535825545171339 [2022-11-20 12:16:10,342 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 822 transitions. [2022-11-20 12:16:10,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 822 transitions. [2022-11-20 12:16:10,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:10,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 822 transitions. [2022-11-20 12:16:10,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:10,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:10,353 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:10,353 INFO L175 Difference]: Start difference. First operand has 204 places, 288 transitions, 3251 flow. Second operand 9 states and 822 transitions. [2022-11-20 12:16:10,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 382 transitions, 4757 flow [2022-11-20 12:16:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 382 transitions, 4511 flow, removed 94 selfloop flow, removed 2 redundant places. [2022-11-20 12:16:10,869 INFO L231 Difference]: Finished difference. Result has 213 places, 296 transitions, 3563 flow [2022-11-20 12:16:10,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3563, PETRI_PLACES=213, PETRI_TRANSITIONS=296} [2022-11-20 12:16:10,870 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 117 predicate places. [2022-11-20 12:16:10,870 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 296 transitions, 3563 flow [2022-11-20 12:16:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:10,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:16:10,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:10,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:16:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:16:11,077 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:16:11,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1710328175, now seen corresponding path program 8 times [2022-11-20 12:16:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:11,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241303622] [2022-11-20 12:16:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:11,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:11,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241303622] [2022-11-20 12:16:11,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241303622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:11,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:11,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:16:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203678609] [2022-11-20 12:16:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:11,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:16:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:16:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:16:11,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:16:11,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 296 transitions, 3563 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:11,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:16:11,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:16:11,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:13,733 INFO L130 PetriNetUnfolder]: 6244/13285 cut-off events. [2022-11-20 12:16:13,733 INFO L131 PetriNetUnfolder]: For 114460/114506 co-relation queries the response was YES. [2022-11-20 12:16:13,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58664 conditions, 13285 events. 6244/13285 cut-off events. For 114460/114506 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 131731 event pairs, 2369 based on Foata normal form. 6/12846 useless extension candidates. Maximal degree in co-relation 58604. Up to 3934 conditions per place. [2022-11-20 12:16:13,927 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 302 selfloop transitions, 101 changer transitions 6/478 dead transitions. [2022-11-20 12:16:13,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 478 transitions, 6579 flow [2022-11-20 12:16:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:16:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:16:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 700 transitions. [2022-11-20 12:16:13,930 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177570093457944 [2022-11-20 12:16:13,930 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 700 transitions. [2022-11-20 12:16:13,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 700 transitions. [2022-11-20 12:16:13,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:13,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 700 transitions. [2022-11-20 12:16:13,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,936 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:13,936 INFO L175 Difference]: Start difference. First operand has 213 places, 296 transitions, 3563 flow. Second operand 8 states and 700 transitions. [2022-11-20 12:16:13,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 478 transitions, 6579 flow [2022-11-20 12:16:14,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 478 transitions, 6303 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-20 12:16:14,632 INFO L231 Difference]: Finished difference. Result has 221 places, 338 transitions, 4589 flow [2022-11-20 12:16:14,632 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4589, PETRI_PLACES=221, PETRI_TRANSITIONS=338} [2022-11-20 12:16:14,632 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 125 predicate places. [2022-11-20 12:16:14,633 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 338 transitions, 4589 flow [2022-11-20 12:16:14,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:14,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:16:14,633 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:14,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:16:14,633 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:16:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1229500545, now seen corresponding path program 9 times [2022-11-20 12:16:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:14,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904972949] [2022-11-20 12:16:14,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:14,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904972949] [2022-11-20 12:16:14,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904972949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:16:14,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191620760] [2022-11-20 12:16:14,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:16:14,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:16:14,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:16:14,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:16:15,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:16:15,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:16:15,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:16:15,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:16:15,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:16:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:15,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:16:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191620760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:16:29,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:16:29,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2022-11-20 12:16:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559725104] [2022-11-20 12:16:29,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:16:29,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 12:16:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:29,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 12:16:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=179, Unknown=6, NotChecked=0, Total=240 [2022-11-20 12:16:29,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:16:29,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 338 transitions, 4589 flow. Second operand has 16 states, 16 states have (on average 79.5) internal successors, (1272), 16 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:29,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:16:29,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:16:29,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:31,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread3Thread1of1ForFork0_~i~2 4294967296))) (and (let ((.cse0 (* 4294967295 c_~a~0))) (< (* (div (+ .cse0 .cse1) 4294967296) 4294967296) .cse0)) (forall ((aux_mod_~a~0_21 Int)) (or (>= aux_mod_~a~0_21 4294967296) (<= aux_mod_~a~0_21 (mod c_thread1Thread1of1ForFork1_~i~0 4294967296)) (let ((.cse2 (* 4294967295 aux_mod_~a~0_21))) (< (* 4294967296 (div (+ .cse1 .cse2) 4294967296)) .cse2)))))) is different from false [2022-11-20 12:16:37,489 INFO L130 PetriNetUnfolder]: 8997/17699 cut-off events. [2022-11-20 12:16:37,489 INFO L131 PetriNetUnfolder]: For 193962/193991 co-relation queries the response was YES. [2022-11-20 12:16:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88022 conditions, 17699 events. 8997/17699 cut-off events. For 193962/193991 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 166856 event pairs, 2526 based on Foata normal form. 42/17321 useless extension candidates. Maximal degree in co-relation 87959. Up to 11083 conditions per place. [2022-11-20 12:16:37,844 INFO L137 encePairwiseOnDemand]: 88/107 looper letters, 398 selfloop transitions, 219 changer transitions 5/691 dead transitions. [2022-11-20 12:16:37,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 691 transitions, 10397 flow [2022-11-20 12:16:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:16:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-20 12:16:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1468 transitions. [2022-11-20 12:16:37,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8070368334249588 [2022-11-20 12:16:37,848 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1468 transitions. [2022-11-20 12:16:37,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1468 transitions. [2022-11-20 12:16:37,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:37,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1468 transitions. [2022-11-20 12:16:37,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 86.3529411764706) internal successors, (1468), 17 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:37,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:37,858 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:37,858 INFO L175 Difference]: Start difference. First operand has 221 places, 338 transitions, 4589 flow. Second operand 17 states and 1468 transitions. [2022-11-20 12:16:37,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 691 transitions, 10397 flow [2022-11-20 12:16:39,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 691 transitions, 10231 flow, removed 82 selfloop flow, removed 2 redundant places. [2022-11-20 12:16:39,356 INFO L231 Difference]: Finished difference. Result has 244 places, 522 transitions, 7871 flow [2022-11-20 12:16:39,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=4533, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7871, PETRI_PLACES=244, PETRI_TRANSITIONS=522} [2022-11-20 12:16:39,357 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 148 predicate places. [2022-11-20 12:16:39,357 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 522 transitions, 7871 flow [2022-11-20 12:16:39,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 79.5) internal successors, (1272), 16 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:39,358 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:16:39,358 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:39,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:16:39,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:16:39,559 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:16:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1736510689, now seen corresponding path program 3 times [2022-11-20 12:16:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:39,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802118136] [2022-11-20 12:16:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:39,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802118136] [2022-11-20 12:16:39,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802118136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:16:39,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925755593] [2022-11-20 12:16:39,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:16:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:16:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:16:39,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:16:39,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:16:40,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 12:16:40,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:16:40,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 12:16:40,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:16:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:40,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:16:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:41,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925755593] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 12:16:41,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:16:41,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2022-11-20 12:16:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367107227] [2022-11-20 12:16:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:16:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:16:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:16:41,176 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-11-20 12:16:41,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 522 transitions, 7871 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:41,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:16:41,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-11-20 12:16:41,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:45,779 INFO L130 PetriNetUnfolder]: 8167/17763 cut-off events. [2022-11-20 12:16:45,779 INFO L131 PetriNetUnfolder]: For 217253/219477 co-relation queries the response was YES. [2022-11-20 12:16:46,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96657 conditions, 17763 events. 8167/17763 cut-off events. For 217253/219477 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 182073 event pairs, 911 based on Foata normal form. 555/17735 useless extension candidates. Maximal degree in co-relation 96584. Up to 3858 conditions per place. [2022-11-20 12:16:46,213 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 355 selfloop transitions, 346 changer transitions 0/827 dead transitions. [2022-11-20 12:16:46,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 827 transitions, 13427 flow [2022-11-20 12:16:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:16:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 12:16:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 915 transitions. [2022-11-20 12:16:46,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8551401869158879 [2022-11-20 12:16:46,218 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 915 transitions. [2022-11-20 12:16:46,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 915 transitions. [2022-11-20 12:16:46,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:46,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 915 transitions. [2022-11-20 12:16:46,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,224 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:46,224 INFO L175 Difference]: Start difference. First operand has 244 places, 522 transitions, 7871 flow. Second operand 10 states and 915 transitions. [2022-11-20 12:16:46,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 827 transitions, 13427 flow [2022-11-20 12:16:48,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 827 transitions, 13071 flow, removed 178 selfloop flow, removed 0 redundant places. [2022-11-20 12:16:48,729 INFO L231 Difference]: Finished difference. Result has 259 places, 672 transitions, 11038 flow [2022-11-20 12:16:48,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=7643, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11038, PETRI_PLACES=259, PETRI_TRANSITIONS=672} [2022-11-20 12:16:48,730 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 163 predicate places. [2022-11-20 12:16:48,730 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 672 transitions, 11038 flow [2022-11-20 12:16:48,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:48,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:16:48,731 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:16:48,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:16:48,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:16:48,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:16:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:16:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1597619129, now seen corresponding path program 1 times [2022-11-20 12:16:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:16:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253243298] [2022-11-20 12:16:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:16:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:16:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:16:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:16:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:16:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253243298] [2022-11-20 12:16:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253243298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:16:49,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:16:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:16:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624249493] [2022-11-20 12:16:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:16:49,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:16:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:16:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:16:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:16:49,295 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:16:49,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 672 transitions, 11038 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:49,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:16:49,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:16:49,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:16:54,885 INFO L130 PetriNetUnfolder]: 12077/24071 cut-off events. [2022-11-20 12:16:54,886 INFO L131 PetriNetUnfolder]: For 324832/326349 co-relation queries the response was YES. [2022-11-20 12:16:55,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139967 conditions, 24071 events. 12077/24071 cut-off events. For 324832/326349 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 241873 event pairs, 3552 based on Foata normal form. 66/23543 useless extension candidates. Maximal degree in co-relation 139887. Up to 7909 conditions per place. [2022-11-20 12:16:56,627 INFO L137 encePairwiseOnDemand]: 99/107 looper letters, 827 selfloop transitions, 97 changer transitions 21/1014 dead transitions. [2022-11-20 12:16:56,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1014 transitions, 18480 flow [2022-11-20 12:16:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:16:56,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 12:16:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 627 transitions. [2022-11-20 12:16:56,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8371161548731643 [2022-11-20 12:16:56,629 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 627 transitions. [2022-11-20 12:16:56,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 627 transitions. [2022-11-20 12:16:56,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:16:56,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 627 transitions. [2022-11-20 12:16:56,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:56,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:56,633 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:16:56,633 INFO L175 Difference]: Start difference. First operand has 259 places, 672 transitions, 11038 flow. Second operand 7 states and 627 transitions. [2022-11-20 12:16:56,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1014 transitions, 18480 flow [2022-11-20 12:17:01,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1014 transitions, 18266 flow, removed 107 selfloop flow, removed 0 redundant places. [2022-11-20 12:17:01,253 INFO L231 Difference]: Finished difference. Result has 270 places, 725 transitions, 12245 flow [2022-11-20 12:17:01,254 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=10882, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12245, PETRI_PLACES=270, PETRI_TRANSITIONS=725} [2022-11-20 12:17:01,255 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 174 predicate places. [2022-11-20 12:17:01,255 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 725 transitions, 12245 flow [2022-11-20 12:17:01,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:01,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:17:01,256 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:01,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:17:01,256 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:17:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -670224529, now seen corresponding path program 2 times [2022-11-20 12:17:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:01,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884609218] [2022-11-20 12:17:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:17:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:01,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884609218] [2022-11-20 12:17:01,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884609218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:01,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:01,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596409523] [2022-11-20 12:17:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:01,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:17:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:17:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:01,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:17:01,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 725 transitions, 12245 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:01,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:17:01,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:17:01,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:17:09,464 INFO L130 PetriNetUnfolder]: 12195/25039 cut-off events. [2022-11-20 12:17:09,464 INFO L131 PetriNetUnfolder]: For 351037/352805 co-relation queries the response was YES. [2022-11-20 12:17:09,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145961 conditions, 25039 events. 12195/25039 cut-off events. For 351037/352805 co-relation queries the response was YES. Maximal size of possible extension queue 1600. Compared 259533 event pairs, 2722 based on Foata normal form. 39/24559 useless extension candidates. Maximal degree in co-relation 145875. Up to 7616 conditions per place. [2022-11-20 12:17:10,238 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 928 selfloop transitions, 115 changer transitions 17/1129 dead transitions. [2022-11-20 12:17:10,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1129 transitions, 20420 flow [2022-11-20 12:17:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:17:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 12:17:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 695 transitions. [2022-11-20 12:17:10,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8119158878504673 [2022-11-20 12:17:10,241 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 695 transitions. [2022-11-20 12:17:10,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 695 transitions. [2022-11-20 12:17:10,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:17:10,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 695 transitions. [2022-11-20 12:17:10,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:10,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:10,246 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 107.0) internal successors, (963), 9 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:10,247 INFO L175 Difference]: Start difference. First operand has 270 places, 725 transitions, 12245 flow. Second operand 8 states and 695 transitions. [2022-11-20 12:17:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1129 transitions, 20420 flow [2022-11-20 12:17:14,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 1129 transitions, 20275 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-11-20 12:17:14,053 INFO L231 Difference]: Finished difference. Result has 278 places, 737 transitions, 12642 flow [2022-11-20 12:17:14,054 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=12170, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12642, PETRI_PLACES=278, PETRI_TRANSITIONS=737} [2022-11-20 12:17:14,054 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 182 predicate places. [2022-11-20 12:17:14,054 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 737 transitions, 12642 flow [2022-11-20 12:17:14,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:14,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:17:14,055 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:14,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:17:14,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:17:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1883044215, now seen corresponding path program 10 times [2022-11-20 12:17:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102739352] [2022-11-20 12:17:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:17:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102739352] [2022-11-20 12:17:14,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102739352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:17:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282210896] [2022-11-20 12:17:14,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:17:14,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:17:14,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:17:14,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:17:14,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 12:17:14,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:17:14,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:17:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:17:14,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:17:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:17:15,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:17:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:17:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282210896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:17:15,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:17:15,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2022-11-20 12:17:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534858075] [2022-11-20 12:17:15,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:17:15,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 12:17:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 12:17:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:17:15,650 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2022-11-20 12:17:15,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 737 transitions, 12642 flow. Second operand has 21 states, 21 states have (on average 77.85714285714286) internal successors, (1635), 21 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:15,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:17:15,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2022-11-20 12:17:15,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:17:31,461 INFO L130 PetriNetUnfolder]: 16413/34281 cut-off events. [2022-11-20 12:17:31,461 INFO L131 PetriNetUnfolder]: For 512209/513628 co-relation queries the response was YES. [2022-11-20 12:17:32,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199971 conditions, 34281 events. 16413/34281 cut-off events. For 512209/513628 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 372187 event pairs, 1561 based on Foata normal form. 175/34000 useless extension candidates. Maximal degree in co-relation 199882. Up to 9387 conditions per place. [2022-11-20 12:17:32,491 INFO L137 encePairwiseOnDemand]: 91/107 looper letters, 1276 selfloop transitions, 722 changer transitions 6/2072 dead transitions. [2022-11-20 12:17:32,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 2072 transitions, 39026 flow [2022-11-20 12:17:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-20 12:17:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-11-20 12:17:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 4142 transitions. [2022-11-20 12:17:32,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7742056074766355 [2022-11-20 12:17:32,537 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 4142 transitions. [2022-11-20 12:17:32,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 4142 transitions. [2022-11-20 12:17:32,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:17:32,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 4142 transitions. [2022-11-20 12:17:32,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 82.84) internal successors, (4142), 50 states have internal predecessors, (4142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:32,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 107.0) internal successors, (5457), 51 states have internal predecessors, (5457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:32,560 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 107.0) internal successors, (5457), 51 states have internal predecessors, (5457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:32,560 INFO L175 Difference]: Start difference. First operand has 278 places, 737 transitions, 12642 flow. Second operand 50 states and 4142 transitions. [2022-11-20 12:17:32,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 2072 transitions, 39026 flow [2022-11-20 12:17:39,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 2072 transitions, 38457 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-11-20 12:17:39,722 INFO L231 Difference]: Finished difference. Result has 358 places, 1312 transitions, 25675 flow [2022-11-20 12:17:39,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=12426, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=25675, PETRI_PLACES=358, PETRI_TRANSITIONS=1312} [2022-11-20 12:17:39,723 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 262 predicate places. [2022-11-20 12:17:39,723 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 1312 transitions, 25675 flow [2022-11-20 12:17:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 77.85714285714286) internal successors, (1635), 21 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,723 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:17:39,724 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:39,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:17:39,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b71dec5d-ec27-45c9-a83e-143d316fad4b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:17:39,924 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:17:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -546971079, now seen corresponding path program 4 times [2022-11-20 12:17:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:39,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405468412] [2022-11-20 12:17:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:17:40,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:40,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405468412] [2022-11-20 12:17:40,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405468412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:40,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:17:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634008129] [2022-11-20 12:17:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:40,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:17:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:17:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:17:40,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:17:40,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1312 transitions, 25675 flow. Second operand has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:17:40,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:17:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:17:55,947 INFO L130 PetriNetUnfolder]: 15432/32760 cut-off events. [2022-11-20 12:17:55,947 INFO L131 PetriNetUnfolder]: For 594549/595796 co-relation queries the response was YES. [2022-11-20 12:17:56,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213141 conditions, 32760 events. 15432/32760 cut-off events. For 594549/595796 co-relation queries the response was YES. Maximal size of possible extension queue 2277. Compared 362121 event pairs, 3401 based on Foata normal form. 93/32234 useless extension candidates. Maximal degree in co-relation 213018. Up to 10723 conditions per place. [2022-11-20 12:17:56,963 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 1354 selfloop transitions, 170 changer transitions 13/1612 dead transitions. [2022-11-20 12:17:56,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1612 transitions, 33800 flow [2022-11-20 12:17:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:17:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:17:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 791 transitions. [2022-11-20 12:17:56,966 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8213914849428868 [2022-11-20 12:17:56,966 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 791 transitions. [2022-11-20 12:17:56,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 791 transitions. [2022-11-20 12:17:56,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:17:56,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 791 transitions. [2022-11-20 12:17:56,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.88888888888889) internal successors, (791), 9 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,969 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,970 INFO L175 Difference]: Start difference. First operand has 358 places, 1312 transitions, 25675 flow. Second operand 9 states and 791 transitions. [2022-11-20 12:17:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1612 transitions, 33800 flow [2022-11-20 12:18:09,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1612 transitions, 32075 flow, removed 680 selfloop flow, removed 4 redundant places. [2022-11-20 12:18:09,733 INFO L231 Difference]: Finished difference. Result has 366 places, 1324 transitions, 25037 flow [2022-11-20 12:18:09,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=24371, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=25037, PETRI_PLACES=366, PETRI_TRANSITIONS=1324} [2022-11-20 12:18:09,734 INFO L288 CegarLoopForPetriNet]: 96 programPoint places, 270 predicate places. [2022-11-20 12:18:09,734 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 1324 transitions, 25037 flow [2022-11-20 12:18:09,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.375) internal successors, (635), 8 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:09,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:18:09,735 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:18:09,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:18:09,735 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 12:18:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1838294061, now seen corresponding path program 3 times [2022-11-20 12:18:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:09,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157524201] [2022-11-20 12:18:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:18:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:10,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157524201] [2022-11-20 12:18:10,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157524201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:10,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:10,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:18:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490575403] [2022-11-20 12:18:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:10,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:18:10,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:10,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:18:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:18:10,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 107 [2022-11-20 12:18:10,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1324 transitions, 25037 flow. Second operand has 7 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:10,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:18:10,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 107 [2022-11-20 12:18:10,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand