./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB --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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:14:46,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:14:46,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 23:14:46,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:14:46,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:14:46,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:14:46,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:14:46,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:14:46,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:14:46,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:14:46,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:14:46,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:14:46,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:14:46,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:14:46,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:14:46,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:14:46,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:14:46,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:46,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:46,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:46,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:14:46,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:14:46,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:14:46,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:14:46,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:14:46,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:14:46,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-27 23:14:46,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:14:46,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:14:46,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:14:46,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:14:46,825 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:14:46,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-27 23:14:50,005 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/data/8fc330b18/197ac3da8ff84f79af1367aa023cce88/FLAGbcfeb6c7d [2024-11-27 23:14:50,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:14:50,250 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-27 23:14:50,264 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/data/8fc330b18/197ac3da8ff84f79af1367aa023cce88/FLAGbcfeb6c7d [2024-11-27 23:14:50,287 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/data/8fc330b18/197ac3da8ff84f79af1367aa023cce88 [2024-11-27 23:14:50,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:14:50,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:14:50,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:50,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:14:50,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:14:50,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2b770a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50, skipping insertion in model container [2024-11-27 23:14:50,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:14:50,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:50,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:14:50,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:14:50,606 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:14:50,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50 WrapperNode [2024-11-27 23:14:50,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:14:50,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:50,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:14:50,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:14:50,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,667 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2024-11-27 23:14:50,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:14:50,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:14:50,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:14:50,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:14:50,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,703 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-11-27 23:14:50,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:14:50,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:14:50,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:14:50,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:14:50,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (1/1) ... [2024-11-27 23:14:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:14:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:14:50,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:14:50,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48e656f8-93ba-44e2-ab20-2aec69e70dd4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:14:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:14:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-27 23:14:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-27 23:14:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-27 23:14:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-27 23:14:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-27 23:14:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-27 23:14:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-27 23:14:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-27 23:14:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:14:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:14:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:14:50,805 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 23:14:50,910 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:14:50,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:14:51,216 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 23:14:51,216 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:14:51,433 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:14:51,434 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:14:51,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:51 BoogieIcfgContainer [2024-11-27 23:14:51,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:14:51,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:14:51,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:14:51,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:14:51,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:14:50" (1/3) ... [2024-11-27 23:14:51,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3864a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:51, skipping insertion in model container [2024-11-27 23:14:51,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:14:50" (2/3) ... [2024-11-27 23:14:51,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3864a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:14:51, skipping insertion in model container [2024-11-27 23:14:51,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:14:51" (3/3) ... [2024-11-27 23:14:51,447 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-27 23:14:51,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:14:51,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-27 23:14:51,465 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 23:14:51,566 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-27 23:14:51,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2024-11-27 23:14:51,654 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2024-11-27 23:14:51,658 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 23:14:51,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-27 23:14:51,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2024-11-27 23:14:51,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2024-11-27 23:14:51,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:14:51,702 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;@15e2013b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:14:51,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-27 23:14:51,739 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:14:51,742 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-27 23:14:51,742 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 23:14:51,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:14:51,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:51,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:14:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1673393006, now seen corresponding path program 1 times [2024-11-27 23:14:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393818936] [2024-11-27 23:14:51,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:52,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:14:52,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393818936] [2024-11-27 23:14:52,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393818936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:52,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:52,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:14:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306126598] [2024-11-27 23:14:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:14:52,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:14:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:14:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:52,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-11-27 23:14:52,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-11-27 23:14:52,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:14:52,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-11-27 23:14:52,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:14:55,002 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-27 23:14:55,002 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-27 23:14:55,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101536 event pairs, 4419 based on Foata normal form. 2/17033 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2024-11-27 23:14:55,198 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-27 23:14:55,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-27 23:14:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:14:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:14:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-27 23:14:55,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7158469945355191 [2024-11-27 23:14:55,219 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 131 transitions. [2024-11-27 23:14:55,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-27 23:14:55,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-27 23:14:55,285 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-27 23:14:55,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-11-27 23:14:55,295 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2024-11-27 23:14:55,297 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-27 23:14:55,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-11-27 23:14:55,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:14:55,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:14:55,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:14:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2047081064, now seen corresponding path program 1 times [2024-11-27 23:14:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223946182] [2024-11-27 23:14:55,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:14:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223946182] [2024-11-27 23:14:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223946182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:55,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:55,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:14:55,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297729285] [2024-11-27 23:14:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:55,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:14:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:14:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:14:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:14:55,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-11-27 23:14:55,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-27 23:14:55,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:14:55,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-11-27 23:14:55,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:14:58,861 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-27 23:14:58,865 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-27 23:14:59,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181776 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2024-11-27 23:14:59,206 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-27 23:14:59,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-27 23:14:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:14:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:14:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-27 23:14:59,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-11-27 23:14:59,212 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 117 transitions. [2024-11-27 23:14:59,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-27 23:14:59,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:14:59,218 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-27 23:14:59,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-11-27 23:14:59,221 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2024-11-27 23:14:59,221 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-27 23:14:59,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-27 23:14:59,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:14:59,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:14:59,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:14:59,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:14:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:14:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2121097810, now seen corresponding path program 1 times [2024-11-27 23:14:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:14:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578341474] [2024-11-27 23:14:59,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:14:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:14:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:14:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:14:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:14:59,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578341474] [2024-11-27 23:14:59,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578341474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:14:59,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:14:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:14:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124196369] [2024-11-27 23:14:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:14:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:14:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:14:59,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:14:59,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:14:59,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:14:59,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 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-11-27 23:14:59,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:14:59,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:14:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:02,977 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-27 23:15:02,977 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-27 23:15:03,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225280 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2024-11-27 23:15:03,117 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-27 23:15:03,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-27 23:15:03,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:15:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 23:15:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-27 23:15:03,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-27 23:15:03,123 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 357 transitions. [2024-11-27 23:15:03,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-27 23:15:03,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:15:03,197 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-27 23:15:03,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2024-11-27 23:15:03,199 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2024-11-27 23:15:03,200 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-27 23:15:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 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-11-27 23:15:03,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:03,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:15:03,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1623899882, now seen corresponding path program 2 times [2024-11-27 23:15:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114314264] [2024-11-27 23:15:03,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:15:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:03,259 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:15:03,260 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:03,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114314264] [2024-11-27 23:15:03,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114314264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:15:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469524091] [2024-11-27 23:15:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:03,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:15:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:03,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:15:03,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:15:03,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:03,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:03,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:03,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:06,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:06,781 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,782 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,782 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,782 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:06,783 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,783 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,783 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:06,783 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:07,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,034 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,034 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,034 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,035 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-27 23:15:07,036 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,036 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,036 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,036 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,037 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,038 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,038 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,038 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,038 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,039 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,039 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,039 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,039 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:07,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-27 23:15:07,462 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,462 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,462 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,462 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,463 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,463 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,463 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,463 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,464 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,464 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,464 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,465 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,465 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,465 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,465 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,465 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,466 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,466 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,466 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,466 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:07,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-27 23:15:07,600 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,601 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-27 23:15:07,602 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:07,793 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-27 23:15:07,793 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-27 23:15:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401587 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2024-11-27 23:15:08,165 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-27 23:15:08,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-27 23:15:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:15:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:15:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-11-27 23:15:08,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2024-11-27 23:15:08,168 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 218 transitions. [2024-11-27 23:15:08,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-27 23:15:08,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 23:15:08,369 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-27 23:15:08,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2024-11-27 23:15:08,370 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2024-11-27 23:15:08,370 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-27 23:15:08,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:08,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:08,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:15:08,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1796716772, now seen corresponding path program 1 times [2024-11-27 23:15:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963320003] [2024-11-27 23:15:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:15:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:08,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:08,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963320003] [2024-11-27 23:15:08,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963320003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:15:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101739192] [2024-11-27 23:15:08,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:08,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:15:08,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:08,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:15:08,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:15:08,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:08,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:08,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:08,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:08,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:11,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:11,337 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,337 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,337 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,337 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:11,338 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,338 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,338 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,338 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:11,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:11,571 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,571 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,571 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,571 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:11,572 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true]) [2024-11-27 23:15:11,572 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:11,573 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,573 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,573 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,573 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:11,573 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-27 23:15:11,574 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:11,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 78#true, 7#L44-1true, 48#L101true]) [2024-11-27 23:15:11,900 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,900 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,900 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,900 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:11,901 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:11,901 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,901 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-27 23:15:11,902 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, 5#L100-4true, Black: 78#true, 7#L44-1true]) [2024-11-27 23:15:11,902 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,903 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-27 23:15:11,903 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,903 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,903 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:11,903 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:12,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 48#L101true]) [2024-11-27 23:15:12,025 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,025 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,025 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,025 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-27 23:15:12,026 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,026 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:12,178 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-27 23:15:12,179 INFO L125 PetriNetUnfolderBase]: For 66816/68251 co-relation queries the response was YES. [2024-11-27 23:15:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66816/68251 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374953 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2024-11-27 23:15:12,359 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-27 23:15:12,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-27 23:15:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:15:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:15:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-11-27 23:15:12,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114754098360656 [2024-11-27 23:15:12,360 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 217 transitions. [2024-11-27 23:15:12,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-27 23:15:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-27 23:15:12,681 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-27 23:15:12,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2024-11-27 23:15:12,683 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2024-11-27 23:15:12,683 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-27 23:15:12,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:12,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:12,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:12,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:15:12,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1269143448, now seen corresponding path program 3 times [2024-11-27 23:15:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246235405] [2024-11-27 23:15:12,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:15:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:12,729 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:15:12,734 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:13,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246235405] [2024-11-27 23:15:13,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246235405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:13,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:13,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:15:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499104651] [2024-11-27 23:15:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:13,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:15:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:13,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:15:13,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:15:13,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:13,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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-11-27 23:15:13,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:13,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:13,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:16,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:16,284 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:16,284 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:16,284 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:16,284 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:16,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:16,547 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-27 23:15:16,547 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,547 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-27 23:15:16,548 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,548 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,548 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,548 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true]) [2024-11-27 23:15:16,989 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-27 23:15:16,989 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,989 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-27 23:15:16,990 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,990 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,990 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:16,990 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:17,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-27 23:15:17,209 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:17,209 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:17,209 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:17,209 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:17,518 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-27 23:15:17,518 INFO L125 PetriNetUnfolderBase]: For 103810/106170 co-relation queries the response was YES. [2024-11-27 23:15:17,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103810/106170 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425346 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2024-11-27 23:15:17,941 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-27 23:15:17,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-27 23:15:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:15:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:15:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2024-11-27 23:15:17,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2024-11-27 23:15:17,943 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 263 transitions. [2024-11-27 23:15:17,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-27 23:15:18,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:15:18,067 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-27 23:15:18,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2024-11-27 23:15:18,068 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2024-11-27 23:15:18,068 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-27 23:15:18,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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-11-27 23:15:18,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:18,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:18,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:15:18,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash -549382550, now seen corresponding path program 4 times [2024-11-27 23:15:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:18,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246329761] [2024-11-27 23:15:18,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:15:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:18,099 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:15:18,100 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246329761] [2024-11-27 23:15:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246329761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:18,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:15:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929773082] [2024-11-27 23:15:18,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:18,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:15:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:18,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:15:18,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:15:18,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:18,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:18,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:18,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:18,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:21,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:21,530 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-27 23:15:21,530 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:21,531 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:21,531 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-27 23:15:21,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:21,881 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,881 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,881 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,881 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:21,964 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,964 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,964 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,964 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:21,965 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:21,965 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:21,965 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-27 23:15:22,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,226 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,226 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,227 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,227 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,227 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,227 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,227 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,228 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,562 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,563 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,563 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-27 23:15:22,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,711 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,711 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,711 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,711 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-27 23:15:22,734 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,734 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,734 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,734 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-27 23:15:22,951 INFO L124 PetriNetUnfolderBase]: 31732/50984 cut-off events. [2024-11-27 23:15:22,951 INFO L125 PetriNetUnfolderBase]: For 160612/162633 co-relation queries the response was YES. [2024-11-27 23:15:23,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178792 conditions, 50984 events. 31732/50984 cut-off events. For 160612/162633 co-relation queries the response was YES. Maximal size of possible extension queue 2813. Compared 436801 event pairs, 8150 based on Foata normal form. 1179/50388 useless extension candidates. Maximal degree in co-relation 111148. Up to 23495 conditions per place. [2024-11-27 23:15:23,169 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 124 selfloop transitions, 85 changer transitions 12/246 dead transitions. [2024-11-27 23:15:23,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 246 transitions, 2344 flow [2024-11-27 23:15:23,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:15:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:15:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-27 23:15:23,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7180327868852459 [2024-11-27 23:15:23,172 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 5 states and 219 transitions. [2024-11-27 23:15:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 246 transitions, 2344 flow [2024-11-27 23:15:23,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 246 transitions, 2275 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-27 23:15:23,508 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2024-11-27 23:15:23,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2024-11-27 23:15:23,509 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2024-11-27 23:15:23,509 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2024-11-27 23:15:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:23,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:23,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:15:23,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -954436072, now seen corresponding path program 5 times [2024-11-27 23:15:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280547412] [2024-11-27 23:15:23,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:15:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:23,539 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:15:23,539 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:23,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:23,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280547412] [2024-11-27 23:15:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280547412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:23,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:15:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732192016] [2024-11-27 23:15:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:23,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:15:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:23,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:15:23,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:15:23,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:23,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:23,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:23,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:23,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:27,258 INFO L124 PetriNetUnfolderBase]: 20188/32574 cut-off events. [2024-11-27 23:15:27,259 INFO L125 PetriNetUnfolderBase]: For 112813/114709 co-relation queries the response was YES. [2024-11-27 23:15:27,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115542 conditions, 32574 events. 20188/32574 cut-off events. For 112813/114709 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 263247 event pairs, 5504 based on Foata normal form. 1250/32730 useless extension candidates. Maximal degree in co-relation 89605. Up to 16794 conditions per place. [2024-11-27 23:15:27,459 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 91 changer transitions 5/237 dead transitions. [2024-11-27 23:15:27,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 237 transitions, 2473 flow [2024-11-27 23:15:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:15:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:15:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-11-27 23:15:27,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7081967213114754 [2024-11-27 23:15:27,462 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 216 transitions. [2024-11-27 23:15:27,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 237 transitions, 2473 flow [2024-11-27 23:15:27,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 2372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:15:27,651 INFO L231 Difference]: Finished difference. Result has 95 places, 189 transitions, 2039 flow [2024-11-27 23:15:27,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=95, PETRI_TRANSITIONS=189} [2024-11-27 23:15:27,652 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2024-11-27 23:15:27,652 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 189 transitions, 2039 flow [2024-11-27 23:15:27,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 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-11-27 23:15:27,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:27,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:27,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:15:27,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:27,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1362432530, now seen corresponding path program 6 times [2024-11-27 23:15:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252857037] [2024-11-27 23:15:27,655 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:15:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:27,683 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-27 23:15:27,683 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:27,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:27,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252857037] [2024-11-27 23:15:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252857037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:27,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:27,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:15:27,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419216992] [2024-11-27 23:15:27,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:27,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:15:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:27,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:15:27,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:15:27,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:27,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 189 transitions, 2039 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:27,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:27,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:27,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:31,848 INFO L124 PetriNetUnfolderBase]: 20016/32104 cut-off events. [2024-11-27 23:15:31,848 INFO L125 PetriNetUnfolderBase]: For 133745/136146 co-relation queries the response was YES. [2024-11-27 23:15:32,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120084 conditions, 32104 events. 20016/32104 cut-off events. For 133745/136146 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 258284 event pairs, 4419 based on Foata normal form. 1070/31811 useless extension candidates. Maximal degree in co-relation 94070. Up to 9636 conditions per place. [2024-11-27 23:15:32,258 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 120 selfloop transitions, 127 changer transitions 3/275 dead transitions. [2024-11-27 23:15:32,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 275 transitions, 2941 flow [2024-11-27 23:15:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:15:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 23:15:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2024-11-27 23:15:32,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6844262295081968 [2024-11-27 23:15:32,261 INFO L175 Difference]: Start difference. First operand has 95 places, 189 transitions, 2039 flow. Second operand 8 states and 334 transitions. [2024-11-27 23:15:32,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 275 transitions, 2941 flow [2024-11-27 23:15:32,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 275 transitions, 2828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:15:32,377 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2024-11-27 23:15:32,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2024-11-27 23:15:32,378 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2024-11-27 23:15:32,378 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2024-11-27 23:15:32,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:32,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:32,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:32,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:15:32,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1223545596, now seen corresponding path program 2 times [2024-11-27 23:15:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103899139] [2024-11-27 23:15:32,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:15:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:32,404 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:15:32,404 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103899139] [2024-11-27 23:15:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103899139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:32,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:32,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:15:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556810640] [2024-11-27 23:15:32,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:15:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:32,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:15:32,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:15:32,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:32,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:32,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:32,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:32,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:37,385 INFO L124 PetriNetUnfolderBase]: 19436/31706 cut-off events. [2024-11-27 23:15:37,385 INFO L125 PetriNetUnfolderBase]: For 161120/162912 co-relation queries the response was YES. [2024-11-27 23:15:37,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123993 conditions, 31706 events. 19436/31706 cut-off events. For 161120/162912 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 259374 event pairs, 4258 based on Foata normal form. 1119/31570 useless extension candidates. Maximal degree in co-relation 97513. Up to 9533 conditions per place. [2024-11-27 23:15:37,538 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 122 selfloop transitions, 139 changer transitions 26/312 dead transitions. [2024-11-27 23:15:37,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 312 transitions, 3738 flow [2024-11-27 23:15:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:15:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 23:15:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 340 transitions. [2024-11-27 23:15:37,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967213114754098 [2024-11-27 23:15:37,541 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 340 transitions. [2024-11-27 23:15:37,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 312 transitions, 3738 flow [2024-11-27 23:15:37,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 312 transitions, 3515 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-27 23:15:37,716 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2024-11-27 23:15:37,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2024-11-27 23:15:37,717 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2024-11-27 23:15:37,717 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2024-11-27 23:15:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:37,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:37,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:15:37,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:37,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash -188279710, now seen corresponding path program 7 times [2024-11-27 23:15:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:37,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805005009] [2024-11-27 23:15:37,718 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 23:15:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:15:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:37,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805005009] [2024-11-27 23:15:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805005009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:37,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:15:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963782007] [2024-11-27 23:15:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:37,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:15:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:15:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:15:37,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:37,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:37,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:37,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:37,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:41,103 INFO L124 PetriNetUnfolderBase]: 13479/22218 cut-off events. [2024-11-27 23:15:41,103 INFO L125 PetriNetUnfolderBase]: For 107050/108086 co-relation queries the response was YES. [2024-11-27 23:15:41,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86331 conditions, 22218 events. 13479/22218 cut-off events. For 107050/108086 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173182 event pairs, 3104 based on Foata normal form. 828/22416 useless extension candidates. Maximal degree in co-relation 71313. Up to 6362 conditions per place. [2024-11-27 23:15:41,200 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 138 changer transitions 35/309 dead transitions. [2024-11-27 23:15:41,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 309 transitions, 3930 flow [2024-11-27 23:15:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:15:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 23:15:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2024-11-27 23:15:41,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-11-27 23:15:41,203 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 336 transitions. [2024-11-27 23:15:41,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 309 transitions, 3930 flow [2024-11-27 23:15:41,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 309 transitions, 3783 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:15:41,303 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-27 23:15:41,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-27 23:15:41,304 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2024-11-27 23:15:41,304 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-27 23:15:41,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 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-11-27 23:15:41,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:41,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:15:41,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1533324864, now seen corresponding path program 8 times [2024-11-27 23:15:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473553418] [2024-11-27 23:15:41,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:15:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:41,328 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:15:41,328 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473553418] [2024-11-27 23:15:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473553418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:15:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018178887] [2024-11-27 23:15:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:15:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:41,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:15:41,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:15:41,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:41,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 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-11-27 23:15:41,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:41,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:41,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:44,170 INFO L124 PetriNetUnfolderBase]: 12276/20093 cut-off events. [2024-11-27 23:15:44,170 INFO L125 PetriNetUnfolderBase]: For 115673/116505 co-relation queries the response was YES. [2024-11-27 23:15:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79234 conditions, 20093 events. 12276/20093 cut-off events. For 115673/116505 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 154596 event pairs, 2977 based on Foata normal form. 598/20064 useless extension candidates. Maximal degree in co-relation 64394. Up to 7290 conditions per place. [2024-11-27 23:15:44,290 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-27 23:15:44,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-27 23:15:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:15:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 23:15:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-27 23:15:44,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-27 23:15:44,292 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 357 transitions. [2024-11-27 23:15:44,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-27 23:15:44,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-27 23:15:44,428 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-27 23:15:44,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2024-11-27 23:15:44,429 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2024-11-27 23:15:44,429 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-27 23:15:44,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 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-11-27 23:15:44,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:44,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:44,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 23:15:44,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:44,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash -216172402, now seen corresponding path program 9 times [2024-11-27 23:15:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382393892] [2024-11-27 23:15:44,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:15:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:44,450 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:15:44,450 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382393892] [2024-11-27 23:15:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382393892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:15:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682144115] [2024-11-27 23:15:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:44,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:15:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:44,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:15:44,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:15:44,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:44,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-27 23:15:44,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:44,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:44,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:46,952 INFO L124 PetriNetUnfolderBase]: 11650/19000 cut-off events. [2024-11-27 23:15:46,952 INFO L125 PetriNetUnfolderBase]: For 130698/131584 co-relation queries the response was YES. [2024-11-27 23:15:47,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77039 conditions, 19000 events. 11650/19000 cut-off events. For 130698/131584 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 144267 event pairs, 2887 based on Foata normal form. 586/18902 useless extension candidates. Maximal degree in co-relation 62033. Up to 7029 conditions per place. [2024-11-27 23:15:47,083 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 110 selfloop transitions, 136 changer transitions 18/288 dead transitions. [2024-11-27 23:15:47,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-27 23:15:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:15:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 23:15:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2024-11-27 23:15:47,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610655737704918 [2024-11-27 23:15:47,086 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 447 transitions. [2024-11-27 23:15:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-27 23:15:47,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-27 23:15:47,223 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-27 23:15:47,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2024-11-27 23:15:47,223 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2024-11-27 23:15:47,224 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-27 23:15:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-27 23:15:47,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:47,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:47,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:15:47,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:47,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash 402497868, now seen corresponding path program 10 times [2024-11-27 23:15:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:47,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889415752] [2024-11-27 23:15:47,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:15:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:47,240 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:15:47,240 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:47,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:47,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889415752] [2024-11-27 23:15:47,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889415752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:47,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:47,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:15:47,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205844181] [2024-11-27 23:15:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:47,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:15:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:47,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:15:47,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:15:47,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:47,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-27 23:15:47,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:47,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:49,819 INFO L124 PetriNetUnfolderBase]: 11585/19081 cut-off events. [2024-11-27 23:15:49,819 INFO L125 PetriNetUnfolderBase]: For 148290/149024 co-relation queries the response was YES. [2024-11-27 23:15:49,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78441 conditions, 19081 events. 11585/19081 cut-off events. For 148290/149024 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 146947 event pairs, 3088 based on Foata normal form. 414/18857 useless extension candidates. Maximal degree in co-relation 62931. Up to 7026 conditions per place. [2024-11-27 23:15:49,927 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-27 23:15:49,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-27 23:15:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:15:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-27 23:15:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 450 transitions. [2024-11-27 23:15:49,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2024-11-27 23:15:49,930 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 450 transitions. [2024-11-27 23:15:49,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-27 23:15:50,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-27 23:15:50,114 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-27 23:15:50,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2024-11-27 23:15:50,115 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-11-27 23:15:50,115 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-27 23:15:50,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-27 23:15:50,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:15:50,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:15:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:15:50,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-27 23:15:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:15:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1139244856, now seen corresponding path program 3 times [2024-11-27 23:15:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:15:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564730725] [2024-11-27 23:15:50,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:15:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:15:50,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:15:50,133 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:15:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:15:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:15:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564730725] [2024-11-27 23:15:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564730725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:15:50,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:15:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:15:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928470849] [2024-11-27 23:15:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:15:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:15:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:15:50,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:15:50,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:15:50,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-27 23:15:50,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-27 23:15:50,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:15:50,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-27 23:15:50,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:15:52,451 INFO L124 PetriNetUnfolderBase]: 11390/18742 cut-off events. [2024-11-27 23:15:52,451 INFO L125 PetriNetUnfolderBase]: For 150461/151463 co-relation queries the response was YES. [2024-11-27 23:15:52,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77859 conditions, 18742 events. 11390/18742 cut-off events. For 150461/151463 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 144060 event pairs, 3028 based on Foata normal form. 614/18739 useless extension candidates. Maximal degree in co-relation 62517. Up to 6968 conditions per place.