./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml', '-i', '../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )\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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --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 11:26:08,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:26:08,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:26:08,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:26:08,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:26:08,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:26:08,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:26:08,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:26:08,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:26:08,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:26:08,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:26:08,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:26:08,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:26:08,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:26:08,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:26:08,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:26:08,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:26:08,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:26:08,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:26:08,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:26:08,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:26:08,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:26:08,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:26:08,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:26:08,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:26:08,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:26:08,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:26:08,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:26:08,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:26:08,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:26:08,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:26:08,380 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-07 11:26:08,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:26:08,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:26:08,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:26:08,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:26:08,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:26:08,767 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 11:26:10,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:26:10,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:26:10,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-07 11:26:10,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff5d8b5a/396a2902b67a48629bb9090b8b52860e/FLAG7a66ec886 [2024-11-07 11:26:10,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff5d8b5a/396a2902b67a48629bb9090b8b52860e [2024-11-07 11:26:10,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:26:10,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:26:10,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:26:10,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:26:10,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:26:10,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765adca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10, skipping insertion in model container [2024-11-07 11:26:10,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:26:10,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2024-11-07 11:26:10,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:26:10,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:26:10,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2024-11-07 11:26:10,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:26:10,686 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:26:10,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10 WrapperNode [2024-11-07 11:26:10,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:26:10,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:26:10,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:26:10,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:26:10,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,742 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-07 11:26:10,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:26:10,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:26:10,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:26:10,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:26:10,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,768 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 11:26:10,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:26:10,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:26:10,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:26:10,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:26:10,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (1/1) ... [2024-11-07 11:26:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:26:10,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:26:10,824 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 11:26:10,830 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 11:26:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:26:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 11:26:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 11:26:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 11:26:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 11:26:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-07 11:26:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-07 11:26:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-07 11:26:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-07 11:26:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:26:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:26:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:26:10,856 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 11:26:10,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:26:10,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:26:11,224 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:26:11,224 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:26:11,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:26:11,403 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:26:11,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:26:11 BoogieIcfgContainer [2024-11-07 11:26:11,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:26:11,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:26:11,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:26:11,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:26:11,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:26:10" (1/3) ... [2024-11-07 11:26:11,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3aa80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:26:11, skipping insertion in model container [2024-11-07 11:26:11,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:26:10" (2/3) ... [2024-11-07 11:26:11,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3aa80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:26:11, skipping insertion in model container [2024-11-07 11:26:11,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:26:11" (3/3) ... [2024-11-07 11:26:11,414 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-07 11:26:11,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:26:11,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:26:11,429 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:26:11,500 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 11:26:11,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2024-11-07 11:26:11,587 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2024-11-07 11:26:11,591 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:26:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-07 11:26:11,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2024-11-07 11:26:11,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2024-11-07 11:26:11,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:26:11,625 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2998db74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:26:11,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 11:26:11,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:26:11,655 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-07 11:26:11,655 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:26:11,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:11,656 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 11:26:11,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -338410394, now seen corresponding path program 1 times [2024-11-07 11:26:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101643245] [2024-11-07 11:26:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:12,159 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 11:26:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101643245] [2024-11-07 11:26:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101643245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:26:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029997863] [2024-11-07 11:26:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:12,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:26:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:26:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:26:12,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-11-07 11:26:12,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 11:26:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-11-07 11:26:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:13,994 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-07 11:26:13,996 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-07 11:26:14,057 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 101565 event pairs, 4419 based on Foata normal form. 1/17032 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2024-11-07 11:26:14,265 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-07 11:26:14,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-07 11:26:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:26:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:26:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-11-07 11:26:14,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-11-07 11:26:14,303 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 127 transitions. [2024-11-07 11:26:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-07 11:26:14,351 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 11:26:14,356 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-07 11:26:14,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:14,365 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-11-07 11:26:14,366 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-07 11:26:14,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 11:26:14,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:14,367 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 11:26:14,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:26:14,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:14,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -728591479, now seen corresponding path program 1 times [2024-11-07 11:26:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129527845] [2024-11-07 11:26:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:14,501 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 11:26:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129527845] [2024-11-07 11:26:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129527845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:14,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:14,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:26:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447985659] [2024-11-07 11:26:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:14,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:26:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:26:14,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:26:14,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-07 11:26:14,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 11:26:14,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:14,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-07 11:26:14,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:16,884 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-07 11:26:16,884 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-07 11:26:16,960 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 181661 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 11:26:17,066 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-07 11:26:17,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-07 11:26:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:26:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:26:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-07 11:26:17,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-11-07 11:26:17,072 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 114 transitions. [2024-11-07 11:26:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-07 11:26:17,075 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 11:26:17,077 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-07 11:26:17,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:17,078 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-07 11:26:17,078 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-07 11:26:17,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 11:26:17,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:17,079 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 11:26:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:26:17,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1852755381, now seen corresponding path program 1 times [2024-11-07 11:26:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:17,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028219275] [2024-11-07 11:26:17,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:17,482 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 11:26:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028219275] [2024-11-07 11:26:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028219275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:26:17,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641582916] [2024-11-07 11:26:17,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:26:17,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:26:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:26:17,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:17,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:26:17,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:17,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:19,490 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-07 11:26:19,491 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-07 11:26:19,568 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 225070 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 11:26:19,674 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-07 11:26:19,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-07 11:26:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:26:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:26:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-07 11:26:19,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-07 11:26:19,678 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 348 transitions. [2024-11-07 11:26:19,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-07 11:26:19,715 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 11:26:19,717 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-07 11:26:19,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:19,718 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-11-07 11:26:19,718 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-07 11:26:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:26:19,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:19,719 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 11:26:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:26:19,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1191460215, now seen corresponding path program 2 times [2024-11-07 11:26:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285703275] [2024-11-07 11:26:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:19,987 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 11:26:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:19,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285703275] [2024-11-07 11:26:19,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285703275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:19,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:19,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:26:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761278927] [2024-11-07 11:26:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:19,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:26:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:26:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:26:19,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:19,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:19,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:19,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:19,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:21,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:21,912 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,912 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,912 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,912 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:21,913 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,913 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,913 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:21,913 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:22,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,170 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,170 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,171 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,171 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,171 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,172 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,172 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,172 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:22,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,561 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,561 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,561 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,561 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,562 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,562 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,563 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,563 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,563 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,563 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,564 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,564 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,564 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,564 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,564 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,650 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:22,650 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,650 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:22,758 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-07 11:26:22,759 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-07 11:26:22,869 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 401575 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 11:26:23,032 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-07 11:26:23,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-07 11:26:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:26:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:26:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-11-07 11:26:23,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7220338983050848 [2024-11-07 11:26:23,034 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 213 transitions. [2024-11-07 11:26:23,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-07 11:26:23,157 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 11:26:23,159 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-07 11:26:23,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:23,160 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2024-11-07 11:26:23,160 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-07 11:26:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:23,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:23,160 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 11:26:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:26:23,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 475877975, now seen corresponding path program 1 times [2024-11-07 11:26:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497510120] [2024-11-07 11:26:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:23,358 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 11:26:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:23,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497510120] [2024-11-07 11:26:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497510120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:26:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203513493] [2024-11-07 11:26:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:23,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:26:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:26:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:26:23,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:23,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:23,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:23,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:25,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 5#L100-4true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,557 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,557 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,557 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,557 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,558 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,558 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,558 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,558 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:25,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,814 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,814 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,815 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 5#L100-4true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,815 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,815 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,816 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,816 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:25,817 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,817 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,817 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:25,817 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,027 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,027 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,027 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,028 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,028 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,028 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,029 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,029 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,029 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:26,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,352 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,352 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,352 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,353 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:26,353 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,353 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,353 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,353 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:26,475 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-07 11:26:26,475 INFO L125 PetriNetUnfolderBase]: For 66729/68306 co-relation queries the response was YES. [2024-11-07 11:26:26,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66729/68306 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374889 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 11:26:26,741 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-07 11:26:26,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-07 11:26:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:26:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:26:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-11-07 11:26:26,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-11-07 11:26:26,743 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 212 transitions. [2024-11-07 11:26:26,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-07 11:26:26,893 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 11:26:26,897 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-07 11:26:26,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:26,898 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2024-11-07 11:26:26,898 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-07 11:26:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:26,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:26,898 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 11:26:26,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:26:26,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:26,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 93800467, now seen corresponding path program 3 times [2024-11-07 11:26:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285906185] [2024-11-07 11:26:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:26,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:27,103 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 11:26:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285906185] [2024-11-07 11:26:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285906185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:26:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000384815] [2024-11-07 11:26:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:26:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:26:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:26:27,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:27,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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 11:26:27,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:27,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:29,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:29,713 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:29,713 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:29,713 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:29,713 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:30,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,241 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,241 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,241 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,241 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:30,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,423 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,423 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,423 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,423 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:30,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:30,560 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:30,560 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:30,560 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:30,560 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:30,743 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-07 11:26:30,744 INFO L125 PetriNetUnfolderBase]: For 103598/106226 co-relation queries the response was YES. [2024-11-07 11:26:31,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103598/106226 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425275 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 11:26:31,226 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-07 11:26:31,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-07 11:26:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:26:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:26:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-11-07 11:26:31,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2024-11-07 11:26:31,228 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 257 transitions. [2024-11-07 11:26:31,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-07 11:26:31,337 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 11:26:31,340 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-07 11:26:31,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:31,341 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2024-11-07 11:26:31,341 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-07 11:26:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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 11:26:31,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:31,341 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 11:26:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:26:31,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 150968343, now seen corresponding path program 4 times [2024-11-07 11:26:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802385478] [2024-11-07 11:26:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:31,541 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 11:26:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802385478] [2024-11-07 11:26:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802385478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:26:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223052192] [2024-11-07 11:26:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:31,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:26:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:26:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:26:31,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:31,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:31,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:31,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:31,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:34,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,248 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 11:26:34,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:34,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:34,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 11:26:34,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,742 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,742 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,743 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,743 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 11:26:34,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,943 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,943 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:34,943 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:34,943 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-07 11:26:35,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] 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: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-07 11:26:35,091 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 11:26:35,092 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:35,092 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:35,092 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 11:26:35,533 INFO L124 PetriNetUnfolderBase]: 33384/52574 cut-off events. [2024-11-07 11:26:35,534 INFO L125 PetriNetUnfolderBase]: For 173933/176849 co-relation queries the response was YES. [2024-11-07 11:26:35,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188514 conditions, 52574 events. 33384/52574 cut-off events. For 173933/176849 co-relation queries the response was YES. Maximal size of possible extension queue 2897. Compared 442359 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 11:26:35,883 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 115 changer transitions 1/265 dead transitions. [2024-11-07 11:26:35,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 265 transitions, 2315 flow [2024-11-07 11:26:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:26:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:26:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2024-11-07 11:26:35,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6991525423728814 [2024-11-07 11:26:35,885 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 8 states and 330 transitions. [2024-11-07 11:26:35,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 265 transitions, 2315 flow [2024-11-07 11:26:36,248 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 11:26:36,252 INFO L231 Difference]: Finished difference. Result has 94 places, 184 transitions, 1828 flow [2024-11-07 11:26:36,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:36,253 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 30 predicate places. [2024-11-07 11:26:36,253 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 184 transitions, 1828 flow [2024-11-07 11:26:36,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:36,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:36,254 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 11:26:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:26:36,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:36,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1047361237, now seen corresponding path program 2 times [2024-11-07 11:26:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556209459] [2024-11-07 11:26:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:36,416 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 11:26:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556209459] [2024-11-07 11:26:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556209459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:26:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041082401] [2024-11-07 11:26:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:36,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:26:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:26:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:26:36,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:36,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 184 transitions, 1828 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:36,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:36,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:40,570 INFO L124 PetriNetUnfolderBase]: 33115/52821 cut-off events. [2024-11-07 11:26:40,570 INFO L125 PetriNetUnfolderBase]: For 238707/241624 co-relation queries the response was YES. [2024-11-07 11:26:40,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205143 conditions, 52821 events. 33115/52821 cut-off events. For 238707/241624 co-relation queries the response was YES. Maximal size of possible extension queue 2903. Compared 452647 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 11:26:40,937 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 134 selfloop transitions, 147 changer transitions 2/308 dead transitions. [2024-11-07 11:26:40,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 308 transitions, 3151 flow [2024-11-07 11:26:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:26:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:26:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2024-11-07 11:26:40,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.711864406779661 [2024-11-07 11:26:40,939 INFO L175 Difference]: Start difference. First operand has 94 places, 184 transitions, 1828 flow. Second operand 8 states and 336 transitions. [2024-11-07 11:26:40,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 308 transitions, 3151 flow [2024-11-07 11:26:41,394 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 11:26:41,397 INFO L231 Difference]: Finished difference. Result has 99 places, 215 transitions, 2404 flow [2024-11-07 11:26:41,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:41,398 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 35 predicate places. [2024-11-07 11:26:41,398 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 215 transitions, 2404 flow [2024-11-07 11:26:41,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:41,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:41,398 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 11:26:41,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:26:41,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:41,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash -592954411, now seen corresponding path program 2 times [2024-11-07 11:26:41,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:41,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465194258] [2024-11-07 11:26:41,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:41,524 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 11:26:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465194258] [2024-11-07 11:26:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465194258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:26:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691946103] [2024-11-07 11:26:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:26:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:26:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:26:41,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:41,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 215 transitions, 2404 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:41,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:41,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:41,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:45,724 INFO L124 PetriNetUnfolderBase]: 31338/51477 cut-off events. [2024-11-07 11:26:45,724 INFO L125 PetriNetUnfolderBase]: For 255680/256921 co-relation queries the response was YES. [2024-11-07 11:26:45,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198910 conditions, 51477 events. 31338/51477 cut-off events. For 255680/256921 co-relation queries the response was YES. Maximal size of possible extension queue 2755. Compared 455424 event pairs, 8736 based on Foata normal form. 686/50507 useless extension candidates. Maximal degree in co-relation 126718. Up to 22761 conditions per place. [2024-11-07 11:26:46,034 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 126 selfloop transitions, 127 changer transitions 14/292 dead transitions. [2024-11-07 11:26:46,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 292 transitions, 3522 flow [2024-11-07 11:26:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:26:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:26:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-07 11:26:46,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7254237288135593 [2024-11-07 11:26:46,035 INFO L175 Difference]: Start difference. First operand has 99 places, 215 transitions, 2404 flow. Second operand 5 states and 214 transitions. [2024-11-07 11:26:46,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 292 transitions, 3522 flow [2024-11-07 11:26:46,347 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 11:26:46,352 INFO L231 Difference]: Finished difference. Result has 103 places, 229 transitions, 2929 flow [2024-11-07 11:26:46,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:46,353 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 39 predicate places. [2024-11-07 11:26:46,353 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 229 transitions, 2929 flow [2024-11-07 11:26:46,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:46,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:46,353 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 11:26:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:26:46,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:46,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -962217197, now seen corresponding path program 5 times [2024-11-07 11:26:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538130398] [2024-11-07 11:26:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:46,480 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 11:26:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538130398] [2024-11-07 11:26:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538130398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:46,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:26:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155486743] [2024-11-07 11:26:46,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:46,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:26:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:26:46,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:26:46,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:46,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 229 transitions, 2929 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:46,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:46,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:46,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:49,369 INFO L124 PetriNetUnfolderBase]: 19839/32654 cut-off events. [2024-11-07 11:26:49,369 INFO L125 PetriNetUnfolderBase]: For 176004/177330 co-relation queries the response was YES. [2024-11-07 11:26:49,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124372 conditions, 32654 events. 19839/32654 cut-off events. For 176004/177330 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 271214 event pairs, 5780 based on Foata normal form. 1016/32562 useless extension candidates. Maximal degree in co-relation 98280. Up to 16284 conditions per place. [2024-11-07 11:26:49,629 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 113 changer transitions 24/274 dead transitions. [2024-11-07 11:26:49,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 274 transitions, 3579 flow [2024-11-07 11:26:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:26:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:26:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-11-07 11:26:49,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152542372881356 [2024-11-07 11:26:49,631 INFO L175 Difference]: Start difference. First operand has 103 places, 229 transitions, 2929 flow. Second operand 5 states and 211 transitions. [2024-11-07 11:26:49,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 274 transitions, 3579 flow [2024-11-07 11:26:49,791 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 11:26:49,794 INFO L231 Difference]: Finished difference. Result has 107 places, 209 transitions, 2770 flow [2024-11-07 11:26:49,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:49,796 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2024-11-07 11:26:49,796 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 209 transitions, 2770 flow [2024-11-07 11:26:49,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 11:26:49,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:49,796 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 11:26:49,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:26:49,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:49,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:49,797 INFO L85 PathProgramCache]: Analyzing trace with hash 803745903, now seen corresponding path program 6 times [2024-11-07 11:26:49,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:49,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691136503] [2024-11-07 11:26:49,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:49,958 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 11:26:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691136503] [2024-11-07 11:26:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691136503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:26:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925599858] [2024-11-07 11:26:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:26:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:26:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:26:49,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:49,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 209 transitions, 2770 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:49,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:49,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:51,975 INFO L124 PetriNetUnfolderBase]: 13463/22329 cut-off events. [2024-11-07 11:26:51,975 INFO L125 PetriNetUnfolderBase]: For 115184/116320 co-relation queries the response was YES. [2024-11-07 11:26:52,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85762 conditions, 22329 events. 13463/22329 cut-off events. For 115184/116320 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 175396 event pairs, 3114 based on Foata normal form. 930/22705 useless extension candidates. Maximal degree in co-relation 71239. Up to 6337 conditions per place. [2024-11-07 11:26:52,089 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 138 changer transitions 37/311 dead transitions. [2024-11-07 11:26:52,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 311 transitions, 4072 flow [2024-11-07 11:26:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:26:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:26:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2024-11-07 11:26:52,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-11-07 11:26:52,090 INFO L175 Difference]: Start difference. First operand has 107 places, 209 transitions, 2770 flow. Second operand 8 states and 328 transitions. [2024-11-07 11:26:52,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 311 transitions, 4072 flow [2024-11-07 11:26:52,151 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 11:26:52,154 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-07 11:26:52,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:52,155 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 49 predicate places. [2024-11-07 11:26:52,155 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-07 11:26:52,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:26:52,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:52,155 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 11:26:52,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:26:52,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:52,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 609163479, now seen corresponding path program 7 times [2024-11-07 11:26:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616599052] [2024-11-07 11:26:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:52,278 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 11:26:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:52,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616599052] [2024-11-07 11:26:52,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616599052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:52,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:26:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647554149] [2024-11-07 11:26:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:52,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:26:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:26:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:26:52,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:52,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:26:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:54,098 INFO L124 PetriNetUnfolderBase]: 12306/19949 cut-off events. [2024-11-07 11:26:54,098 INFO L125 PetriNetUnfolderBase]: For 116069/116917 co-relation queries the response was YES. [2024-11-07 11:26:54,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79240 conditions, 19949 events. 12306/19949 cut-off events. For 116069/116917 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 151378 event pairs, 2965 based on Foata normal form. 496/19718 useless extension candidates. Maximal degree in co-relation 64408. Up to 7340 conditions per place. [2024-11-07 11:26:54,222 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-07 11:26:54,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-07 11:26:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:26:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:26:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-07 11:26:54,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-07 11:26:54,224 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 348 transitions. [2024-11-07 11:26:54,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-07 11:26:54,323 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 11:26:54,326 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-07 11:26:54,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, 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 11:26:54,327 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2024-11-07 11:26:54,327 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-07 11:26:54,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:26:54,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:54,327 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 11:26:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 11:26:54,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash -399461363, now seen corresponding path program 8 times [2024-11-07 11:26:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174219213] [2024-11-07 11:26:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:54,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:54,656 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 11:26:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174219213] [2024-11-07 11:26:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174219213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:54,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:26:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070241485] [2024-11-07 11:26:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:54,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:26:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:26:54,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:26:54,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:54,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:26:54,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:54,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:54,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:56,719 INFO L124 PetriNetUnfolderBase]: 11602/19036 cut-off events. [2024-11-07 11:26:56,720 INFO L125 PetriNetUnfolderBase]: For 131482/132528 co-relation queries the response was YES. [2024-11-07 11:26:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76781 conditions, 19036 events. 11602/19036 cut-off events. For 131482/132528 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 145751 event pairs, 2893 based on Foata normal form. 644/19054 useless extension candidates. Maximal degree in co-relation 61767. Up to 6983 conditions per place. [2024-11-07 11:26:56,852 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 109 selfloop transitions, 136 changer transitions 19/288 dead transitions. [2024-11-07 11:26:56,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-07 11:26:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:26:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 11:26:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2024-11-07 11:26:56,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2024-11-07 11:26:56,855 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 435 transitions. [2024-11-07 11:26:56,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-07 11:26:56,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-07 11:26:56,992 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-07 11:26:56,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2024-11-07 11:26:56,993 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2024-11-07 11:26:56,993 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-07 11:26:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:26:56,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:56,994 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 11:26:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 11:26:56,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:56,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1616034583, now seen corresponding path program 9 times [2024-11-07 11:26:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469891614] [2024-11-07 11:26:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:57,116 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 11:26:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469891614] [2024-11-07 11:26:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469891614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:26:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957999601] [2024-11-07 11:26:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:26:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:26:57,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:26:57,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:57,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:26:57,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:57,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:57,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:26:58,780 INFO L124 PetriNetUnfolderBase]: 11593/18921 cut-off events. [2024-11-07 11:26:58,781 INFO L125 PetriNetUnfolderBase]: For 146091/146869 co-relation queries the response was YES. [2024-11-07 11:26:58,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78286 conditions, 18921 events. 11593/18921 cut-off events. For 146091/146869 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 143993 event pairs, 3101 based on Foata normal form. 412/18644 useless extension candidates. Maximal degree in co-relation 62815. Up to 7053 conditions per place. [2024-11-07 11:26:58,895 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-07 11:26:58,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-07 11:26:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:26:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 11:26:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-07 11:26:58,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-07 11:26:58,897 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 438 transitions. [2024-11-07 11:26:58,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-07 11:26:59,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-07 11:26:59,024 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-07 11:26:59,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2024-11-07 11:26:59,025 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2024-11-07 11:26:59,025 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-07 11:26:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:26:59,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:26:59,025 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 11:26:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 11:26:59,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:26:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:26:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 928130973, now seen corresponding path program 3 times [2024-11-07 11:26:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:26:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218566971] [2024-11-07 11:26:59,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:26:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:26:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:26:59,147 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 11:26:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:26:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218566971] [2024-11-07 11:26:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218566971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:26:59,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:26:59,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:26:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825862233] [2024-11-07 11:26:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:26:59,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:26:59,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:26:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:26:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:26:59,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:26:59,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:26:59,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:26:59,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:26:59,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:27:00,910 INFO L124 PetriNetUnfolderBase]: 11390/18742 cut-off events. [2024-11-07 11:27:00,910 INFO L125 PetriNetUnfolderBase]: For 150555/151555 co-relation queries the response was YES. [2024-11-07 11:27:01,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77859 conditions, 18742 events. 11390/18742 cut-off events. For 150555/151555 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 144086 event pairs, 3028 based on Foata normal form. 614/18739 useless extension candidates. Maximal degree in co-relation 62517. Up to 6968 conditions per place. [2024-11-07 11:27:01,057 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 103 selfloop transitions, 128 changer transitions 33/288 dead transitions. [2024-11-07 11:27:01,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 288 transitions, 3830 flow [2024-11-07 11:27:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:27:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 11:27:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-07 11:27:01,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-07 11:27:01,059 INFO L175 Difference]: Start difference. First operand has 132 places, 181 transitions, 2659 flow. Second operand 12 states and 438 transitions. [2024-11-07 11:27:01,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 288 transitions, 3830 flow [2024-11-07 11:27:01,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 288 transitions, 3530 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-07 11:27:01,211 INFO L231 Difference]: Finished difference. Result has 133 places, 180 transitions, 2605 flow [2024-11-07 11:27:01,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=133, PETRI_TRANSITIONS=180} [2024-11-07 11:27:01,212 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2024-11-07 11:27:01,212 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 180 transitions, 2605 flow [2024-11-07 11:27:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:27:01,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:27:01,212 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 11:27:01,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 11:27:01,212 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:27:01,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:27:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1540992613, now seen corresponding path program 10 times [2024-11-07 11:27:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:27:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779206733] [2024-11-07 11:27:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:27:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:27:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:27:01,305 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 11:27:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:27:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779206733] [2024-11-07 11:27:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779206733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:27:01,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:27:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:27:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252732244] [2024-11-07 11:27:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:27:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:27:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:27:01,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:27:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:27:01,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:27:01,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 180 transitions, 2605 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:27:01,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:27:01,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:27:01,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:27:02,431 INFO L124 PetriNetUnfolderBase]: 9102/14907 cut-off events. [2024-11-07 11:27:02,431 INFO L125 PetriNetUnfolderBase]: For 114674/115679 co-relation queries the response was YES. [2024-11-07 11:27:02,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61246 conditions, 14907 events. 9102/14907 cut-off events. For 114674/115679 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 110914 event pairs, 2676 based on Foata normal form. 386/14878 useless extension candidates. Maximal degree in co-relation 49396. Up to 6034 conditions per place. [2024-11-07 11:27:02,512 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 85 selfloop transitions, 126 changer transitions 5/232 dead transitions. [2024-11-07 11:27:02,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 232 transitions, 3269 flow [2024-11-07 11:27:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:27:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:27:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2024-11-07 11:27:02,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6139359698681732 [2024-11-07 11:27:02,513 INFO L175 Difference]: Start difference. First operand has 133 places, 180 transitions, 2605 flow. Second operand 9 states and 326 transitions. [2024-11-07 11:27:02,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 232 transitions, 3269 flow [2024-11-07 11:27:02,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 3220 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-07 11:27:02,599 INFO L231 Difference]: Finished difference. Result has 138 places, 169 transitions, 2723 flow [2024-11-07 11:27:02,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2433, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2723, PETRI_PLACES=138, PETRI_TRANSITIONS=169} [2024-11-07 11:27:02,600 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 74 predicate places. [2024-11-07 11:27:02,600 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 169 transitions, 2723 flow [2024-11-07 11:27:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:27:02,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:27:02,600 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 11:27:02,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 11:27:02,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:27:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:27:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -334279585, now seen corresponding path program 3 times [2024-11-07 11:27:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:27:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333507535] [2024-11-07 11:27:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:27:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:27:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:27:02,710 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 11:27:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:27:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333507535] [2024-11-07 11:27:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333507535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:27:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:27:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:27:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629096000] [2024-11-07 11:27:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:27:02,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:27:02,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:27:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:27:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:27:02,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:27:02,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 169 transitions, 2723 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:27:02,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:27:02,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:27:02,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:27:03,503 INFO L124 PetriNetUnfolderBase]: 5037/8558 cut-off events. [2024-11-07 11:27:03,504 INFO L125 PetriNetUnfolderBase]: For 65844/66224 co-relation queries the response was YES. [2024-11-07 11:27:03,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35972 conditions, 8558 events. 5037/8558 cut-off events. For 65844/66224 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 59325 event pairs, 1487 based on Foata normal form. 396/8753 useless extension candidates. Maximal degree in co-relation 16054. Up to 2393 conditions per place. [2024-11-07 11:27:03,547 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 63 selfloop transitions, 31 changer transitions 111/221 dead transitions. [2024-11-07 11:27:03,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 221 transitions, 3179 flow [2024-11-07 11:27:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:27:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:27:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 315 transitions. [2024-11-07 11:27:03,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6673728813559322 [2024-11-07 11:27:03,549 INFO L175 Difference]: Start difference. First operand has 138 places, 169 transitions, 2723 flow. Second operand 8 states and 315 transitions. [2024-11-07 11:27:03,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 221 transitions, 3179 flow [2024-11-07 11:27:03,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 221 transitions, 3068 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 11:27:03,612 INFO L231 Difference]: Finished difference. Result has 144 places, 77 transitions, 897 flow [2024-11-07 11:27:03,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=897, PETRI_PLACES=144, PETRI_TRANSITIONS=77} [2024-11-07 11:27:03,612 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 80 predicate places. [2024-11-07 11:27:03,612 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 77 transitions, 897 flow [2024-11-07 11:27:03,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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 11:27:03,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:27:03,613 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 11:27:03,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 11:27:03,613 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:27:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:27:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1607343919, now seen corresponding path program 4 times [2024-11-07 11:27:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:27:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487559892] [2024-11-07 11:27:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:27:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:27:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:27:03,719 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 11:27:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:27:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487559892] [2024-11-07 11:27:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487559892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:27:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:27:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:27:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085269840] [2024-11-07 11:27:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:27:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:27:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:27:03,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:27:03,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:27:03,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:27:03,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 77 transitions, 897 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:27:03,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:27:03,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:27:03,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:27:04,004 INFO L124 PetriNetUnfolderBase]: 941/1657 cut-off events. [2024-11-07 11:27:04,004 INFO L125 PetriNetUnfolderBase]: For 10305/10341 co-relation queries the response was YES. [2024-11-07 11:27:04,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6188 conditions, 1657 events. 941/1657 cut-off events. For 10305/10341 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8138 event pairs, 164 based on Foata normal form. 70/1697 useless extension candidates. Maximal degree in co-relation 3046. Up to 578 conditions per place. [2024-11-07 11:27:04,011 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 51 selfloop transitions, 18 changer transitions 33/118 dead transitions. [2024-11-07 11:27:04,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 118 transitions, 1274 flow [2024-11-07 11:27:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:27:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:27:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-11-07 11:27:04,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-11-07 11:27:04,012 INFO L175 Difference]: Start difference. First operand has 144 places, 77 transitions, 897 flow. Second operand 8 states and 272 transitions. [2024-11-07 11:27:04,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 118 transitions, 1274 flow [2024-11-07 11:27:04,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 118 transitions, 965 flow, removed 44 selfloop flow, removed 33 redundant places. [2024-11-07 11:27:04,021 INFO L231 Difference]: Finished difference. Result has 110 places, 59 transitions, 372 flow [2024-11-07 11:27:04,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=110, PETRI_TRANSITIONS=59} [2024-11-07 11:27:04,021 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 46 predicate places. [2024-11-07 11:27:04,021 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 59 transitions, 372 flow [2024-11-07 11:27:04,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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 11:27:04,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:27:04,022 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 11:27:04,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 11:27:04,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-07 11:27:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:27:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1452585641, now seen corresponding path program 5 times [2024-11-07 11:27:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:27:04,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014138206] [2024-11-07 11:27:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:27:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:27:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:27:04,124 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 11:27:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:27:04,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014138206] [2024-11-07 11:27:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014138206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:27:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:27:04,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:27:04,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700473981] [2024-11-07 11:27:04,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:27:04,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 11:27:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:27:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 11:27:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 11:27:04,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-07 11:27:04,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 59 transitions, 372 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:27:04,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:27:04,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-07 11:27:04,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:27:04,326 INFO L124 PetriNetUnfolderBase]: 221/423 cut-off events. [2024-11-07 11:27:04,327 INFO L125 PetriNetUnfolderBase]: For 1266/1266 co-relation queries the response was YES. [2024-11-07 11:27:04,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 423 events. 221/423 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1275 event pairs, 36 based on Foata normal form. 16/425 useless extension candidates. Maximal degree in co-relation 821. Up to 138 conditions per place. [2024-11-07 11:27:04,328 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2024-11-07 11:27:04,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 76 transitions, 553 flow [2024-11-07 11:27:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:27:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 11:27:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2024-11-07 11:27:04,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4952919020715631 [2024-11-07 11:27:04,330 INFO L175 Difference]: Start difference. First operand has 110 places, 59 transitions, 372 flow. Second operand 9 states and 263 transitions. [2024-11-07 11:27:04,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 76 transitions, 553 flow [2024-11-07 11:27:04,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 385 flow, removed 14 selfloop flow, removed 34 redundant places. [2024-11-07 11:27:04,333 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2024-11-07 11:27:04,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2024-11-07 11:27:04,333 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 12 predicate places. [2024-11-07 11:27:04,333 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2024-11-07 11:27:04,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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 11:27:04,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-07 11:27:04,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-07 11:27:04,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-07 11:27:04,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-07 11:27:04,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-07 11:27:04,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 11:27:04,338 INFO L407 BasicCegarLoop]: Path program histogram: [10, 5, 3, 1] [2024-11-07 11:27:04,341 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:27:04,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:27:04,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:27:04 BasicIcfg [2024-11-07 11:27:04,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:27:04,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:27:04,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:27:04,346 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:27:04,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:26:11" (3/4) ... [2024-11-07 11:27:04,347 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 11:27:04,350 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 11:27:04,350 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 11:27:04,350 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-07 11:27:04,350 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-07 11:27:04,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2024-11-07 11:27:04,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-07 11:27:04,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 11:27:04,354 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 11:27:04,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:27:04,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 11:27:04,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:27:04,421 INFO L158 Benchmark]: Toolchain (without parser) took 53987.21ms. Allocated memory was 100.7MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 76.9MB in the beginning and 9.6GB in the end (delta: -9.5GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-07 11:27:04,421 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:27:04,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.46ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:27:04,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:27:04,422 INFO L158 Benchmark]: Boogie Preprocessor took 37.38ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:27:04,422 INFO L158 Benchmark]: RCFGBuilder took 617.69ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 66.7MB in the end (delta: -5.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-07 11:27:04,422 INFO L158 Benchmark]: TraceAbstraction took 52938.23ms. Allocated memory was 100.7MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 65.9MB in the beginning and 9.6GB in the end (delta: -9.6GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2024-11-07 11:27:04,422 INFO L158 Benchmark]: Witness Printer took 74.60ms. Allocated memory is still 13.8GB. Free memory was 9.6GB in the beginning and 9.6GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:27:04,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.46ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.9MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.38ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 617.69ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 66.7MB in the end (delta: -5.2MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 52938.23ms. Allocated memory was 100.7MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 65.9MB in the beginning and 9.6GB in the end (delta: -9.6GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 74.60ms. Allocated memory is still 13.8GB. Free memory was 9.6GB in the beginning and 9.6GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 93 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 52.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 49.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1206 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1197 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5608 IncrementalHoareTripleChecker+Invalid, 5947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 9 mSDtfsCounter, 5608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2929occurred in iteration=9, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 2334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 11:27:04,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE