./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/chl-nzb-file-trans.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 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:39:22,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:39:22,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:39:22,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:39:22,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:39:22,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:39:22,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:39:22,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:39:22,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:39:22,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:39:22,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:39:22,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:39:22,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:39:22,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:39:22,240 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:39:22,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:39:22,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:39:22,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:22,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:22,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:22,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:22,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:39:22,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:39:22,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:39:22,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:39:22,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:39:22,245 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 -> 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b [2025-01-09 16:39:22,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:39:22,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:39:22,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:39:22,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:39:22,540 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:39:22,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-01-09 16:39:23,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cda27f19/194301f6ec734a3d859475cf0d35ba21/FLAGbe698b86b [2025-01-09 16:39:24,207 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:39:24,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-01-09 16:39:24,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cda27f19/194301f6ec734a3d859475cf0d35ba21/FLAGbe698b86b [2025-01-09 16:39:24,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cda27f19/194301f6ec734a3d859475cf0d35ba21 [2025-01-09 16:39:24,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:39:24,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:39:24,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:24,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:39:24,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:39:24,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac8b913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24, skipping insertion in model container [2025-01-09 16:39:24,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:39:24,445 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-01-09 16:39:24,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:24,476 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:39:24,513 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/chl-nzb-file-trans.wvr.c[6489,6502] [2025-01-09 16:39:24,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:24,536 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:39:24,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24 WrapperNode [2025-01-09 16:39:24,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:24,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:24,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:39:24,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:39:24,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,597 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-01-09 16:39:24,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:24,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:39:24,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:39:24,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:39:24,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,653 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:39:24,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:39:24,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:39:24,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:39:24,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:39:24,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (1/1) ... [2025-01-09 16:39:24,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:24,740 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) [2025-01-09 16:39:24,743 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 [2025-01-09 16:39:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:39:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:24,770 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:39:24,913 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:24,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:25,702 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:25,702 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:26,549 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:26,551 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:39:26,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:26 BoogieIcfgContainer [2025-01-09 16:39:26,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:26,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:26,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:26,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:26,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:24" (1/3) ... [2025-01-09 16:39:26,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621edab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:26, skipping insertion in model container [2025-01-09 16:39:26,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:24" (2/3) ... [2025-01-09 16:39:26,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621edab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:26, skipping insertion in model container [2025-01-09 16:39:26,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:26" (3/3) ... [2025-01-09 16:39:26,561 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-01-09 16:39:26,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:26,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:39:26,576 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:26,712 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:39:26,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:39:26,790 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-01-09 16:39:26,793 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:26,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-09 16:39:26,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:39:26,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-01-09 16:39:26,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:26,821 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;@45268f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:26,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:39:26,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:26,850 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-01-09 16:39:26,851 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:26,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:26,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:26,852 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 1 more)] === [2025-01-09 16:39:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1867896692, now seen corresponding path program 1 times [2025-01-09 16:39:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048481024] [2025-01-09 16:39:26,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:26,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:26,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:39:27,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:39:27,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:27,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048481024] [2025-01-09 16:39:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048481024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:27,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:27,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223214053] [2025-01-09 16:39:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:27,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:27,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:27,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:27,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:27,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-01-09 16:39:27,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:27,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:27,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:28,212 INFO L124 PetriNetUnfolderBase]: 2373/3237 cut-off events. [2025-01-09 16:39:28,213 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-09 16:39:28,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 3237 events. 2373/3237 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12260 event pairs, 1692 based on Foata normal form. 0/2556 useless extension candidates. Maximal degree in co-relation 6206. Up to 3234 conditions per place. [2025-01-09 16:39:28,232 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 38 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-01-09 16:39:28,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 196 flow [2025-01-09 16:39:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-01-09 16:39:28,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-01-09 16:39:28,245 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 62 transitions. [2025-01-09 16:39:28,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 196 flow [2025-01-09 16:39:28,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:28,259 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 122 flow [2025-01-09 16:39:28,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-01-09 16:39:28,267 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-09 16:39:28,267 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 122 flow [2025-01-09 16:39:28,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-01-09 16:39:28,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:28,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:28,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:28,268 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 1 more)] === [2025-01-09 16:39:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1369665860, now seen corresponding path program 1 times [2025-01-09 16:39:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243917857] [2025-01-09 16:39:28,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:28,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243917857] [2025-01-09 16:39:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243917857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789389465] [2025-01-09 16:39:28,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:28,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:28,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:39:28,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:28,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:28,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:28,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789389465] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:28,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 16:39:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275053269] [2025-01-09 16:39:28,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:28,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:28,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:28,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2025-01-09 16:39:28,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:28,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:28,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:29,602 INFO L124 PetriNetUnfolderBase]: 2373/3246 cut-off events. [2025-01-09 16:39:29,602 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-09 16:39:29,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3246 events. 2373/3246 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12256 event pairs, 1692 based on Foata normal form. 6/2573 useless extension candidates. Maximal degree in co-relation 6525. Up to 3234 conditions per place. [2025-01-09 16:39:29,619 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 38 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2025-01-09 16:39:29,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 264 flow [2025-01-09 16:39:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-01-09 16:39:29,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-01-09 16:39:29,621 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 122 flow. Second operand 6 states and 86 transitions. [2025-01-09 16:39:29,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 264 flow [2025-01-09 16:39:29,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:29,624 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 212 flow [2025-01-09 16:39:29,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2025-01-09 16:39:29,625 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-01-09 16:39:29,625 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 212 flow [2025-01-09 16:39:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2025-01-09 16:39:29,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:29,626 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:29,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:39:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:29,830 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 1 more)] === [2025-01-09 16:39:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 998091822, now seen corresponding path program 2 times [2025-01-09 16:39:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827390850] [2025-01-09 16:39:29,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:29,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:29,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-01-09 16:39:29,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:30,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:30,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827390850] [2025-01-09 16:39:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827390850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:30,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335681260] [2025-01-09 16:39:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:30,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:30,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:30,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:30,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:30,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:30,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:30,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:31,894 INFO L124 PetriNetUnfolderBase]: 3867/5443 cut-off events. [2025-01-09 16:39:31,894 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-01-09 16:39:31,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 5443 events. 3867/5443 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25065 event pairs, 1692 based on Foata normal form. 1/4412 useless extension candidates. Maximal degree in co-relation 10934. Up to 3132 conditions per place. [2025-01-09 16:39:31,919 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 107 selfloop transitions, 13 changer transitions 1/122 dead transitions. [2025-01-09 16:39:31,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 122 transitions, 602 flow [2025-01-09 16:39:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-09 16:39:31,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-01-09 16:39:31,922 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 212 flow. Second operand 5 states and 130 transitions. [2025-01-09 16:39:31,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 122 transitions, 602 flow [2025-01-09 16:39:31,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 122 transitions, 578 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:31,927 INFO L231 Difference]: Finished difference. Result has 53 places, 66 transitions, 287 flow [2025-01-09 16:39:31,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=53, PETRI_TRANSITIONS=66} [2025-01-09 16:39:31,929 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-01-09 16:39:31,929 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 66 transitions, 287 flow [2025-01-09 16:39:31,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:31,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:31,930 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:31,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:39:31,930 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 1 more)] === [2025-01-09 16:39:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1713295804, now seen corresponding path program 3 times [2025-01-09 16:39:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850743722] [2025-01-09 16:39:31,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:31,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-01-09 16:39:31,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-01-09 16:39:31,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:31,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:32,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:32,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850743722] [2025-01-09 16:39:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850743722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:32,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040660262] [2025-01-09 16:39:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:32,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:32,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:32,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:32,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:32,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 66 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:32,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:32,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:32,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:34,762 INFO L124 PetriNetUnfolderBase]: 9364/13163 cut-off events. [2025-01-09 16:39:34,763 INFO L125 PetriNetUnfolderBase]: For 5697/5697 co-relation queries the response was YES. [2025-01-09 16:39:34,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32201 conditions, 13163 events. 9364/13163 cut-off events. For 5697/5697 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 70108 event pairs, 1562 based on Foata normal form. 1/12700 useless extension candidates. Maximal degree in co-relation 32121. Up to 4067 conditions per place. [2025-01-09 16:39:34,836 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 136 selfloop transitions, 43 changer transitions 1/181 dead transitions. [2025-01-09 16:39:34,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 181 transitions, 1011 flow [2025-01-09 16:39:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2025-01-09 16:39:34,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2025-01-09 16:39:34,841 INFO L175 Difference]: Start difference. First operand has 53 places, 66 transitions, 287 flow. Second operand 6 states and 176 transitions. [2025-01-09 16:39:34,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 181 transitions, 1011 flow [2025-01-09 16:39:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 181 transitions, 1011 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:34,851 INFO L231 Difference]: Finished difference. Result has 63 places, 101 transitions, 664 flow [2025-01-09 16:39:34,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=63, PETRI_TRANSITIONS=101} [2025-01-09 16:39:34,852 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-01-09 16:39:34,852 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 101 transitions, 664 flow [2025-01-09 16:39:34,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:34,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:34,852 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:34,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:39:34,852 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 1 more)] === [2025-01-09 16:39:34,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1598274702, now seen corresponding path program 4 times [2025-01-09 16:39:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808648775] [2025-01-09 16:39:34,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:34,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:34,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:39:34,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:34,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808648775] [2025-01-09 16:39:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808648775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:35,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983087465] [2025-01-09 16:39:35,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:35,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:35,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:39:35,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-01-09 16:39:35,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:39:35,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:35,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:39:35,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:35,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983087465] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:35,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:35,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 16:39:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572993205] [2025-01-09 16:39:35,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:35,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:39:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:35,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:39:35,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:39:35,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:35,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 101 transitions, 664 flow. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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) [2025-01-09 16:39:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:37,365 INFO L124 PetriNetUnfolderBase]: 9364/13166 cut-off events. [2025-01-09 16:39:37,365 INFO L125 PetriNetUnfolderBase]: For 20754/20754 co-relation queries the response was YES. [2025-01-09 16:39:37,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39169 conditions, 13166 events. 9364/13166 cut-off events. For 20754/20754 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 69666 event pairs, 6354 based on Foata normal form. 1/12743 useless extension candidates. Maximal degree in co-relation 39072. Up to 13144 conditions per place. [2025-01-09 16:39:37,439 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 85 selfloop transitions, 18 changer transitions 0/104 dead transitions. [2025-01-09 16:39:37,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 888 flow [2025-01-09 16:39:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-01-09 16:39:37,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2536443148688047 [2025-01-09 16:39:37,441 INFO L175 Difference]: Start difference. First operand has 63 places, 101 transitions, 664 flow. Second operand 7 states and 87 transitions. [2025-01-09 16:39:37,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 888 flow [2025-01-09 16:39:37,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 868 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:37,490 INFO L231 Difference]: Finished difference. Result has 70 places, 104 transitions, 712 flow [2025-01-09 16:39:37,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=712, PETRI_PLACES=70, PETRI_TRANSITIONS=104} [2025-01-09 16:39:37,491 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-01-09 16:39:37,491 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 104 transitions, 712 flow [2025-01-09 16:39:37,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 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) [2025-01-09 16:39:37,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:37,492 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:37,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:39:37,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:37,696 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 1 more)] === [2025-01-09 16:39:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash 593340338, now seen corresponding path program 5 times [2025-01-09 16:39:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162071303] [2025-01-09 16:39:37,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:37,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:39:37,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:39:37,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:39:37,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162071303] [2025-01-09 16:39:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162071303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:38,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106109307] [2025-01-09 16:39:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:38,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:38,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:38,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:38,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 104 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:38,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:38,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:38,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:40,587 INFO L124 PetriNetUnfolderBase]: 11624/16479 cut-off events. [2025-01-09 16:39:40,587 INFO L125 PetriNetUnfolderBase]: For 22083/22083 co-relation queries the response was YES. [2025-01-09 16:39:40,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47361 conditions, 16479 events. 11624/16479 cut-off events. For 22083/22083 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 90325 event pairs, 3505 based on Foata normal form. 1/15956 useless extension candidates. Maximal degree in co-relation 47243. Up to 6638 conditions per place. [2025-01-09 16:39:40,680 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 142 selfloop transitions, 53 changer transitions 1/197 dead transitions. [2025-01-09 16:39:40,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 197 transitions, 1537 flow [2025-01-09 16:39:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-01-09 16:39:40,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877551020408164 [2025-01-09 16:39:40,682 INFO L175 Difference]: Start difference. First operand has 70 places, 104 transitions, 712 flow. Second operand 5 states and 144 transitions. [2025-01-09 16:39:40,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 197 transitions, 1537 flow [2025-01-09 16:39:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 197 transitions, 1501 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:40,729 INFO L231 Difference]: Finished difference. Result has 74 places, 136 transitions, 1200 flow [2025-01-09 16:39:40,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1200, PETRI_PLACES=74, PETRI_TRANSITIONS=136} [2025-01-09 16:39:40,729 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2025-01-09 16:39:40,730 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 136 transitions, 1200 flow [2025-01-09 16:39:40,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:40,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:40,730 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:39:40,730 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 1 more)] === [2025-01-09 16:39:40,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash -566963502, now seen corresponding path program 6 times [2025-01-09 16:39:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869708616] [2025-01-09 16:39:40,731 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:40,754 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-01-09 16:39:40,766 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-01-09 16:39:40,766 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:39:40,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869708616] [2025-01-09 16:39:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869708616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953607534] [2025-01-09 16:39:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:41,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:41,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:41,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:41,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 136 transitions, 1200 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:41,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:41,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:43,493 INFO L124 PetriNetUnfolderBase]: 14572/20588 cut-off events. [2025-01-09 16:39:43,493 INFO L125 PetriNetUnfolderBase]: For 55255/55255 co-relation queries the response was YES. [2025-01-09 16:39:43,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66364 conditions, 20588 events. 14572/20588 cut-off events. For 55255/55255 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 117496 event pairs, 3895 based on Foata normal form. 1/19877 useless extension candidates. Maximal degree in co-relation 66260. Up to 7886 conditions per place. [2025-01-09 16:39:43,613 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 146 selfloop transitions, 71 changer transitions 4/222 dead transitions. [2025-01-09 16:39:43,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 222 transitions, 2111 flow [2025-01-09 16:39:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2025-01-09 16:39:43,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795918367346938 [2025-01-09 16:39:43,616 INFO L175 Difference]: Start difference. First operand has 74 places, 136 transitions, 1200 flow. Second operand 5 states and 142 transitions. [2025-01-09 16:39:43,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 222 transitions, 2111 flow [2025-01-09 16:39:43,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 222 transitions, 2099 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:43,784 INFO L231 Difference]: Finished difference. Result has 81 places, 163 transitions, 1728 flow [2025-01-09 16:39:43,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1728, PETRI_PLACES=81, PETRI_TRANSITIONS=163} [2025-01-09 16:39:43,786 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2025-01-09 16:39:43,786 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 163 transitions, 1728 flow [2025-01-09 16:39:43,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:43,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:43,787 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:39:43,787 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 1 more)] === [2025-01-09 16:39:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2064541084, now seen corresponding path program 7 times [2025-01-09 16:39:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062803141] [2025-01-09 16:39:43,787 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:43,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:39:43,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:39:43,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:43,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062803141] [2025-01-09 16:39:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062803141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427833344] [2025-01-09 16:39:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:44,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:44,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:44,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:44,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:44,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 163 transitions, 1728 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:44,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:44,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:44,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:48,317 INFO L124 PetriNetUnfolderBase]: 22021/30973 cut-off events. [2025-01-09 16:39:48,317 INFO L125 PetriNetUnfolderBase]: For 104353/104353 co-relation queries the response was YES. [2025-01-09 16:39:48,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108519 conditions, 30973 events. 22021/30973 cut-off events. For 104353/104353 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 184828 event pairs, 6612 based on Foata normal form. 1/30974 useless extension candidates. Maximal degree in co-relation 108411. Up to 13191 conditions per place. [2025-01-09 16:39:48,545 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 228 selfloop transitions, 68 changer transitions 2/299 dead transitions. [2025-01-09 16:39:48,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 299 transitions, 3319 flow [2025-01-09 16:39:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-01-09 16:39:48,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6040816326530613 [2025-01-09 16:39:48,547 INFO L175 Difference]: Start difference. First operand has 81 places, 163 transitions, 1728 flow. Second operand 5 states and 148 transitions. [2025-01-09 16:39:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 299 transitions, 3319 flow [2025-01-09 16:39:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 299 transitions, 3217 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:48,811 INFO L231 Difference]: Finished difference. Result has 87 places, 212 transitions, 2481 flow [2025-01-09 16:39:48,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2481, PETRI_PLACES=87, PETRI_TRANSITIONS=212} [2025-01-09 16:39:48,812 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2025-01-09 16:39:48,814 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 212 transitions, 2481 flow [2025-01-09 16:39:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:48,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:48,815 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:39:48,815 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 1 more)] === [2025-01-09 16:39:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -895200014, now seen corresponding path program 8 times [2025-01-09 16:39:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244074132] [2025-01-09 16:39:48,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:48,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 16:39:48,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-01-09 16:39:48,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:48,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244074132] [2025-01-09 16:39:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244074132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:49,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:49,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:39:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013310615] [2025-01-09 16:39:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:49,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:39:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:49,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:39:49,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:39:49,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:49,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 212 transitions, 2481 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:49,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:49,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:49,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:54,042 INFO L124 PetriNetUnfolderBase]: 22784/32101 cut-off events. [2025-01-09 16:39:54,042 INFO L125 PetriNetUnfolderBase]: For 145007/145007 co-relation queries the response was YES. [2025-01-09 16:39:54,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120915 conditions, 32101 events. 22784/32101 cut-off events. For 145007/145007 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 194198 event pairs, 4886 based on Foata normal form. 1/32102 useless extension candidates. Maximal degree in co-relation 120805. Up to 11459 conditions per place. [2025-01-09 16:39:54,319 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 229 selfloop transitions, 109 changer transitions 2/341 dead transitions. [2025-01-09 16:39:54,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 341 transitions, 3998 flow [2025-01-09 16:39:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-01-09 16:39:54,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-01-09 16:39:54,321 INFO L175 Difference]: Start difference. First operand has 87 places, 212 transitions, 2481 flow. Second operand 6 states and 180 transitions. [2025-01-09 16:39:54,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 341 transitions, 3998 flow [2025-01-09 16:39:54,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 341 transitions, 3858 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:54,923 INFO L231 Difference]: Finished difference. Result has 96 places, 243 transitions, 3182 flow [2025-01-09 16:39:54,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2387, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3182, PETRI_PLACES=96, PETRI_TRANSITIONS=243} [2025-01-09 16:39:54,924 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2025-01-09 16:39:54,924 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 243 transitions, 3182 flow [2025-01-09 16:39:54,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) [2025-01-09 16:39:54,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:54,925 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:54,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:39:54,925 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 1 more)] === [2025-01-09 16:39:54,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -364961810, now seen corresponding path program 1 times [2025-01-09 16:39:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:54,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815151519] [2025-01-09 16:39:54,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:54,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:39:54,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:39:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:39:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815151519] [2025-01-09 16:39:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815151519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825751043] [2025-01-09 16:39:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:55,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:55,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:55,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:55,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:39:55,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 243 transitions, 3182 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2025-01-09 16:39:55,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:55,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:39:55,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:00,445 INFO L124 PetriNetUnfolderBase]: 23986/33937 cut-off events. [2025-01-09 16:40:00,445 INFO L125 PetriNetUnfolderBase]: For 182015/182015 co-relation queries the response was YES. [2025-01-09 16:40:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129990 conditions, 33937 events. 23986/33937 cut-off events. For 182015/182015 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 209053 event pairs, 8387 based on Foata normal form. 4/33941 useless extension candidates. Maximal degree in co-relation 129876. Up to 28037 conditions per place. [2025-01-09 16:40:00,710 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 237 selfloop transitions, 18 changer transitions 53/309 dead transitions. [2025-01-09 16:40:00,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 309 transitions, 4379 flow [2025-01-09 16:40:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:40:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:40:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-01-09 16:40:00,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2025-01-09 16:40:00,711 INFO L175 Difference]: Start difference. First operand has 96 places, 243 transitions, 3182 flow. Second operand 4 states and 103 transitions. [2025-01-09 16:40:00,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 309 transitions, 4379 flow [2025-01-09 16:40:01,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 309 transitions, 4339 flow, removed 20 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:01,501 INFO L231 Difference]: Finished difference. Result has 102 places, 228 transitions, 3030 flow [2025-01-09 16:40:01,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3030, PETRI_PLACES=102, PETRI_TRANSITIONS=228} [2025-01-09 16:40:01,501 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2025-01-09 16:40:01,502 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 228 transitions, 3030 flow [2025-01-09 16:40:01,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2025-01-09 16:40:01,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:01,502 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:01,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:40:01,502 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 1 more)] === [2025-01-09 16:40:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -62488772, now seen corresponding path program 1 times [2025-01-09 16:40:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954048543] [2025-01-09 16:40:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:01,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:40:01,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:40:01,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:01,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:40:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954048543] [2025-01-09 16:40:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954048543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142130208] [2025-01-09 16:40:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:01,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:01,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:01,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:01,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-01-09 16:40:01,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 228 transitions, 3030 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2025-01-09 16:40:01,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:01,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-01-09 16:40:01,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand