./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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-?-4f9af40 [2024-11-07 19:32:33,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:32:33,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:32:33,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:32:33,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:32:33,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:32:33,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:32:33,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:32:33,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:32:33,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:32:33,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:32:33,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:32:33,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:32:33,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:32:33,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:32:33,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:32:33,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:32:33,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:32:33,455 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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-07 19:32:33,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:32:33,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:32:33,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:32:33,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:32:33,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:32:33,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-07 19:32:34,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:32:35,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:32:35,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-07 19:32:35,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2b760b3a/df18fc48721b4eb7a5314c7dcaf53329/FLAGa60476e8a [2024-11-07 19:32:35,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2b760b3a/df18fc48721b4eb7a5314c7dcaf53329 [2024-11-07 19:32:35,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:32:35,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:32:35,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:32:35,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:32:35,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:32:35,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc8ed82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35, skipping insertion in model container [2024-11-07 19:32:35,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:32:35,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:32:35,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:32:35,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:32:35,229 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:32:35,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35 WrapperNode [2024-11-07 19:32:35,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:32:35,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:32:35,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:32:35,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:32:35,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,258 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2024-11-07 19:32:35,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:32:35,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:32:35,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:32:35,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:32:35,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,284 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-07 19:32:35,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:32:35,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:32:35,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:32:35,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:32:35,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (1/1) ... [2024-11-07 19:32:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:32:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:32:35,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:32:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:32:35,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:32:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 19:32:35,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 19:32:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 19:32:35,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 19:32:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 19:32:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 19:32:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-07 19:32:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-07 19:32:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:32:35,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:32:35,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:32:35,352 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:32:35,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:32:35,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:32:35,637 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:32:35,637 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:32:35,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:32:35,809 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:32:35,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:32:35 BoogieIcfgContainer [2024-11-07 19:32:35,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:32:35,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:32:35,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:32:35,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:32:35,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:32:35" (1/3) ... [2024-11-07 19:32:35,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e025389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:32:35, skipping insertion in model container [2024-11-07 19:32:35,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:32:35" (2/3) ... [2024-11-07 19:32:35,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e025389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:32:35, skipping insertion in model container [2024-11-07 19:32:35,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:32:35" (3/3) ... [2024-11-07 19:32:35,817 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-07 19:32:35,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:32:35,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 19:32:35,829 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:32:35,891 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 19:32:35,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2024-11-07 19:32:35,954 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2024-11-07 19:32:35,958 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 19:32:35,961 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-07 19:32:35,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2024-11-07 19:32:35,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2024-11-07 19:32:35,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:32:35,983 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;@26bfb35b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:32:35,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 19:32:36,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:32:36,002 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-07 19:32:36,002 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 19:32:36,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:36,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:36,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 19:32:36,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1197919086, now seen corresponding path program 1 times [2024-11-07 19:32:36,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589592630] [2024-11-07 19:32:36,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:36,319 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-07 19:32:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589592630] [2024-11-07 19:32:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589592630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:36,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:36,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:32:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493421604] [2024-11-07 19:32:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:36,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:32:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:32:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:32:36,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-11-07 19:32:36,371 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-07 19:32:36,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:36,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-11-07 19:32:36,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:37,615 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-07 19:32:37,616 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-07 19:32:37,643 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-07 19:32:37,705 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-07 19:32:37,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-07 19:32:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:32:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:32:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-07 19:32:37,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7158469945355191 [2024-11-07 19:32:37,715 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 131 transitions. [2024-11-07 19:32:37,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-07 19:32:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:32:37,745 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-07 19:32:37,747 INFO L260 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-07 19:32:37,751 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2024-11-07 19:32:37,751 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-07 19:32:37,752 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-07 19:32:37,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:37,752 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:32:37,753 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-07 19:32:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2047081064, now seen corresponding path program 1 times [2024-11-07 19:32:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312967248] [2024-11-07 19:32:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:37,825 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-07 19:32:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312967248] [2024-11-07 19:32:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312967248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:32:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007253097] [2024-11-07 19:32:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:32:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:32:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:32:37,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-11-07 19:32:37,838 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-07 19:32:37,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:37,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-11-07 19:32:37,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:39,317 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-07 19:32:39,318 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-07 19:32:39,363 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-07 19:32:39,428 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-07 19:32:39,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-07 19:32:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:32:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:32:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-07 19:32:39,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-11-07 19:32:39,431 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 117 transitions. [2024-11-07 19:32:39,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-07 19:32:39,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:32:39,434 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-07 19:32:39,434 INFO L260 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-07 19:32:39,435 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2024-11-07 19:32:39,435 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-07 19:32:39,435 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-07 19:32:39,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:39,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:32:39,436 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-07 19:32:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2121097810, now seen corresponding path program 1 times [2024-11-07 19:32:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625032981] [2024-11-07 19:32:39,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:39,695 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-07 19:32:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625032981] [2024-11-07 19:32:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625032981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:32:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028579316] [2024-11-07 19:32:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:32:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:32:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:32:39,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:39,702 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-07 19:32:39,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:39,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:39,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:41,143 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-07 19:32:41,144 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-07 19:32:41,205 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-07 19:32:41,306 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-07 19:32:41,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-07 19:32:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:32:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:32:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-07 19:32:41,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-07 19:32:41,309 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 357 transitions. [2024-11-07 19:32:41,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-07 19:32:41,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:32:41,344 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-07 19:32:41,344 INFO L260 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-07 19:32:41,344 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2024-11-07 19:32:41,344 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-07 19:32:41,345 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-07 19:32:41,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:41,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:41,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:32:41,345 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-07 19:32:41,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1623899882, now seen corresponding path program 2 times [2024-11-07 19:32:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487691032] [2024-11-07 19:32:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:41,557 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-07 19:32:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487691032] [2024-11-07 19:32:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487691032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:41,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:41,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:32:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126691007] [2024-11-07 19:32:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:32:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:32:41,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:32:41,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:41,562 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-07 19:32:41,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:41,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:41,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:43,154 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-07 19:32:43,154 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 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-07 19:32:43,155 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,155 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:43,438 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-07 19:32:43,438 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 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-07 19:32:43,439 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 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-07 19:32:43,439 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 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-07 19:32:43,440 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 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-07 19:32:43,440 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,440 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 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-07 19:32:43,441 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:43,568 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-07 19:32:43,569 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 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-07 19:32:43,569 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 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-07 19:32:43,569 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,569 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 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-07 19:32:43,570 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 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-07 19:32:43,570 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 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-07 19:32:43,570 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,570 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:43,653 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-07 19:32:43,653 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 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-07 19:32:43,653 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,653 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:43,752 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-07 19:32:43,752 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-07 19:32:43,844 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-07 19:32:43,962 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-07 19:32:43,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-07 19:32:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:32:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:32:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-11-07 19:32:43,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2024-11-07 19:32:43,963 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 218 transitions. [2024-11-07 19:32:43,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-07 19:32:44,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:32:44,071 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-07 19:32:44,071 INFO L260 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-07 19:32:44,071 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2024-11-07 19:32:44,072 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-07 19:32:44,072 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-07 19:32:44,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:44,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:44,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:32:44,072 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-07 19:32:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1796716772, now seen corresponding path program 1 times [2024-11-07 19:32:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757288420] [2024-11-07 19:32:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:44,318 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-07 19:32:44,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757288420] [2024-11-07 19:32:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757288420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:44,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:32:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354903093] [2024-11-07 19:32:44,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:44,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:32:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:32:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:32:44,323 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:44,323 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-07 19:32:44,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:44,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:44,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:46,077 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-07 19:32:46,078 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,078 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,078 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,078 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,078 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-07 19:32:46,078 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,078 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,079 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,079 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:46,418 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-07 19:32:46,418 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,418 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,418 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,418 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 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-07 19:32:46,419 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 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-07 19:32:46,419 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,419 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,422 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,422 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,422 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-07 19:32:46,423 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 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-07 19:32:46,423 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 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-07 19:32:46,423 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,423 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:46,581 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-07 19:32:46,581 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,581 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-07 19:32:46,581 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 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-07 19:32:46,582 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,582 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-07 19:32:46,582 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 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-07 19:32:46,583 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 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-07 19:32:46,583 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:46,681 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-07 19:32:46,681 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 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-07 19:32:46,681 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,681 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:46,796 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-07 19:32:46,796 INFO L125 PetriNetUnfolderBase]: For 66816/68251 co-relation queries the response was YES. [2024-11-07 19:32:46,899 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-07 19:32:47,017 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-07 19:32:47,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-07 19:32:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:32:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:32:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-11-07 19:32:47,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7114754098360656 [2024-11-07 19:32:47,019 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 217 transitions. [2024-11-07 19:32:47,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-07 19:32:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-07 19:32:47,149 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-07 19:32:47,150 INFO L260 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-07 19:32:47,150 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2024-11-07 19:32:47,150 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-07 19:32:47,150 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-07 19:32:47,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:47,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:32:47,151 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-07 19:32:47,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1269143448, now seen corresponding path program 3 times [2024-11-07 19:32:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248097332] [2024-11-07 19:32:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:47,391 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-07 19:32:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248097332] [2024-11-07 19:32:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248097332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:32:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912431919] [2024-11-07 19:32:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:47,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:32:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:32:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:32:47,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:47,398 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-07 19:32:47,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:47,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:47,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:49,531 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-07 19:32:49,531 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:49,531 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:49,531 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:49,531 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:49,727 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-07 19:32:49,727 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 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-07 19:32:49,727 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,727 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,728 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-07 19:32:49,728 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,728 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,728 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,728 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:49,892 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-07 19:32:49,892 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,892 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,892 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,892 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 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-07 19:32:49,893 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 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-07 19:32:49,893 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:49,893 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:50,016 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-07 19:32:50,016 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:50,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:50,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:50,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:50,334 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-07 19:32:50,334 INFO L125 PetriNetUnfolderBase]: For 103810/106170 co-relation queries the response was YES. [2024-11-07 19:32:50,455 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-07 19:32:50,572 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-07 19:32:50,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-07 19:32:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:32:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:32:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2024-11-07 19:32:50,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2024-11-07 19:32:50,573 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 263 transitions. [2024-11-07 19:32:50,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-07 19:32:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:32:50,676 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-07 19:32:50,676 INFO L260 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-07 19:32:50,676 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2024-11-07 19:32:50,676 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-07 19:32:50,677 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-07 19:32:50,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:50,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:50,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:32:50,677 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-07 19:32:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash -549382550, now seen corresponding path program 4 times [2024-11-07 19:32:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003181438] [2024-11-07 19:32:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:50,795 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-07 19:32:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:50,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003181438] [2024-11-07 19:32:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003181438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:32:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944276216] [2024-11-07 19:32:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:32:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:32:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:32:50,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:50,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 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-07 19:32:50,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:50,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:50,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:53,000 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][208], [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), 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, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,000 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:32:53,000 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:53,000 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:53,000 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:32:53,319 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][208], [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), 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, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,319 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,319 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,319 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,319 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 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][208], [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), 52#thread2EXITtrue, 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-07 19:32:53,320 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 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][208], [Black: 121#(<= ~s~0 ~t~0), 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, 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, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,320 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,320 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:32:53,726 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][208], [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), 52#thread2EXITtrue, 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, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,726 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,726 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,726 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,726 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 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][208], [Black: 121#(<= ~s~0 ~t~0), 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, 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), 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, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,727 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 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][208], [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), 52#thread2EXITtrue, 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-07 19:32:53,727 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 19:32:53,855 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][208], [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, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-07 19:32:53,856 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:32:53,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:53,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:53,856 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:32:54,026 INFO L124 PetriNetUnfolderBase]: 33384/52574 cut-off events. [2024-11-07 19:32:54,026 INFO L125 PetriNetUnfolderBase]: For 173455/176099 co-relation queries the response was YES. [2024-11-07 19:32:54,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188514 conditions, 52574 events. 33384/52574 cut-off events. For 173455/176099 co-relation queries the response was YES. Maximal size of possible extension queue 2897. Compared 442362 event pairs, 6641 based on Foata normal form. 1948/52119 useless extension candidates. Maximal degree in co-relation 117618. Up to 16795 conditions per place. [2024-11-07 19:32:54,292 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 124 selfloop transitions, 115 changer transitions 1/265 dead transitions. [2024-11-07 19:32:54,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 265 transitions, 2315 flow [2024-11-07 19:32:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:32:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:32:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2024-11-07 19:32:54,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6926229508196722 [2024-11-07 19:32:54,293 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 8 states and 338 transitions. [2024-11-07 19:32:54,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 265 transitions, 2315 flow [2024-11-07 19:32:54,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 265 transitions, 2258 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-07 19:32:54,602 INFO L231 Difference]: Finished difference. Result has 94 places, 184 transitions, 1828 flow [2024-11-07 19:32:54,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1828, PETRI_PLACES=94, PETRI_TRANSITIONS=184} [2024-11-07 19:32:54,603 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2024-11-07 19:32:54,603 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 184 transitions, 1828 flow [2024-11-07 19:32:54,603 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-07 19:32:54,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:54,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:32:54,605 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-07 19:32:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1900671934, now seen corresponding path program 2 times [2024-11-07 19:32:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950928763] [2024-11-07 19:32:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:54,876 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-07 19:32:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950928763] [2024-11-07 19:32:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950928763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:54,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:32:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869608136] [2024-11-07 19:32:54,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:32:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:32:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:32:54,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:54,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 184 transitions, 1828 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-07 19:32:54,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:54,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:32:58,329 INFO L124 PetriNetUnfolderBase]: 33115/52821 cut-off events. [2024-11-07 19:32:58,329 INFO L125 PetriNetUnfolderBase]: For 238032/240703 co-relation queries the response was YES. [2024-11-07 19:32:58,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205143 conditions, 52821 events. 33115/52821 cut-off events. For 238032/240703 co-relation queries the response was YES. Maximal size of possible extension queue 2903. Compared 452710 event pairs, 6616 based on Foata normal form. 2317/52716 useless extension candidates. Maximal degree in co-relation 130936. Up to 17233 conditions per place. [2024-11-07 19:32:58,616 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 147 changer transitions 2/308 dead transitions. [2024-11-07 19:32:58,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 308 transitions, 3151 flow [2024-11-07 19:32:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:32:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:32:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 344 transitions. [2024-11-07 19:32:58,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2024-11-07 19:32:58,617 INFO L175 Difference]: Start difference. First operand has 94 places, 184 transitions, 1828 flow. Second operand 8 states and 344 transitions. [2024-11-07 19:32:58,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 308 transitions, 3151 flow [2024-11-07 19:32:58,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 308 transitions, 2929 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-07 19:32:58,969 INFO L231 Difference]: Finished difference. Result has 99 places, 215 transitions, 2404 flow [2024-11-07 19:32:58,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2404, PETRI_PLACES=99, PETRI_TRANSITIONS=215} [2024-11-07 19:32:58,970 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 33 predicate places. [2024-11-07 19:32:58,970 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 215 transitions, 2404 flow [2024-11-07 19:32:58,970 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-07 19:32:58,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:32:58,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:32:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:32:58,971 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-07 19:32:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:32:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1357401666, now seen corresponding path program 2 times [2024-11-07 19:32:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:32:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870646829] [2024-11-07 19:32:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:32:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:32:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:32:59,054 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-07 19:32:59,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:32:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870646829] [2024-11-07 19:32:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870646829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:32:59,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:32:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:32:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181672190] [2024-11-07 19:32:59,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:32:59,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:32:59,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:32:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:32:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:32:59,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:32:59,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 215 transitions, 2404 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-07 19:32:59,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:32:59,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:32:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:02,592 INFO L124 PetriNetUnfolderBase]: 31340/51549 cut-off events. [2024-11-07 19:33:02,592 INFO L125 PetriNetUnfolderBase]: For 256617/257779 co-relation queries the response was YES. [2024-11-07 19:33:02,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199054 conditions, 51549 events. 31340/51549 cut-off events. For 256617/257779 co-relation queries the response was YES. Maximal size of possible extension queue 2757. Compared 456959 event pairs, 8738 based on Foata normal form. 686/50581 useless extension candidates. Maximal degree in co-relation 126862. Up to 22761 conditions per place. [2024-11-07 19:33:02,882 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 126 selfloop transitions, 127 changer transitions 14/292 dead transitions. [2024-11-07 19:33:02,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 292 transitions, 3522 flow [2024-11-07 19:33:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-07 19:33:02,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7180327868852459 [2024-11-07 19:33:02,883 INFO L175 Difference]: Start difference. First operand has 99 places, 215 transitions, 2404 flow. Second operand 5 states and 219 transitions. [2024-11-07 19:33:02,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 292 transitions, 3522 flow [2024-11-07 19:33:03,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 292 transitions, 3464 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:03,203 INFO L231 Difference]: Finished difference. Result has 103 places, 229 transitions, 2929 flow [2024-11-07 19:33:03,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2929, PETRI_PLACES=103, PETRI_TRANSITIONS=229} [2024-11-07 19:33:03,204 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 37 predicate places. [2024-11-07 19:33:03,204 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 229 transitions, 2929 flow [2024-11-07 19:33:03,204 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-07 19:33:03,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:03,204 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:33:03,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:33:03,204 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-07 19:33:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 485535886, now seen corresponding path program 5 times [2024-11-07 19:33:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499654857] [2024-11-07 19:33:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:03,427 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-07 19:33:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499654857] [2024-11-07 19:33:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499654857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:03,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:03,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:33:03,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650069213] [2024-11-07 19:33:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:03,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:33:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:33:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:33:03,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:33:03,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 229 transitions, 2929 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-07 19:33:03,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:03,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:33:03,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:05,515 INFO L124 PetriNetUnfolderBase]: 19839/32646 cut-off events. [2024-11-07 19:33:05,515 INFO L125 PetriNetUnfolderBase]: For 175036/176378 co-relation queries the response was YES. [2024-11-07 19:33:05,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124356 conditions, 32646 events. 19839/32646 cut-off events. For 175036/176378 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 270940 event pairs, 5780 based on Foata normal form. 1016/32554 useless extension candidates. Maximal degree in co-relation 98264. Up to 16284 conditions per place. [2024-11-07 19:33:05,678 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 113 changer transitions 24/274 dead transitions. [2024-11-07 19:33:05,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 274 transitions, 3579 flow [2024-11-07 19:33:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:33:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:33:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-11-07 19:33:05,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7081967213114754 [2024-11-07 19:33:05,680 INFO L175 Difference]: Start difference. First operand has 103 places, 229 transitions, 2929 flow. Second operand 5 states and 216 transitions. [2024-11-07 19:33:05,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 274 transitions, 3579 flow [2024-11-07 19:33:05,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 274 transitions, 3435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:33:05,820 INFO L231 Difference]: Finished difference. Result has 107 places, 209 transitions, 2770 flow [2024-11-07 19:33:05,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2770, PETRI_PLACES=107, PETRI_TRANSITIONS=209} [2024-11-07 19:33:05,820 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2024-11-07 19:33:05,820 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 209 transitions, 2770 flow [2024-11-07 19:33:05,821 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-07 19:33:05,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:05,821 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:33:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:33:05,821 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-07 19:33:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 384483030, now seen corresponding path program 6 times [2024-11-07 19:33:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291997849] [2024-11-07 19:33:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:05,916 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-07 19:33:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:05,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291997849] [2024-11-07 19:33:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291997849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:33:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133932194] [2024-11-07 19:33:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:05,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:33:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:33:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:33:05,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:33:05,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 209 transitions, 2770 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-07 19:33:05,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:05,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:33:05,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:07,717 INFO L124 PetriNetUnfolderBase]: 13487/22226 cut-off events. [2024-11-07 19:33:07,718 INFO L125 PetriNetUnfolderBase]: For 114241/115285 co-relation queries the response was YES. [2024-11-07 19:33:07,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85845 conditions, 22226 events. 13487/22226 cut-off events. For 114241/115285 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173099 event pairs, 3104 based on Foata normal form. 828/22424 useless extension candidates. Maximal degree in co-relation 71314. Up to 6370 conditions per place. [2024-11-07 19:33:07,796 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 138 changer transitions 37/311 dead transitions. [2024-11-07 19:33:07,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 311 transitions, 4072 flow [2024-11-07 19:33:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:33:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:33:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2024-11-07 19:33:07,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-11-07 19:33:07,798 INFO L175 Difference]: Start difference. First operand has 107 places, 209 transitions, 2770 flow. Second operand 8 states and 336 transitions. [2024-11-07 19:33:07,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 311 transitions, 4072 flow [2024-11-07 19:33:07,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 311 transitions, 3826 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:07,857 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-07 19:33:07,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-07 19:33:07,858 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2024-11-07 19:33:07,858 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-07 19:33:07,858 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-07 19:33:07,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:07,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:33:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:33:07,859 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-07 19:33:07,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash -174536736, now seen corresponding path program 7 times [2024-11-07 19:33:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595741011] [2024-11-07 19:33:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:07,938 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-07 19:33:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595741011] [2024-11-07 19:33:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595741011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:33:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815105883] [2024-11-07 19:33:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:33:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:33:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:33:07,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:33:07,942 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-07 19:33:07,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:07,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:33:07,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:33:09,264 INFO L124 PetriNetUnfolderBase]: 12333/20002 cut-off events. [2024-11-07 19:33:09,264 INFO L125 PetriNetUnfolderBase]: For 117310/118102 co-relation queries the response was YES. [2024-11-07 19:33:09,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79523 conditions, 20002 events. 12333/20002 cut-off events. For 117310/118102 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 151746 event pairs, 2965 based on Foata normal form. 412/19663 useless extension candidates. Maximal degree in co-relation 64695. Up to 7359 conditions per place. [2024-11-07 19:33:09,354 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-07 19:33:09,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-07 19:33:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:33:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:33:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-07 19:33:09,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-07 19:33:09,356 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 357 transitions. [2024-11-07 19:33:09,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-07 19:33:09,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:33:09,435 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-07 19:33:09,435 INFO L260 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-07 19:33:09,436 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2024-11-07 19:33:09,436 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-07 19:33:09,436 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-07 19:33:09,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:33:09,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 19:33:09,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:33:09,436 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-07 19:33:09,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:33:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 832276790, now seen corresponding path program 8 times [2024-11-07 19:33:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:33:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029045683] [2024-11-07 19:33:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:33:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:33:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:33:09,517 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-07 19:33:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:33:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029045683] [2024-11-07 19:33:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029045683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:33:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:33:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:33:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734337964] [2024-11-07 19:33:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:33:09,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:33:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:33:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:33:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:33:09,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-07 19:33:09,520 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-07 19:33:09,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:33:09,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-07 19:33:09,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand