./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.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/parallel-lamport.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 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:41:23,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:41:23,643 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:41:23,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:41:23,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:41:23,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:41:23,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:41:23,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:41:23,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:41:23,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:41:23,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:41:23,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:41:23,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:41:23,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:41:23,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:23,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:23,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:41:23,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:41:23,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:41:23,672 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 -> 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 [2025-01-09 16:41:23,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:41:23,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:41:23,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:41:23,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:41:23,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:41:23,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-01-09 16:41:25,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e5b96fde/a24fa7cf261343fe8571dc7b5cc7ff73/FLAG8a90d11c8 [2025-01-09 16:41:25,276 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:41:25,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-01-09 16:41:25,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e5b96fde/a24fa7cf261343fe8571dc7b5cc7ff73/FLAG8a90d11c8 [2025-01-09 16:41:25,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e5b96fde/a24fa7cf261343fe8571dc7b5cc7ff73 [2025-01-09 16:41:25,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:41:25,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:41:25,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:25,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:41:25,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:41:25,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dedaa3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25, skipping insertion in model container [2025-01-09 16:41:25,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:41:25,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[3044,3057] [2025-01-09 16:41:25,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:25,764 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:41:25,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[3044,3057] [2025-01-09 16:41:25,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:25,801 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:41:25,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25 WrapperNode [2025-01-09 16:41:25,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:25,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:25,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:41:25,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:41:25,809 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:41:25" (1/1) ... [2025-01-09 16:41:25,814 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:41:25" (1/1) ... [2025-01-09 16:41:25,831 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 204 [2025-01-09 16:41:25,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:25,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:41:25,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:41:25,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:41:25,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,854 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:41:25,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:41:25,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:41:25,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:41:25,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:41:25,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (1/1) ... [2025-01-09 16:41:25,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:25,889 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:41:25,894 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:41:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:41:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:41:25,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:41:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:41:25,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:41:25,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:41:25,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:41:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:41:25,909 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:41:25,983 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:41:25,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:41:26,190 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:41:26,190 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:41:26,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:41:26,342 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:41:26,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:26 BoogieIcfgContainer [2025-01-09 16:41:26,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:41:26,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:41:26,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:41:26,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:41:26,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:41:25" (1/3) ... [2025-01-09 16:41:26,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d72126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:26, skipping insertion in model container [2025-01-09 16:41:26,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:25" (2/3) ... [2025-01-09 16:41:26,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d72126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:26, skipping insertion in model container [2025-01-09 16:41:26,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:26" (3/3) ... [2025-01-09 16:41:26,349 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-01-09 16:41:26,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:41:26,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:41:26,361 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:41:26,424 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:41:26,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 141 flow [2025-01-09 16:41:26,485 INFO L124 PetriNetUnfolderBase]: 1/57 cut-off events. [2025-01-09 16:41:26,486 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:26,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 1/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-01-09 16:41:26,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 141 flow [2025-01-09 16:41:26,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 130 flow [2025-01-09 16:41:26,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:41:26,509 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;@19d920e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:41:26,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:41:26,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:41:26,527 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2025-01-09 16:41:26,527 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:26,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:26,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:26,528 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:41:26,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1339780440, now seen corresponding path program 1 times [2025-01-09 16:41:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630532995] [2025-01-09 16:41:26,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:26,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:41:26,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:41:26,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:26,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:26,989 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:41:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630532995] [2025-01-09 16:41:26,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630532995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:26,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930059900] [2025-01-09 16:41:26,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:26,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:27,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-01-09 16:41:27,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:41:27,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:27,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-01-09 16:41:27,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:27,178 INFO L124 PetriNetUnfolderBase]: 307/588 cut-off events. [2025-01-09 16:41:27,178 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-09 16:41:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 588 events. 307/588 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3318 event pairs, 306 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 1004. Up to 507 conditions per place. [2025-01-09 16:41:27,186 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 28 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-01-09 16:41:27,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 192 flow [2025-01-09 16:41:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-01-09 16:41:27,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2025-01-09 16:41:27,196 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 130 flow. Second operand 3 states and 121 transitions. [2025-01-09 16:41:27,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 192 flow [2025-01-09 16:41:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 180 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:41:27,201 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 130 flow [2025-01-09 16:41:27,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-01-09 16:41:27,205 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2025-01-09 16:41:27,205 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 130 flow [2025-01-09 16:41:27,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:41:27,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:27,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:27,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:41:27,206 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:41:27,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1420738007, now seen corresponding path program 1 times [2025-01-09 16:41:27,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:27,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539248973] [2025-01-09 16:41:27,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:27,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:41:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:27,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:27,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:27,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539248973] [2025-01-09 16:41:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539248973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95517387] [2025-01-09 16:41:27,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:27,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:27,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:27,987 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:41:27,988 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:41:28,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:41:28,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:28,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:28,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:28,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:41:28,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:28,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-09 16:41:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:28,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:41:29,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-01-09 16:41:29,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:41:29,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-01-09 16:41:29,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2025-01-09 16:41:29,613 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 16:41:29,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 1 [2025-01-09 16:41:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95517387] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:41:29,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:41:29,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-01-09 16:41:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172935105] [2025-01-09 16:41:29,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:41:29,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:41:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:29,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:41:29,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:41:29,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-09 16:41:29,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 130 flow. Second operand has 26 states, 26 states have (on average 24.423076923076923) internal successors, (635), 26 states have internal predecessors, (635), 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:41:29,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:29,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-09 16:41:29,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:32,416 INFO L124 PetriNetUnfolderBase]: 4073/6851 cut-off events. [2025-01-09 16:41:32,416 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-01-09 16:41:32,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13384 conditions, 6851 events. 4073/6851 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 48091 event pairs, 574 based on Foata normal form. 4/6797 useless extension candidates. Maximal degree in co-relation 13354. Up to 1476 conditions per place. [2025-01-09 16:41:32,450 INFO L140 encePairwiseOnDemand]: 40/60 looper letters, 218 selfloop transitions, 122 changer transitions 95/453 dead transitions. [2025-01-09 16:41:32,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 453 transitions, 1862 flow [2025-01-09 16:41:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 16:41:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-01-09 16:41:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1342 transitions. [2025-01-09 16:41:32,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5201550387596899 [2025-01-09 16:41:32,460 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 130 flow. Second operand 43 states and 1342 transitions. [2025-01-09 16:41:32,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 453 transitions, 1862 flow [2025-01-09 16:41:32,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 453 transitions, 1858 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:32,467 INFO L231 Difference]: Finished difference. Result has 120 places, 188 transitions, 845 flow [2025-01-09 16:41:32,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=845, PETRI_PLACES=120, PETRI_TRANSITIONS=188} [2025-01-09 16:41:32,468 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 55 predicate places. [2025-01-09 16:41:32,468 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 188 transitions, 845 flow [2025-01-09 16:41:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 24.423076923076923) internal successors, (635), 26 states have internal predecessors, (635), 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:41:32,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:32,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:32,478 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:41:32,669 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:41:32,669 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:41:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1056926309, now seen corresponding path program 2 times [2025-01-09 16:41:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17032934] [2025-01-09 16:41:32,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:32,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:32,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:41:32,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:32,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:32,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:32,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17032934] [2025-01-09 16:41:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17032934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:32,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:32,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:41:32,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498681466] [2025-01-09 16:41:32,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:41:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:32,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:41:32,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:41:32,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-09 16:41:32,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 188 transitions, 845 flow. Second operand has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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:41:32,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:32,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-09 16:41:32,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:33,587 INFO L124 PetriNetUnfolderBase]: 4736/8601 cut-off events. [2025-01-09 16:41:33,587 INFO L125 PetriNetUnfolderBase]: For 12135/12331 co-relation queries the response was YES. [2025-01-09 16:41:33,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22982 conditions, 8601 events. 4736/8601 cut-off events. For 12135/12331 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 64482 event pairs, 1240 based on Foata normal form. 135/8510 useless extension candidates. Maximal degree in co-relation 22943. Up to 3157 conditions per place. [2025-01-09 16:41:33,676 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 166 selfloop transitions, 7 changer transitions 4/273 dead transitions. [2025-01-09 16:41:33,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 273 transitions, 1596 flow [2025-01-09 16:41:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:41:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:41:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2025-01-09 16:41:33,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2025-01-09 16:41:33,680 INFO L175 Difference]: Start difference. First operand has 120 places, 188 transitions, 845 flow. Second operand 5 states and 194 transitions. [2025-01-09 16:41:33,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 273 transitions, 1596 flow [2025-01-09 16:41:33,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 273 transitions, 1554 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-01-09 16:41:33,793 INFO L231 Difference]: Finished difference. Result has 120 places, 192 transitions, 858 flow [2025-01-09 16:41:33,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=858, PETRI_PLACES=120, PETRI_TRANSITIONS=192} [2025-01-09 16:41:33,796 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 55 predicate places. [2025-01-09 16:41:33,796 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 192 transitions, 858 flow [2025-01-09 16:41:33,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.666666666666668) internal successors, (184), 6 states have internal predecessors, (184), 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:41:33,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:33,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:41:33,797 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:41:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 745415097, now seen corresponding path program 3 times [2025-01-09 16:41:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774809454] [2025-01-09 16:41:33,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:41:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:33,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:33,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:41:33,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:41:33,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774809454] [2025-01-09 16:41:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774809454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:41:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009504744] [2025-01-09 16:41:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:33,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:41:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:33,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:41:33,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:41:33,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-01-09 16:41:33,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 192 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:41:33,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:33,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-01-09 16:41:33,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:34,497 INFO L124 PetriNetUnfolderBase]: 3515/6752 cut-off events. [2025-01-09 16:41:34,497 INFO L125 PetriNetUnfolderBase]: For 7435/7524 co-relation queries the response was YES. [2025-01-09 16:41:34,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18343 conditions, 6752 events. 3515/6752 cut-off events. For 7435/7524 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 53272 event pairs, 1894 based on Foata normal form. 81/6415 useless extension candidates. Maximal degree in co-relation 16409. Up to 4432 conditions per place. [2025-01-09 16:41:34,539 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 102 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-01-09 16:41:34,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 207 transitions, 1133 flow [2025-01-09 16:41:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:41:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:41:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-01-09 16:41:34,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-01-09 16:41:34,541 INFO L175 Difference]: Start difference. First operand has 120 places, 192 transitions, 858 flow. Second operand 3 states and 125 transitions. [2025-01-09 16:41:34,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 207 transitions, 1133 flow [2025-01-09 16:41:34,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 207 transitions, 1129 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:34,585 INFO L231 Difference]: Finished difference. Result has 122 places, 192 transitions, 862 flow [2025-01-09 16:41:34,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=122, PETRI_TRANSITIONS=192} [2025-01-09 16:41:34,586 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 57 predicate places. [2025-01-09 16:41:34,586 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 192 transitions, 862 flow [2025-01-09 16:41:34,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:41:34,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:34,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:34,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:41:34,587 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:41:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash -899540573, now seen corresponding path program 4 times [2025-01-09 16:41:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015052263] [2025-01-09 16:41:34,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:34,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:34,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-01-09 16:41:34,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:41:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:34,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:34,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015052263] [2025-01-09 16:41:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015052263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873358715] [2025-01-09 16:41:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:34,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:34,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:41:34,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:41:34,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 192 transitions, 862 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:34,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:34,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:41:34,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:36,523 INFO L124 PetriNetUnfolderBase]: 7466/12655 cut-off events. [2025-01-09 16:41:36,523 INFO L125 PetriNetUnfolderBase]: For 17440/17649 co-relation queries the response was YES. [2025-01-09 16:41:36,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37559 conditions, 12655 events. 7466/12655 cut-off events. For 17440/17649 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 91884 event pairs, 1465 based on Foata normal form. 189/12700 useless extension candidates. Maximal degree in co-relation 33533. Up to 7797 conditions per place. [2025-01-09 16:41:36,610 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 337 selfloop transitions, 180 changer transitions 32/569 dead transitions. [2025-01-09 16:41:36,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 569 transitions, 3730 flow [2025-01-09 16:41:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 16:41:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-01-09 16:41:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 929 transitions. [2025-01-09 16:41:36,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4553921568627451 [2025-01-09 16:41:36,614 INFO L175 Difference]: Start difference. First operand has 122 places, 192 transitions, 862 flow. Second operand 34 states and 929 transitions. [2025-01-09 16:41:36,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 569 transitions, 3730 flow [2025-01-09 16:41:36,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 569 transitions, 3726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:36,790 INFO L231 Difference]: Finished difference. Result has 182 places, 360 transitions, 2523 flow [2025-01-09 16:41:36,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2523, PETRI_PLACES=182, PETRI_TRANSITIONS=360} [2025-01-09 16:41:36,790 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 117 predicate places. [2025-01-09 16:41:36,791 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 360 transitions, 2523 flow [2025-01-09 16:41:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:36,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:36,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:36,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:41:36,791 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:41:36,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash -590798965, now seen corresponding path program 5 times [2025-01-09 16:41:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:36,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859825495] [2025-01-09 16:41:36,792 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:41:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:36,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:36,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:36,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:41:36,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859825495] [2025-01-09 16:41:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859825495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:37,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036561567] [2025-01-09 16:41:37,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:41:37,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:37,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:37,606 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:41:37,610 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:41:37,657 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:37,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:37,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:41:37,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:37,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:41:37,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:37,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:41:37,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 16:41:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:37,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:41:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036561567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:41:37,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 21 [2025-01-09 16:41:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441296628] [2025-01-09 16:41:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:37,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:37,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:41:38,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:41:38,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 360 transitions, 2523 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:38,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:38,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:41:38,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:40,979 INFO L124 PetriNetUnfolderBase]: 10316/17287 cut-off events. [2025-01-09 16:41:40,980 INFO L125 PetriNetUnfolderBase]: For 55451/55726 co-relation queries the response was YES. [2025-01-09 16:41:41,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64833 conditions, 17287 events. 10316/17287 cut-off events. For 55451/55726 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 130852 event pairs, 2001 based on Foata normal form. 255/17358 useless extension candidates. Maximal degree in co-relation 64541. Up to 10169 conditions per place. [2025-01-09 16:41:41,105 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 578 selfloop transitions, 310 changer transitions 33/941 dead transitions. [2025-01-09 16:41:41,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 941 transitions, 8254 flow [2025-01-09 16:41:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 16:41:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-09 16:41:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 962 transitions. [2025-01-09 16:41:41,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4580952380952381 [2025-01-09 16:41:41,108 INFO L175 Difference]: Start difference. First operand has 182 places, 360 transitions, 2523 flow. Second operand 35 states and 962 transitions. [2025-01-09 16:41:41,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 941 transitions, 8254 flow [2025-01-09 16:41:41,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 941 transitions, 7982 flow, removed 132 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:41,851 INFO L231 Difference]: Finished difference. Result has 239 places, 654 transitions, 5771 flow [2025-01-09 16:41:41,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5771, PETRI_PLACES=239, PETRI_TRANSITIONS=654} [2025-01-09 16:41:41,851 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 174 predicate places. [2025-01-09 16:41:41,851 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 654 transitions, 5771 flow [2025-01-09 16:41:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:41,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:41,857 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:41:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:42,052 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:41:42,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1870204017, now seen corresponding path program 6 times [2025-01-09 16:41:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:42,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275658911] [2025-01-09 16:41:42,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:41:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:42,064 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:41:42,082 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:41:42,082 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:41:42,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275658911] [2025-01-09 16:41:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275658911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:42,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643241210] [2025-01-09 16:41:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:42,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:42,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:42,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:42,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:41:42,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:41:42,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 654 transitions, 5771 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:42,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:42,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:41:42,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:47,022 INFO L124 PetriNetUnfolderBase]: 13413/22472 cut-off events. [2025-01-09 16:41:47,022 INFO L125 PetriNetUnfolderBase]: For 136181/136558 co-relation queries the response was YES. [2025-01-09 16:41:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100588 conditions, 22472 events. 13413/22472 cut-off events. For 136181/136558 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 176401 event pairs, 2621 based on Foata normal form. 357/22641 useless extension candidates. Maximal degree in co-relation 99288. Up to 14280 conditions per place. [2025-01-09 16:41:47,223 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 837 selfloop transitions, 317 changer transitions 37/1211 dead transitions. [2025-01-09 16:41:47,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1211 transitions, 13052 flow [2025-01-09 16:41:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 16:41:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 16:41:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 1216 transitions. [2025-01-09 16:41:47,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45037037037037037 [2025-01-09 16:41:47,227 INFO L175 Difference]: Start difference. First operand has 239 places, 654 transitions, 5771 flow. Second operand 45 states and 1216 transitions. [2025-01-09 16:41:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1211 transitions, 13052 flow [2025-01-09 16:41:49,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1211 transitions, 12465 flow, removed 281 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:49,206 INFO L231 Difference]: Finished difference. Result has 315 places, 858 transitions, 8607 flow [2025-01-09 16:41:49,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5238, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=8607, PETRI_PLACES=315, PETRI_TRANSITIONS=858} [2025-01-09 16:41:49,206 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 250 predicate places. [2025-01-09 16:41:49,206 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 858 transitions, 8607 flow [2025-01-09 16:41:49,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:41:49,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:49,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:49,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:41:49,207 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:41:49,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1773979485, now seen corresponding path program 7 times [2025-01-09 16:41:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:49,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788902976] [2025-01-09 16:41:49,208 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:41:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:41:49,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:49,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:49,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788902976] [2025-01-09 16:41:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788902976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264785316] [2025-01-09 16:41:49,475 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:41:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:49,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:49,477 INFO L229 MonitoredProcess]: Starting monitored process 4 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:41:49,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:41:49,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 16:41:49,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:41:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:49,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:49,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 16:41:49,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:49,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:41:49,759 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-01-09 16:41:49,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2025-01-09 16:41:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:49,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:41:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-01-09 16:41:50,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:41:50,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-01-09 16:41:50,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2025-01-09 16:41:50,754 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 16:41:50,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 1 [2025-01-09 16:41:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:41:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264785316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:41:50,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:41:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-01-09 16:41:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693248722] [2025-01-09 16:41:50,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:41:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:41:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:50,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:41:50,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:41:51,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-09 16:41:51,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 858 transitions, 8607 flow. Second operand has 26 states, 26 states have (on average 24.53846153846154) internal successors, (638), 26 states have internal predecessors, (638), 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:41:51,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:51,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-09 16:41:51,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:57,201 INFO L124 PetriNetUnfolderBase]: 15412/26389 cut-off events. [2025-01-09 16:41:57,201 INFO L125 PetriNetUnfolderBase]: For 248130/248602 co-relation queries the response was YES. [2025-01-09 16:41:57,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128812 conditions, 26389 events. 15412/26389 cut-off events. For 248130/248602 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 223138 event pairs, 1943 based on Foata normal form. 395/26486 useless extension candidates. Maximal degree in co-relation 128547. Up to 7979 conditions per place. [2025-01-09 16:41:57,458 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 437 selfloop transitions, 96 changer transitions 961/1528 dead transitions. [2025-01-09 16:41:57,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1528 transitions, 17714 flow [2025-01-09 16:41:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 16:41:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-01-09 16:41:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1104 transitions. [2025-01-09 16:41:57,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-01-09 16:41:57,459 INFO L175 Difference]: Start difference. First operand has 315 places, 858 transitions, 8607 flow. Second operand 36 states and 1104 transitions. [2025-01-09 16:41:57,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1528 transitions, 17714 flow [2025-01-09 16:42:00,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1528 transitions, 16122 flow, removed 736 selfloop flow, removed 5 redundant places. [2025-01-09 16:42:00,773 INFO L231 Difference]: Finished difference. Result has 364 places, 493 transitions, 4501 flow [2025-01-09 16:42:00,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7451, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4501, PETRI_PLACES=364, PETRI_TRANSITIONS=493} [2025-01-09 16:42:00,774 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 299 predicate places. [2025-01-09 16:42:00,774 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 493 transitions, 4501 flow [2025-01-09 16:42:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 24.53846153846154) internal successors, (638), 26 states have internal predecessors, (638), 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:42:00,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:00,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:00,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:42:00,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:00,979 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:42:00,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1496424165, now seen corresponding path program 8 times [2025-01-09 16:42:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:00,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729540474] [2025-01-09 16:42:00,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:00,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:00,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:42:00,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:00,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729540474] [2025-01-09 16:42:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729540474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:42:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812383075] [2025-01-09 16:42:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:01,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:42:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:01,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:42:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:42:01,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:01,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 493 transitions, 4501 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:01,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:01,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:01,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:04,802 INFO L124 PetriNetUnfolderBase]: 10646/17874 cut-off events. [2025-01-09 16:42:04,803 INFO L125 PetriNetUnfolderBase]: For 267654/267915 co-relation queries the response was YES. [2025-01-09 16:42:05,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98104 conditions, 17874 events. 10646/17874 cut-off events. For 267654/267915 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 137766 event pairs, 1787 based on Foata normal form. 241/17947 useless extension candidates. Maximal degree in co-relation 97934. Up to 9861 conditions per place. [2025-01-09 16:42:05,214 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 634 selfloop transitions, 313 changer transitions 80/1047 dead transitions. [2025-01-09 16:42:05,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1047 transitions, 12712 flow [2025-01-09 16:42:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 16:42:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-01-09 16:42:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 1295 transitions. [2025-01-09 16:42:05,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4592198581560284 [2025-01-09 16:42:05,216 INFO L175 Difference]: Start difference. First operand has 364 places, 493 transitions, 4501 flow. Second operand 47 states and 1295 transitions. [2025-01-09 16:42:05,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1047 transitions, 12712 flow [2025-01-09 16:42:08,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1047 transitions, 11214 flow, removed 610 selfloop flow, removed 44 redundant places. [2025-01-09 16:42:08,020 INFO L231 Difference]: Finished difference. Result has 375 places, 713 transitions, 7589 flow [2025-01-09 16:42:08,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3728, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=7589, PETRI_PLACES=375, PETRI_TRANSITIONS=713} [2025-01-09 16:42:08,021 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 310 predicate places. [2025-01-09 16:42:08,021 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 713 transitions, 7589 flow [2025-01-09 16:42:08,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:08,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:08,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:42:08,022 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:42:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -956814403, now seen corresponding path program 9 times [2025-01-09 16:42:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051298550] [2025-01-09 16:42:08,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:08,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:08,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:42:08,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:08,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051298550] [2025-01-09 16:42:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051298550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:08,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:42:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133529995] [2025-01-09 16:42:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:08,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:08,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:08,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:08,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:08,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 713 transitions, 7589 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:08,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:08,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:12,817 INFO L124 PetriNetUnfolderBase]: 10703/17904 cut-off events. [2025-01-09 16:42:12,817 INFO L125 PetriNetUnfolderBase]: For 412168/412425 co-relation queries the response was YES. [2025-01-09 16:42:12,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109290 conditions, 17904 events. 10703/17904 cut-off events. For 412168/412425 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 136604 event pairs, 2200 based on Foata normal form. 240/17974 useless extension candidates. Maximal degree in co-relation 108988. Up to 12382 conditions per place. [2025-01-09 16:42:13,038 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 661 selfloop transitions, 288 changer transitions 67/1036 dead transitions. [2025-01-09 16:42:13,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1036 transitions, 13449 flow [2025-01-09 16:42:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 16:42:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-01-09 16:42:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1200 transitions. [2025-01-09 16:42:13,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-01-09 16:42:13,040 INFO L175 Difference]: Start difference. First operand has 375 places, 713 transitions, 7589 flow. Second operand 46 states and 1200 transitions. [2025-01-09 16:42:13,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1036 transitions, 13449 flow [2025-01-09 16:42:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1036 transitions, 11496 flow, removed 924 selfloop flow, removed 11 redundant places. [2025-01-09 16:42:17,350 INFO L231 Difference]: Finished difference. Result has 420 places, 812 transitions, 8440 flow [2025-01-09 16:42:17,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=6502, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=8440, PETRI_PLACES=420, PETRI_TRANSITIONS=812} [2025-01-09 16:42:17,352 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 355 predicate places. [2025-01-09 16:42:17,352 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 812 transitions, 8440 flow [2025-01-09 16:42:17,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:17,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:17,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:17,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:42:17,353 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:42:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -384146969, now seen corresponding path program 10 times [2025-01-09 16:42:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752526944] [2025-01-09 16:42:17,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:17,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:17,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-01-09 16:42:17,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:42:17,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752526944] [2025-01-09 16:42:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752526944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:17,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:17,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:42:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964351866] [2025-01-09 16:42:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:17,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:17,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:17,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:17,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:17,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 812 transitions, 8440 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:17,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:17,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:17,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:22,210 INFO L124 PetriNetUnfolderBase]: 10469/17522 cut-off events. [2025-01-09 16:42:22,211 INFO L125 PetriNetUnfolderBase]: For 375149/375406 co-relation queries the response was YES. [2025-01-09 16:42:22,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104914 conditions, 17522 events. 10469/17522 cut-off events. For 375149/375406 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 133144 event pairs, 2102 based on Foata normal form. 240/17588 useless extension candidates. Maximal degree in co-relation 104046. Up to 12472 conditions per place. [2025-01-09 16:42:22,505 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 645 selfloop transitions, 251 changer transitions 69/985 dead transitions. [2025-01-09 16:42:22,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 985 transitions, 11899 flow [2025-01-09 16:42:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 16:42:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-01-09 16:42:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1031 transitions. [2025-01-09 16:42:22,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4405982905982906 [2025-01-09 16:42:22,507 INFO L175 Difference]: Start difference. First operand has 420 places, 812 transitions, 8440 flow. Second operand 39 states and 1031 transitions. [2025-01-09 16:42:22,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 985 transitions, 11899 flow [2025-01-09 16:42:25,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 985 transitions, 11214 flow, removed 260 selfloop flow, removed 14 redundant places. [2025-01-09 16:42:25,984 INFO L231 Difference]: Finished difference. Result has 442 places, 781 transitions, 8075 flow [2025-01-09 16:42:25,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7829, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=8075, PETRI_PLACES=442, PETRI_TRANSITIONS=781} [2025-01-09 16:42:25,985 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 377 predicate places. [2025-01-09 16:42:25,985 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 781 transitions, 8075 flow [2025-01-09 16:42:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:25,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:25,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:25,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:42:25,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1074458645, now seen corresponding path program 11 times [2025-01-09 16:42:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:25,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806728425] [2025-01-09 16:42:25,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:25,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:25,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:42:25,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:25,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806728425] [2025-01-09 16:42:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806728425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265207284] [2025-01-09 16:42:26,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:26,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:26,415 INFO L229 MonitoredProcess]: Starting monitored process 5 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:42:26,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:42:26,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:26,479 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 16:42:26,479 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:26,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:26,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 16:42:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:26,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:42:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:26,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:27,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-01-09 16:42:27,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:42:27,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-01-09 16:42:27,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2025-01-09 16:42:27,819 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 16:42:27,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 1 [2025-01-09 16:42:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265207284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:27,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2025-01-09 16:42:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365754496] [2025-01-09 16:42:27,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 16:42:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 16:42:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 16:42:28,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-01-09 16:42:28,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 781 transitions, 8075 flow. Second operand has 37 states, 37 states have (on average 20.7027027027027) internal successors, (766), 37 states have internal predecessors, (766), 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:42:28,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:28,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-01-09 16:42:28,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:32,082 INFO L124 PetriNetUnfolderBase]: 10370/17497 cut-off events. [2025-01-09 16:42:32,083 INFO L125 PetriNetUnfolderBase]: For 338977/339192 co-relation queries the response was YES. [2025-01-09 16:42:32,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101302 conditions, 17497 events. 10370/17497 cut-off events. For 338977/339192 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 135667 event pairs, 1900 based on Foata normal form. 73/17331 useless extension candidates. Maximal degree in co-relation 100375. Up to 11741 conditions per place. [2025-01-09 16:42:32,293 INFO L140 encePairwiseOnDemand]: 37/60 looper letters, 640 selfloop transitions, 128 changer transitions 124/947 dead transitions. [2025-01-09 16:42:32,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 947 transitions, 10897 flow [2025-01-09 16:42:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:42:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:42:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 790 transitions. [2025-01-09 16:42:32,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2025-01-09 16:42:32,294 INFO L175 Difference]: Start difference. First operand has 442 places, 781 transitions, 8075 flow. Second operand 31 states and 790 transitions. [2025-01-09 16:42:32,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 947 transitions, 10897 flow [2025-01-09 16:42:34,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 947 transitions, 10188 flow, removed 68 selfloop flow, removed 40 redundant places. [2025-01-09 16:42:34,926 INFO L231 Difference]: Finished difference. Result has 428 places, 743 transitions, 7232 flow [2025-01-09 16:42:34,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7408, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7232, PETRI_PLACES=428, PETRI_TRANSITIONS=743} [2025-01-09 16:42:34,927 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 363 predicate places. [2025-01-09 16:42:34,927 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 743 transitions, 7232 flow [2025-01-09 16:42:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 20.7027027027027) internal successors, (766), 37 states have internal predecessors, (766), 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:42:34,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:34,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:34,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:42:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 16:42:35,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -835332243, now seen corresponding path program 12 times [2025-01-09 16:42:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537055359] [2025-01-09 16:42:35,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:35,135 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-01-09 16:42:35,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-01-09 16:42:35,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:42:35,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537055359] [2025-01-09 16:42:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537055359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718269576] [2025-01-09 16:42:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:35,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:35,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:35,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:35,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-09 16:42:35,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 743 transitions, 7232 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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:42:35,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:35,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-09 16:42:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:36,463 INFO L124 PetriNetUnfolderBase]: 3796/7382 cut-off events. [2025-01-09 16:42:36,463 INFO L125 PetriNetUnfolderBase]: For 160454/160781 co-relation queries the response was YES. [2025-01-09 16:42:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40703 conditions, 7382 events. 3796/7382 cut-off events. For 160454/160781 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 56440 event pairs, 876 based on Foata normal form. 192/7414 useless extension candidates. Maximal degree in co-relation 40568. Up to 2383 conditions per place. [2025-01-09 16:42:36,546 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 208 selfloop transitions, 9 changer transitions 66/438 dead transitions. [2025-01-09 16:42:36,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 438 transitions, 4562 flow [2025-01-09 16:42:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-01-09 16:42:36,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6366666666666667 [2025-01-09 16:42:36,547 INFO L175 Difference]: Start difference. First operand has 428 places, 743 transitions, 7232 flow. Second operand 5 states and 191 transitions. [2025-01-09 16:42:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 438 transitions, 4562 flow [2025-01-09 16:42:37,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 438 transitions, 3870 flow, removed 239 selfloop flow, removed 69 redundant places. [2025-01-09 16:42:37,065 INFO L231 Difference]: Finished difference. Result has 283 places, 286 transitions, 2118 flow [2025-01-09 16:42:37,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2118, PETRI_PLACES=283, PETRI_TRANSITIONS=286} [2025-01-09 16:42:37,065 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 218 predicate places. [2025-01-09 16:42:37,066 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 286 transitions, 2118 flow [2025-01-09 16:42:37,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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:42:37,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:37,066 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:42:37,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:37,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -573965308, now seen corresponding path program 13 times [2025-01-09 16:42:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106563023] [2025-01-09 16:42:37,067 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:37,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:37,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 16:42:37,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:37,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:37,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106563023] [2025-01-09 16:42:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106563023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710347186] [2025-01-09 16:42:38,730 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:38,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:38,732 INFO L229 MonitoredProcess]: Starting monitored process 6 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:42:38,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:42:38,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 16:42:38,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:38,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:38,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:42:38,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:39,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:42:39,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 16:42:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:39,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:39,207 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-01-09 16:42:39,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-01-09 16:42:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:39,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710347186] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:39,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:39,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 13] total 30 [2025-01-09 16:42:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485399647] [2025-01-09 16:42:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:39,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:39,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:42:39,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:39,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 286 transitions, 2118 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:39,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:39,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:39,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:40,777 INFO L124 PetriNetUnfolderBase]: 4418/7411 cut-off events. [2025-01-09 16:42:40,778 INFO L125 PetriNetUnfolderBase]: For 49174/49539 co-relation queries the response was YES. [2025-01-09 16:42:40,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34128 conditions, 7411 events. 4418/7411 cut-off events. For 49174/49539 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 48094 event pairs, 1290 based on Foata normal form. 305/7561 useless extension candidates. Maximal degree in co-relation 34042. Up to 6022 conditions per place. [2025-01-09 16:42:40,857 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 238 selfloop transitions, 53 changer transitions 57/370 dead transitions. [2025-01-09 16:42:40,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 370 transitions, 3516 flow [2025-01-09 16:42:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:42:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:42:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 487 transitions. [2025-01-09 16:42:40,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45092592592592595 [2025-01-09 16:42:40,859 INFO L175 Difference]: Start difference. First operand has 283 places, 286 transitions, 2118 flow. Second operand 18 states and 487 transitions. [2025-01-09 16:42:40,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 370 transitions, 3516 flow [2025-01-09 16:42:41,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 370 transitions, 3388 flow, removed 48 selfloop flow, removed 12 redundant places. [2025-01-09 16:42:41,119 INFO L231 Difference]: Finished difference. Result has 273 places, 280 transitions, 2145 flow [2025-01-09 16:42:41,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2145, PETRI_PLACES=273, PETRI_TRANSITIONS=280} [2025-01-09 16:42:41,120 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 208 predicate places. [2025-01-09 16:42:41,120 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 280 transitions, 2145 flow [2025-01-09 16:42:41,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:41,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:41,121 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:41,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:42:41,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:42:41,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:41,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -733883766, now seen corresponding path program 14 times [2025-01-09 16:42:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755157221] [2025-01-09 16:42:41,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:41,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:41,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 57 statements. [2025-01-09 16:42:41,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:41,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:41,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755157221] [2025-01-09 16:42:41,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755157221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:41,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:41,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:42:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672725438] [2025-01-09 16:42:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:41,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:42:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:41,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:42:41,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:42:41,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:41,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 280 transitions, 2145 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:41,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:41,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:42,955 INFO L124 PetriNetUnfolderBase]: 4608/7773 cut-off events. [2025-01-09 16:42:42,955 INFO L125 PetriNetUnfolderBase]: For 54604/54953 co-relation queries the response was YES. [2025-01-09 16:42:43,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36378 conditions, 7773 events. 4608/7773 cut-off events. For 54604/54953 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 51280 event pairs, 1278 based on Foata normal form. 329/7945 useless extension candidates. Maximal degree in co-relation 36291. Up to 5359 conditions per place. [2025-01-09 16:42:43,027 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 271 selfloop transitions, 81 changer transitions 69/443 dead transitions. [2025-01-09 16:42:43,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 443 transitions, 4186 flow [2025-01-09 16:42:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 16:42:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-09 16:42:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 860 transitions. [2025-01-09 16:42:43,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-01-09 16:42:43,029 INFO L175 Difference]: Start difference. First operand has 273 places, 280 transitions, 2145 flow. Second operand 33 states and 860 transitions. [2025-01-09 16:42:43,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 443 transitions, 4186 flow [2025-01-09 16:42:43,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 443 transitions, 3900 flow, removed 82 selfloop flow, removed 20 redundant places. [2025-01-09 16:42:43,245 INFO L231 Difference]: Finished difference. Result has 289 places, 293 transitions, 2410 flow [2025-01-09 16:42:43,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2410, PETRI_PLACES=289, PETRI_TRANSITIONS=293} [2025-01-09 16:42:43,245 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 224 predicate places. [2025-01-09 16:42:43,245 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 293 transitions, 2410 flow [2025-01-09 16:42:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:43,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:43,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:42:43,246 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:43,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1483612976, now seen corresponding path program 15 times [2025-01-09 16:42:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98578957] [2025-01-09 16:42:43,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:43,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:43,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 57 statements. [2025-01-09 16:42:43,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98578957] [2025-01-09 16:42:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98578957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:42:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608138196] [2025-01-09 16:42:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:42:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:43,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:42:43,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:42:43,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:43,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 293 transitions, 2410 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:43,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:43,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:44,695 INFO L124 PetriNetUnfolderBase]: 4399/7387 cut-off events. [2025-01-09 16:42:44,695 INFO L125 PetriNetUnfolderBase]: For 54315/54617 co-relation queries the response was YES. [2025-01-09 16:42:44,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35193 conditions, 7387 events. 4399/7387 cut-off events. For 54315/54617 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 48068 event pairs, 1236 based on Foata normal form. 282/7513 useless extension candidates. Maximal degree in co-relation 35102. Up to 5538 conditions per place. [2025-01-09 16:42:44,768 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 248 selfloop transitions, 73 changer transitions 62/405 dead transitions. [2025-01-09 16:42:44,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 405 transitions, 3893 flow [2025-01-09 16:42:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:42:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:42:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 795 transitions. [2025-01-09 16:42:44,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2025-01-09 16:42:44,769 INFO L175 Difference]: Start difference. First operand has 289 places, 293 transitions, 2410 flow. Second operand 31 states and 795 transitions. [2025-01-09 16:42:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 405 transitions, 3893 flow [2025-01-09 16:42:44,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 405 transitions, 3651 flow, removed 85 selfloop flow, removed 20 redundant places. [2025-01-09 16:42:44,966 INFO L231 Difference]: Finished difference. Result has 293 places, 282 transitions, 2330 flow [2025-01-09 16:42:44,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2330, PETRI_PLACES=293, PETRI_TRANSITIONS=282} [2025-01-09 16:42:44,966 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 228 predicate places. [2025-01-09 16:42:44,966 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 282 transitions, 2330 flow [2025-01-09 16:42:44,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:44,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:44,966 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:42:44,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:44,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1223153170, now seen corresponding path program 16 times [2025-01-09 16:42:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580342524] [2025-01-09 16:42:44,967 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:44,973 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:44,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 57 statements. [2025-01-09 16:42:44,977 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:42:44,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:45,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:45,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580342524] [2025-01-09 16:42:45,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580342524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:45,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:42:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139320415] [2025-01-09 16:42:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:42:45,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:45,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:42:45,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:42:45,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:45,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 282 transitions, 2330 flow. Second operand has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:45,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:45,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:45,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:46,315 INFO L124 PetriNetUnfolderBase]: 4315/7234 cut-off events. [2025-01-09 16:42:46,315 INFO L125 PetriNetUnfolderBase]: For 52670/52989 co-relation queries the response was YES. [2025-01-09 16:42:46,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34772 conditions, 7234 events. 4315/7234 cut-off events. For 52670/52989 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 46958 event pairs, 1150 based on Foata normal form. 299/7389 useless extension candidates. Maximal degree in co-relation 34685. Up to 5396 conditions per place. [2025-01-09 16:42:46,375 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 259 selfloop transitions, 78 changer transitions 36/395 dead transitions. [2025-01-09 16:42:46,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 395 transitions, 3899 flow [2025-01-09 16:42:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:42:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:42:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 735 transitions. [2025-01-09 16:42:46,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-01-09 16:42:46,376 INFO L175 Difference]: Start difference. First operand has 293 places, 282 transitions, 2330 flow. Second operand 28 states and 735 transitions. [2025-01-09 16:42:46,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 395 transitions, 3899 flow [2025-01-09 16:42:46,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 395 transitions, 3668 flow, removed 28 selfloop flow, removed 30 redundant places. [2025-01-09 16:42:46,587 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 2354 flow [2025-01-09 16:42:46,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2137, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2354, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2025-01-09 16:42:46,587 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 217 predicate places. [2025-01-09 16:42:46,587 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 2354 flow [2025-01-09 16:42:46,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.636363636363637) internal successors, (249), 11 states have internal predecessors, (249), 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:42:46,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:46,587 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:42:46,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:46,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1916090826, now seen corresponding path program 17 times [2025-01-09 16:42:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:46,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734576551] [2025-01-09 16:42:46,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:46,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:46,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:46,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:46,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734576551] [2025-01-09 16:42:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734576551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909844313] [2025-01-09 16:42:47,657 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:47,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:47,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:47,669 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:47,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:42:47,737 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:47,757 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:47,757 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:47,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:47,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:42:47,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:48,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:42:48,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 16:42:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:48,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:48,159 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-01-09 16:42:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-01-09 16:42:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909844313] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:48,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 13] total 29 [2025-01-09 16:42:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974864491] [2025-01-09 16:42:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:48,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:48,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2025-01-09 16:42:48,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:48,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 2354 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:48,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:48,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:49,471 INFO L124 PetriNetUnfolderBase]: 4178/7016 cut-off events. [2025-01-09 16:42:49,471 INFO L125 PetriNetUnfolderBase]: For 50643/50952 co-relation queries the response was YES. [2025-01-09 16:42:49,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33770 conditions, 7016 events. 4178/7016 cut-off events. For 50643/50952 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 45136 event pairs, 1183 based on Foata normal form. 289/7156 useless extension candidates. Maximal degree in co-relation 33687. Up to 5786 conditions per place. [2025-01-09 16:42:49,537 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 249 selfloop transitions, 59 changer transitions 23/353 dead transitions. [2025-01-09 16:42:49,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 353 transitions, 3490 flow [2025-01-09 16:42:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:42:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:42:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 507 transitions. [2025-01-09 16:42:49,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44473684210526315 [2025-01-09 16:42:49,538 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 2354 flow. Second operand 19 states and 507 transitions. [2025-01-09 16:42:49,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 353 transitions, 3490 flow [2025-01-09 16:42:49,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 353 transitions, 3302 flow, removed 36 selfloop flow, removed 21 redundant places. [2025-01-09 16:42:49,735 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 2298 flow [2025-01-09 16:42:49,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2298, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2025-01-09 16:42:49,736 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 209 predicate places. [2025-01-09 16:42:49,736 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 2298 flow [2025-01-09 16:42:49,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:49,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:49,736 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:49,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:42:49,937 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1275536528, now seen corresponding path program 18 times [2025-01-09 16:42:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440273573] [2025-01-09 16:42:49,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:49,943 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 2 equivalence classes. [2025-01-09 16:42:49,950 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 57 statements. [2025-01-09 16:42:49,950 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:42:49,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440273573] [2025-01-09 16:42:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440273573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:50,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:50,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:42:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933789949] [2025-01-09 16:42:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:50,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:50,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:50,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:50,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:50,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 2298 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:50,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:50,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:50,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:51,138 INFO L124 PetriNetUnfolderBase]: 4096/6862 cut-off events. [2025-01-09 16:42:51,139 INFO L125 PetriNetUnfolderBase]: For 45337/45623 co-relation queries the response was YES. [2025-01-09 16:42:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32628 conditions, 6862 events. 4096/6862 cut-off events. For 45337/45623 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 43997 event pairs, 1189 based on Foata normal form. 266/6977 useless extension candidates. Maximal degree in co-relation 32545. Up to 5786 conditions per place. [2025-01-09 16:42:51,205 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 223 selfloop transitions, 51 changer transitions 39/335 dead transitions. [2025-01-09 16:42:51,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 335 transitions, 3303 flow [2025-01-09 16:42:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:42:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 16:42:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 434 transitions. [2025-01-09 16:42:51,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45208333333333334 [2025-01-09 16:42:51,206 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 2298 flow. Second operand 16 states and 434 transitions. [2025-01-09 16:42:51,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 335 transitions, 3303 flow [2025-01-09 16:42:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 335 transitions, 3154 flow, removed 15 selfloop flow, removed 17 redundant places. [2025-01-09 16:42:51,383 INFO L231 Difference]: Finished difference. Result has 269 places, 270 transitions, 2230 flow [2025-01-09 16:42:51,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2230, PETRI_PLACES=269, PETRI_TRANSITIONS=270} [2025-01-09 16:42:51,383 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 204 predicate places. [2025-01-09 16:42:51,383 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 2230 flow [2025-01-09 16:42:51,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:51,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:51,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:42:51,384 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:42:51,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1870036534, now seen corresponding path program 19 times [2025-01-09 16:42:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194202880] [2025-01-09 16:42:51,384 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:51,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 16:42:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194202880] [2025-01-09 16:42:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194202880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392701236] [2025-01-09 16:42:52,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:52,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:52,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:52,367 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:42:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 16:42:52,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:42:52,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:52,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:42:52,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:52,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:42:52,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 16:42:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:52,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:52,888 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-01-09 16:42:52,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-01-09 16:42:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:52,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392701236] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:52,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:42:52,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 13] total 33 [2025-01-09 16:42:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597997092] [2025-01-09 16:42:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:52,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:52,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:42:52,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 60 [2025-01-09 16:42:52,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 270 transitions, 2230 flow. Second operand has 12 states, 12 states have (on average 22.333333333333332) internal successors, (268), 12 states have internal predecessors, (268), 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:42:52,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:52,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 60 [2025-01-09 16:42:52,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand