./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:11,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:11,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 21:57:11,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:11,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:11,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:11,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:11,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:11,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:11,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:11,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:11,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:11,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:11,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:11,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:11,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:11,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:11,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:11,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:11,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:11,802 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:57:11,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:57:11,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:57:11,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:11,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:57:11,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:11,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:57:11,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:11,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:11,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:11,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:11,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:11,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:11,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:11,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:11,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:11,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:11,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:11,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:11,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:11,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:11,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:11,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/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_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-10-31 21:57:12,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:12,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:12,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:12,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:12,175 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:12,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c Unable to find full path for "g++" [2024-10-31 21:57:14,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:14,660 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:14,661 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-10-31 21:57:14,669 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/data/bf9409f4f/501f127de01e4c82bd5852c68a723f4c/FLAGbada2f1d5 [2024-10-31 21:57:14,687 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/data/bf9409f4f/501f127de01e4c82bd5852c68a723f4c [2024-10-31 21:57:14,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:14,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:14,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:14,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:14,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:14,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:14" (1/1) ... [2024-10-31 21:57:14,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b73137f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:14, skipping insertion in model container [2024-10-31 21:57:14,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:14" (1/1) ... [2024-10-31 21:57:14,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:14,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:14,994 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:15,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:15,035 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:15,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15 WrapperNode [2024-10-31 21:57:15,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:15,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:15,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:15,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:15,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,070 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-10-31 21:57:15,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:15,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:15,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:15,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:15,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:57:15,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:15,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:15,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:15,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:15,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (1/1) ... [2024-10-31 21:57:15,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:15,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:15,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 21:57:15,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 21:57:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 21:57:15,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 21:57:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 21:57:15,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 21:57:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 21:57:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 21:57:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:15,201 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:57:15,314 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:15,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:15,546 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:57:15,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:15,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:15,757 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 21:57:15,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:15 BoogieIcfgContainer [2024-10-31 21:57:15,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:15,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:15,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:15,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:15,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:14" (1/3) ... [2024-10-31 21:57:15,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d70a893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:15, skipping insertion in model container [2024-10-31 21:57:15,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:15" (2/3) ... [2024-10-31 21:57:15,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d70a893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:15, skipping insertion in model container [2024-10-31 21:57:15,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:15" (3/3) ... [2024-10-31 21:57:15,770 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-10-31 21:57:15,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:15,792 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 21:57:15,792 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:57:15,867 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 21:57:15,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2024-10-31 21:57:15,950 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2024-10-31 21:57:15,957 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 21:57:15,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-10-31 21:57:15,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2024-10-31 21:57:15,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2024-10-31 21:57:15,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:15,988 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7d9adac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:15,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-31 21:57:16,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:57:16,002 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-10-31 21:57:16,002 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 21:57:16,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:16,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:16,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 333024233, now seen corresponding path program 1 times [2024-10-31 21:57:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:16,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607660799] [2024-10-31 21:57:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607660799] [2024-10-31 21:57:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607660799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787625474] [2024-10-31 21:57:16,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:16,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:16,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:16,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-10-31 21:57:16,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:16,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:16,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-10-31 21:57:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:17,007 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-10-31 21:57:17,007 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-31 21:57:17,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2467 event pairs, 34 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-10-31 21:57:17,017 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-10-31 21:57:17,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-10-31 21:57:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:57:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-10-31 21:57:17,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-10-31 21:57:17,035 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 3 states and 78 transitions. [2024-10-31 21:57:17,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-10-31 21:57:17,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 21:57:17,044 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-10-31 21:57:17,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-10-31 21:57:17,050 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2024-10-31 21:57:17,051 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-10-31 21:57:17,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:17,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:17,052 INFO L204 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] [2024-10-31 21:57:17,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:17,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:17,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:17,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1044271381, now seen corresponding path program 1 times [2024-10-31 21:57:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:17,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169652365] [2024-10-31 21:57:17,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:17,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:17,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169652365] [2024-10-31 21:57:17,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169652365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:17,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:17,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:17,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86364894] [2024-10-31 21:57:17,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:17,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-10-31 21:57:17,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:17,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:17,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-10-31 21:57:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:17,948 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-10-31 21:57:17,948 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-10-31 21:57:17,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4312 event pairs, 20 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-10-31 21:57:17,977 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-10-31 21:57:17,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-10-31 21:57:17,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:57:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-10-31 21:57:17,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6596638655462185 [2024-10-31 21:57:17,982 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 157 transitions. [2024-10-31 21:57:17,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-10-31 21:57:17,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:57:17,985 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-10-31 21:57:17,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-10-31 21:57:17,986 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-10-31 21:57:17,986 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-10-31 21:57:17,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:17,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:17,987 INFO L204 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] [2024-10-31 21:57:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:17,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1640698263, now seen corresponding path program 2 times [2024-10-31 21:57:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758107556] [2024-10-31 21:57:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758107556] [2024-10-31 21:57:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758107556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326598263] [2024-10-31 21:57:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:18,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:18,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-10-31 21:57:18,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:18,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:18,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-10-31 21:57:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:18,615 INFO L124 PetriNetUnfolderBase]: 698/1107 cut-off events. [2024-10-31 21:57:18,617 INFO L125 PetriNetUnfolderBase]: For 742/780 co-relation queries the response was YES. [2024-10-31 21:57:18,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 1107 events. 698/1107 cut-off events. For 742/780 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5440 event pairs, 70 based on Foata normal form. 31/1097 useless extension candidates. Maximal degree in co-relation 2789. Up to 713 conditions per place. [2024-10-31 21:57:18,631 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-10-31 21:57:18,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-10-31 21:57:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:57:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-10-31 21:57:18,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.634453781512605 [2024-10-31 21:57:18,635 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 151 transitions. [2024-10-31 21:57:18,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-10-31 21:57:18,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:57:18,643 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-10-31 21:57:18,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-10-31 21:57:18,645 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2024-10-31 21:57:18,646 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-10-31 21:57:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:18,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:18,647 INFO L204 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] [2024-10-31 21:57:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:18,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1193433297, now seen corresponding path program 3 times [2024-10-31 21:57:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547049016] [2024-10-31 21:57:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547049016] [2024-10-31 21:57:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547049016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502021560] [2024-10-31 21:57:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:19,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-10-31 21:57:19,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:19,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:19,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-10-31 21:57:19,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:19,719 INFO L124 PetriNetUnfolderBase]: 1472/2207 cut-off events. [2024-10-31 21:57:19,719 INFO L125 PetriNetUnfolderBase]: For 2696/2764 co-relation queries the response was YES. [2024-10-31 21:57:19,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 2207 events. 1472/2207 cut-off events. For 2696/2764 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 11570 event pairs, 131 based on Foata normal form. 37/2211 useless extension candidates. Maximal degree in co-relation 5287. Up to 915 conditions per place. [2024-10-31 21:57:19,743 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 88 selfloop transitions, 38 changer transitions 2/135 dead transitions. [2024-10-31 21:57:19,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 922 flow [2024-10-31 21:57:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:57:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 21:57:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-10-31 21:57:19,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2024-10-31 21:57:19,747 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 9 states and 207 transitions. [2024-10-31 21:57:19,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 922 flow [2024-10-31 21:57:19,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 878 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-31 21:57:19,767 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 584 flow [2024-10-31 21:57:19,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2024-10-31 21:57:19,770 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2024-10-31 21:57:19,770 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 584 flow [2024-10-31 21:57:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:19,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:19,772 INFO L204 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] [2024-10-31 21:57:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:19,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -494408837, now seen corresponding path program 4 times [2024-10-31 21:57:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313226011] [2024-10-31 21:57:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313226011] [2024-10-31 21:57:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313226011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589618400] [2024-10-31 21:57:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:20,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-10-31 21:57:20,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:20,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:20,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-10-31 21:57:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:20,534 INFO L124 PetriNetUnfolderBase]: 1373/2124 cut-off events. [2024-10-31 21:57:20,534 INFO L125 PetriNetUnfolderBase]: For 6125/6222 co-relation queries the response was YES. [2024-10-31 21:57:20,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8296 conditions, 2124 events. 1373/2124 cut-off events. For 6125/6222 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 11595 event pairs, 177 based on Foata normal form. 38/2114 useless extension candidates. Maximal degree in co-relation 6505. Up to 1252 conditions per place. [2024-10-31 21:57:20,558 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 65 selfloop transitions, 34 changer transitions 2/110 dead transitions. [2024-10-31 21:57:20,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 993 flow [2024-10-31 21:57:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:57:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-10-31 21:57:20,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-10-31 21:57:20,560 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 584 flow. Second operand 6 states and 132 transitions. [2024-10-31 21:57:20,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 993 flow [2024-10-31 21:57:20,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-31 21:57:20,589 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 742 flow [2024-10-31 21:57:20,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-10-31 21:57:20,590 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-10-31 21:57:20,591 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 742 flow [2024-10-31 21:57:20,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:20,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:20,591 INFO L204 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] [2024-10-31 21:57:20,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:20,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:20,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -218993000, now seen corresponding path program 1 times [2024-10-31 21:57:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541116348] [2024-10-31 21:57:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541116348] [2024-10-31 21:57:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541116348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587245916] [2024-10-31 21:57:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:20,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-10-31 21:57:20,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:20,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:20,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-10-31 21:57:20,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:21,579 INFO L124 PetriNetUnfolderBase]: 1771/2717 cut-off events. [2024-10-31 21:57:21,579 INFO L125 PetriNetUnfolderBase]: For 11476/11633 co-relation queries the response was YES. [2024-10-31 21:57:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11674 conditions, 2717 events. 1771/2717 cut-off events. For 11476/11633 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 15264 event pairs, 202 based on Foata normal form. 49/2729 useless extension candidates. Maximal degree in co-relation 9052. Up to 1448 conditions per place. [2024-10-31 21:57:21,618 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 99 selfloop transitions, 29 changer transitions 2/137 dead transitions. [2024-10-31 21:57:21,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 1371 flow [2024-10-31 21:57:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:57:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-10-31 21:57:21,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-10-31 21:57:21,621 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 742 flow. Second operand 7 states and 154 transitions. [2024-10-31 21:57:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 1371 flow [2024-10-31 21:57:21,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1314 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-10-31 21:57:21,670 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 834 flow [2024-10-31 21:57:21,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=834, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-10-31 21:57:21,673 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2024-10-31 21:57:21,674 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 834 flow [2024-10-31 21:57:21,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:21,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:21,675 INFO L204 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] [2024-10-31 21:57:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:57:21,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 339452386, now seen corresponding path program 2 times [2024-10-31 21:57:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436311116] [2024-10-31 21:57:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436311116] [2024-10-31 21:57:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436311116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440921338] [2024-10-31 21:57:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:22,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-10-31 21:57:22,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:22,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:22,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-10-31 21:57:22,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:23,011 INFO L124 PetriNetUnfolderBase]: 2196/3429 cut-off events. [2024-10-31 21:57:23,011 INFO L125 PetriNetUnfolderBase]: For 16783/17006 co-relation queries the response was YES. [2024-10-31 21:57:23,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15210 conditions, 3429 events. 2196/3429 cut-off events. For 16783/17006 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19322 event pairs, 405 based on Foata normal form. 39/3413 useless extension candidates. Maximal degree in co-relation 11716. Up to 2739 conditions per place. [2024-10-31 21:57:23,054 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 89 selfloop transitions, 45 changer transitions 3/148 dead transitions. [2024-10-31 21:57:23,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 1588 flow [2024-10-31 21:57:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:57:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-10-31 21:57:23,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-10-31 21:57:23,057 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 834 flow. Second operand 7 states and 154 transitions. [2024-10-31 21:57:23,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 1588 flow [2024-10-31 21:57:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1536 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-10-31 21:57:23,146 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 1256 flow [2024-10-31 21:57:23,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1256, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2024-10-31 21:57:23,147 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-10-31 21:57:23,147 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 1256 flow [2024-10-31 21:57:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:23,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:23,148 INFO L204 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] [2024-10-31 21:57:23,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:57:23,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:23,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1715934454, now seen corresponding path program 1 times [2024-10-31 21:57:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787365901] [2024-10-31 21:57:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787365901] [2024-10-31 21:57:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787365901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:23,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874937721] [2024-10-31 21:57:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:23,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-10-31 21:57:23,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 1256 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:23,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:23,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-10-31 21:57:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:24,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][80], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 24#L100true, Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 133#true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 73#true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 48#true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#L50true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), 115#true, 34#L72true, Black: 105#(= ~N~0 ~L~0), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-10-31 21:57:24,117 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,118 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-31 21:57:24,118 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-31 21:57:24,118 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-31 21:57:24,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][80], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 24#L100true, Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 133#true, 15#L64true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, 7#L83true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 103#true, 48#true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#L50true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 115#true, Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-10-31 21:57:24,423 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-31 21:57:24,423 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 21:57:24,424 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 21:57:24,424 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][80], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 24#L100true, Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 133#true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, 7#L83true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 48#true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 8#thread2EXITtrue, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 14#L50true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 115#true, Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-10-31 21:57:24,427 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-31 21:57:24,428 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 21:57:24,428 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 21:57:24,428 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][104], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 15#L64true, Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 73#true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 48#true, Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), 115#true, Black: 105#(= ~N~0 ~L~0), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-10-31 21:57:24,705 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 21:57:24,705 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,707 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,707 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][104], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 24#L100true, Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 63#(and (= ~N~0 ~L~0) (<= 1 (mod ~L~0 4294967296))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, 7#L83true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 48#true, Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 8#thread2EXITtrue, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), 115#true, Black: 105#(= ~N~0 ~L~0), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-10-31 21:57:24,711 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 21:57:24,711 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,711 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,711 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:24,853 INFO L124 PetriNetUnfolderBase]: 3635/5767 cut-off events. [2024-10-31 21:57:24,853 INFO L125 PetriNetUnfolderBase]: For 32636/33120 co-relation queries the response was YES. [2024-10-31 21:57:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26744 conditions, 5767 events. 3635/5767 cut-off events. For 32636/33120 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 37201 event pairs, 538 based on Foata normal form. 24/5207 useless extension candidates. Maximal degree in co-relation 22675. Up to 2460 conditions per place. [2024-10-31 21:57:24,951 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 103 selfloop transitions, 72 changer transitions 0/188 dead transitions. [2024-10-31 21:57:24,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 188 transitions, 2414 flow [2024-10-31 21:57:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:57:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-10-31 21:57:24,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2024-10-31 21:57:24,953 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 1256 flow. Second operand 5 states and 111 transitions. [2024-10-31 21:57:24,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 188 transitions, 2414 flow [2024-10-31 21:57:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 188 transitions, 2321 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-10-31 21:57:25,212 INFO L231 Difference]: Finished difference. Result has 93 places, 147 transitions, 2064 flow [2024-10-31 21:57:25,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2064, PETRI_PLACES=93, PETRI_TRANSITIONS=147} [2024-10-31 21:57:25,214 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2024-10-31 21:57:25,214 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 147 transitions, 2064 flow [2024-10-31 21:57:25,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:25,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:25,215 INFO L204 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] [2024-10-31 21:57:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:57:25,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash 888080322, now seen corresponding path program 2 times [2024-10-31 21:57:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859544654] [2024-10-31 21:57:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:25,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:25,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859544654] [2024-10-31 21:57:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859544654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:25,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652062702] [2024-10-31 21:57:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:25,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-10-31 21:57:25,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 147 transitions, 2064 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:25,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:25,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-10-31 21:57:25,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:27,215 INFO L124 PetriNetUnfolderBase]: 4225/6852 cut-off events. [2024-10-31 21:57:27,215 INFO L125 PetriNetUnfolderBase]: For 54350/54927 co-relation queries the response was YES. [2024-10-31 21:57:27,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35712 conditions, 6852 events. 4225/6852 cut-off events. For 54350/54927 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 45842 event pairs, 1125 based on Foata normal form. 49/6707 useless extension candidates. Maximal degree in co-relation 30614. Up to 3290 conditions per place. [2024-10-31 21:57:27,293 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 82 selfloop transitions, 96 changer transitions 3/194 dead transitions. [2024-10-31 21:57:27,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 2736 flow [2024-10-31 21:57:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:57:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-10-31 21:57:27,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-10-31 21:57:27,296 INFO L175 Difference]: Start difference. First operand has 93 places, 147 transitions, 2064 flow. Second operand 5 states and 113 transitions. [2024-10-31 21:57:27,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 2736 flow [2024-10-31 21:57:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 194 transitions, 2720 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-31 21:57:27,724 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 2449 flow [2024-10-31 21:57:27,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2449, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2024-10-31 21:57:27,726 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-10-31 21:57:27,726 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 2449 flow [2024-10-31 21:57:27,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:27,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:27,727 INFO L204 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] [2024-10-31 21:57:27,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:57:27,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:27,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1140843722, now seen corresponding path program 3 times [2024-10-31 21:57:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703059784] [2024-10-31 21:57:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:28,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703059784] [2024-10-31 21:57:28,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703059784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:57:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957894912] [2024-10-31 21:57:28,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 21:57:28,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:57:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:28,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:57:28,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:57:28,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-31 21:57:28,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 21:57:28,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-31 21:57:28,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:57:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:28,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:57:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957894912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 21:57:29,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 21:57:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-10-31 21:57:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018002558] [2024-10-31 21:57:29,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 21:57:29,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:57:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:57:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:29,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-10-31 21:57:29,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 2449 flow. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:29,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:29,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-10-31 21:57:29,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:32,260 INFO L124 PetriNetUnfolderBase]: 6645/10352 cut-off events. [2024-10-31 21:57:32,260 INFO L125 PetriNetUnfolderBase]: For 97575/98533 co-relation queries the response was YES. [2024-10-31 21:57:32,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56842 conditions, 10352 events. 6645/10352 cut-off events. For 97575/98533 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 67376 event pairs, 617 based on Foata normal form. 181/10492 useless extension candidates. Maximal degree in co-relation 46339. Up to 2775 conditions per place. [2024-10-31 21:57:32,403 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 191 selfloop transitions, 157 changer transitions 8/366 dead transitions. [2024-10-31 21:57:32,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 366 transitions, 4743 flow [2024-10-31 21:57:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 21:57:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-31 21:57:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 358 transitions. [2024-10-31 21:57:32,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6580882352941176 [2024-10-31 21:57:32,406 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 2449 flow. Second operand 16 states and 358 transitions. [2024-10-31 21:57:32,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 366 transitions, 4743 flow [2024-10-31 21:57:32,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 366 transitions, 4551 flow, removed 43 selfloop flow, removed 1 redundant places. [2024-10-31 21:57:32,927 INFO L231 Difference]: Finished difference. Result has 125 places, 211 transitions, 3623 flow [2024-10-31 21:57:32,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3623, PETRI_PLACES=125, PETRI_TRANSITIONS=211} [2024-10-31 21:57:32,928 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 88 predicate places. [2024-10-31 21:57:32,929 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 211 transitions, 3623 flow [2024-10-31 21:57:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:32,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:32,929 INFO L204 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] [2024-10-31 21:57:32,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:57:33,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bd9f097-8ede-4383-b0f6-dd3127526969/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-31 21:57:33,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 636188508, now seen corresponding path program 4 times [2024-10-31 21:57:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074441397] [2024-10-31 21:57:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074441397] [2024-10-31 21:57:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074441397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:33,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801389527] [2024-10-31 21:57:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:33,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:33,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-10-31 21:57:33,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 211 transitions, 3623 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:33,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:33,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-10-31 21:57:33,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:35,883 INFO L124 PetriNetUnfolderBase]: 5692/9192 cut-off events. [2024-10-31 21:57:35,884 INFO L125 PetriNetUnfolderBase]: For 135878/136832 co-relation queries the response was YES. [2024-10-31 21:57:35,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60672 conditions, 9192 events. 5692/9192 cut-off events. For 135878/136832 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 63268 event pairs, 1809 based on Foata normal form. 100/9068 useless extension candidates. Maximal degree in co-relation 50478. Up to 5409 conditions per place. [2024-10-31 21:57:36,033 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 109 selfloop transitions, 135 changer transitions 8/278 dead transitions. [2024-10-31 21:57:36,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 278 transitions, 4878 flow [2024-10-31 21:57:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:57:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-10-31 21:57:36,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-10-31 21:57:36,035 INFO L175 Difference]: Start difference. First operand has 125 places, 211 transitions, 3623 flow. Second operand 6 states and 130 transitions. [2024-10-31 21:57:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 278 transitions, 4878 flow [2024-10-31 21:57:36,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 278 transitions, 4762 flow, removed 48 selfloop flow, removed 2 redundant places. [2024-10-31 21:57:37,001 INFO L231 Difference]: Finished difference. Result has 130 places, 225 transitions, 4126 flow [2024-10-31 21:57:37,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3464, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4126, PETRI_PLACES=130, PETRI_TRANSITIONS=225} [2024-10-31 21:57:37,002 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 93 predicate places. [2024-10-31 21:57:37,002 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 225 transitions, 4126 flow [2024-10-31 21:57:37,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:37,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:37,003 INFO L204 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] [2024-10-31 21:57:37,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:57:37,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:37,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1658376798, now seen corresponding path program 3 times [2024-10-31 21:57:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383794408] [2024-10-31 21:57:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383794408] [2024-10-31 21:57:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383794408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629712508] [2024-10-31 21:57:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:37,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:37,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-10-31 21:57:37,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 225 transitions, 4126 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:37,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:37,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-10-31 21:57:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:38,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 133#true, Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, 326#true, 14#L50true, 73#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 336#true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 34#L72true, 17#L99-4true, Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:38,504 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-31 21:57:38,505 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-31 21:57:38,505 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-31 21:57:38,505 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-31 21:57:38,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 133#true, Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, 326#true, 73#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 103#true, 19#L69true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 336#true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), 17#L99-4true, Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:38,819 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 21:57:38,819 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:38,819 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:38,820 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:38,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 133#true, Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 326#true, 73#true, 14#L50true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 24#L100true, Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, 103#true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 336#true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 34#L72true, Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:38,828 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 21:57:38,829 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:38,829 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:38,829 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-31 21:57:39,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 133#true, Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 326#true, 73#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 24#L100true, Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 103#true, 19#L69true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 336#true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:39,106 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-31 21:57:39,106 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 21:57:39,106 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 21:57:39,106 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 21:57:39,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 133#true, Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, 326#true, 73#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 103#true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 336#true, 8#thread2EXITtrue, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), 17#L99-4true, Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:39,219 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-31 21:57:39,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 21:57:39,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 21:57:39,219 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 21:57:39,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([267] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][90], [Black: 124#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 122#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 126#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 161#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 136#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 139#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 133#true, Black: 146#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 150#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 48#true, 326#true, 73#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 135#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 310#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 308#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 314#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 160#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 304#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (= ~p~0 0) (= ~q~0 0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 312#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 159#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 24#L100true, Black: 275#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 306#(and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 158#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 329#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 332#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), 7#L83true, Black: 80#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 103#true, Black: 86#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 8#thread2EXITtrue, 336#true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(< 0 (mod ~N~0 4294967296)), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 3#L45true, Black: 106#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 108#(< 0 (mod ~L~0 4294967296)), Black: 105#(= ~N~0 ~L~0)]) [2024-10-31 21:57:39,283 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-31 21:57:39,283 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-31 21:57:39,283 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-31 21:57:39,283 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-31 21:57:39,334 INFO L124 PetriNetUnfolderBase]: 4191/6947 cut-off events. [2024-10-31 21:57:39,334 INFO L125 PetriNetUnfolderBase]: For 101994/102996 co-relation queries the response was YES. [2024-10-31 21:57:39,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46009 conditions, 6947 events. 4191/6947 cut-off events. For 101994/102996 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 47656 event pairs, 838 based on Foata normal form. 149/6869 useless extension candidates. Maximal degree in co-relation 40222. Up to 5609 conditions per place. [2024-10-31 21:57:39,447 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 185 selfloop transitions, 43 changer transitions 5/260 dead transitions. [2024-10-31 21:57:39,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 260 transitions, 4837 flow [2024-10-31 21:57:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:57:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-10-31 21:57:39,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-10-31 21:57:39,453 INFO L175 Difference]: Start difference. First operand has 130 places, 225 transitions, 4126 flow. Second operand 5 states and 113 transitions. [2024-10-31 21:57:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 260 transitions, 4837 flow [2024-10-31 21:57:40,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 4756 flow, removed 21 selfloop flow, removed 2 redundant places. [2024-10-31 21:57:40,105 INFO L231 Difference]: Finished difference. Result has 134 places, 219 transitions, 4022 flow [2024-10-31 21:57:40,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4022, PETRI_PLACES=134, PETRI_TRANSITIONS=219} [2024-10-31 21:57:40,106 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2024-10-31 21:57:40,106 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 219 transitions, 4022 flow [2024-10-31 21:57:40,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:40,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:40,107 INFO L204 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] [2024-10-31 21:57:40,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:57:40,108 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-31 21:57:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2073725014, now seen corresponding path program 5 times [2024-10-31 21:57:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249055416] [2024-10-31 21:57:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:40,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249055416] [2024-10-31 21:57:40,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249055416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:40,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014243556] [2024-10-31 21:57:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:40,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:40,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-10-31 21:57:40,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 219 transitions, 4022 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:40,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:40,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-10-31 21:57:40,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand