./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:27:44,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:27:44,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:27:44,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:27:44,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:27:44,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:27:44,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:27:44,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:27:44,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:27:44,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:27:44,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:27:44,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:27:44,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:27:44,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:27:44,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:27:44,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:27:44,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:27:44,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:27:44,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:27:44,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:27:44,265 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/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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-03-08 17:27:44,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:27:44,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:27:44,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:27:44,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:27:44,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:27:44,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-08 17:27:45,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f5c6cc1/e5ed92e07f034c61ad4c6d10f6a71a36/FLAG3df166527 [2025-03-08 17:27:45,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:27:45,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-08 17:27:45,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f5c6cc1/e5ed92e07f034c61ad4c6d10f6a71a36/FLAG3df166527 [2025-03-08 17:27:46,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f5c6cc1/e5ed92e07f034c61ad4c6d10f6a71a36 [2025-03-08 17:27:46,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:27:46,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:27:46,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:27:46,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:27:46,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:27:46,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5878a58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46, skipping insertion in model container [2025-03-08 17:27:46,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:27:46,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-08 17:27:46,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:27:46,386 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:27:46,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-08 17:27:46,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:27:46,415 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:27:46,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46 WrapperNode [2025-03-08 17:27:46,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:27:46,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:27:46,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:27:46,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:27:46,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,442 INFO L138 Inliner]: procedures = 24, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-03-08 17:27:46,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:27:46,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:27:46,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:27:46,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:27:46,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,459 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 17:27:46,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:27:46,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:27:46,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:27:46,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:27:46,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (1/1) ... [2025-03-08 17:27:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:27:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:27:46,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:27:46,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:27:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-08 17:27:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:27:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:27:46,516 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:27:46,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:27:46,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:27:46,803 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:27:46,803 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:27:46,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:27:46,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:27:46,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:46 BoogieIcfgContainer [2025-03-08 17:27:46,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:27:46,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:27:46,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:27:46,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:27:46,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:27:46" (1/3) ... [2025-03-08 17:27:46,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bae987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:46, skipping insertion in model container [2025-03-08 17:27:46,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:27:46" (2/3) ... [2025-03-08 17:27:46,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bae987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:27:46, skipping insertion in model container [2025-03-08 17:27:46,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:27:46" (3/3) ... [2025-03-08 17:27:46,921 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-03-08 17:27:46,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:27:46,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 41 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:27:46,934 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:27:46,991 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-08 17:27:47,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 134 flow [2025-03-08 17:27:47,044 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-08 17:27:47,046 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:27:47,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 25 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-08 17:27:47,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 134 flow [2025-03-08 17:27:47,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 114 flow [2025-03-08 17:27:47,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:27:47,068 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;@222fe4d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:27:47,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 17:27:47,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:27:47,084 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-08 17:27:47,084 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:27:47,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:47,085 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] [2025-03-08 17:27:47,087 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 4 more)] === [2025-03-08 17:27:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1357419795, now seen corresponding path program 1 times [2025-03-08 17:27:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811530819] [2025-03-08 17:27:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:47,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:47,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:27:47,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:27:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:27:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811530819] [2025-03-08 17:27:47,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811530819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:47,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:47,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:27:47,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180433961] [2025-03-08 17:27:47,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:47,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:27:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:47,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:27:47,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:27:47,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:47,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-08 17:27:47,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:47,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:47,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:49,055 INFO L124 PetriNetUnfolderBase]: 21791/25329 cut-off events. [2025-03-08 17:27:49,057 INFO L125 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2025-03-08 17:27:49,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51798 conditions, 25329 events. 21791/25329 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 88393 event pairs, 3998 based on Foata normal form. 1/13868 useless extension candidates. Maximal degree in co-relation 44804. Up to 16365 conditions per place. [2025-03-08 17:27:49,190 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 49 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2025-03-08 17:27:49,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 283 flow [2025-03-08 17:27:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:27:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:27:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-08 17:27:49,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2025-03-08 17:27:49,203 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 114 flow. Second operand 3 states and 93 transitions. [2025-03-08 17:27:49,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 283 flow [2025-03-08 17:27:49,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-08 17:27:49,240 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2025-03-08 17:27:49,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-08 17:27:49,245 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2025-03-08 17:27:49,247 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2025-03-08 17:27:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-03-08 17:27:49,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:49,247 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] [2025-03-08 17:27:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:27:49,247 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 4 more)] === [2025-03-08 17:27:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1492973893, now seen corresponding path program 1 times [2025-03-08 17:27:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235227737] [2025-03-08 17:27:49,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:49,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:27:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:27:49,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:27:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235227737] [2025-03-08 17:27:49,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235227737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:49,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:49,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:27:49,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854729576] [2025-03-08 17:27:49,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:49,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:27:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:49,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:27:49,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:27:49,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:49,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-08 17:27:49,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:49,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:49,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:50,838 INFO L124 PetriNetUnfolderBase]: 27517/32094 cut-off events. [2025-03-08 17:27:50,838 INFO L125 PetriNetUnfolderBase]: For 4232/4232 co-relation queries the response was YES. [2025-03-08 17:27:50,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70072 conditions, 32094 events. 27517/32094 cut-off events. For 4232/4232 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 118238 event pairs, 4313 based on Foata normal form. 1/21678 useless extension candidates. Maximal degree in co-relation 22975. Up to 23265 conditions per place. [2025-03-08 17:27:50,945 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 55 selfloop transitions, 3 changer transitions 3/68 dead transitions. [2025-03-08 17:27:50,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 304 flow [2025-03-08 17:27:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:27:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:27:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-08 17:27:50,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2025-03-08 17:27:50,946 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 3 states and 97 transitions. [2025-03-08 17:27:50,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 304 flow [2025-03-08 17:27:50,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:50,951 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 125 flow [2025-03-08 17:27:50,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-08 17:27:50,952 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-08 17:27:50,952 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 125 flow [2025-03-08 17:27:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-08 17:27:50,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:50,952 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] [2025-03-08 17:27:50,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:27:50,952 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 4 more)] === [2025-03-08 17:27:50,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash -435221560, now seen corresponding path program 1 times [2025-03-08 17:27:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:50,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991622842] [2025-03-08 17:27:50,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:50,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 17:27:50,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:27:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991622842] [2025-03-08 17:27:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991622842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:51,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:51,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:27:51,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099416604] [2025-03-08 17:27:51,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:51,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:27:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:27:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:27:51,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:51,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03-08 17:27:51,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:51,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:51,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:52,561 INFO L124 PetriNetUnfolderBase]: 36425/42807 cut-off events. [2025-03-08 17:27:52,561 INFO L125 PetriNetUnfolderBase]: For 12618/12618 co-relation queries the response was YES. [2025-03-08 17:27:52,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101044 conditions, 42807 events. 36425/42807 cut-off events. For 12618/12618 co-relation queries the response was YES. Maximal size of possible extension queue 1538. Compared 170397 event pairs, 6150 based on Foata normal form. 1/36346 useless extension candidates. Maximal degree in co-relation 33662. Up to 30370 conditions per place. [2025-03-08 17:27:52,748 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 61 selfloop transitions, 3 changer transitions 5/76 dead transitions. [2025-03-08 17:27:52,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 358 flow [2025-03-08 17:27:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:27:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:27:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-08 17:27:52,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2025-03-08 17:27:52,750 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 125 flow. Second operand 3 states and 101 transitions. [2025-03-08 17:27:52,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 358 flow [2025-03-08 17:27:52,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:52,752 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 141 flow [2025-03-08 17:27:52,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-08 17:27:52,753 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-03-08 17:27:52,753 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 141 flow [2025-03-08 17:27:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-03-08 17:27:52,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:52,753 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] [2025-03-08 17:27:52,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:27:52,754 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 4 more)] === [2025-03-08 17:27:52,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1773377327, now seen corresponding path program 1 times [2025-03-08 17:27:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541959822] [2025-03-08 17:27:52,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:52,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:52,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:52,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:52,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541959822] [2025-03-08 17:27:52,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541959822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:27:52,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:27:52,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:27:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870050887] [2025-03-08 17:27:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:27:52,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:27:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:52,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:27:52,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:27:52,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:52,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 17:27:52,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:52,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:54,598 INFO L124 PetriNetUnfolderBase]: 36055/42325 cut-off events. [2025-03-08 17:27:54,598 INFO L125 PetriNetUnfolderBase]: For 16711/16711 co-relation queries the response was YES. [2025-03-08 17:27:54,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105198 conditions, 42325 events. 36055/42325 cut-off events. For 16711/16711 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 166040 event pairs, 982 based on Foata normal form. 562/42777 useless extension candidates. Maximal degree in co-relation 35269. Up to 17325 conditions per place. [2025-03-08 17:27:54,726 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 102 selfloop transitions, 6 changer transitions 11/126 dead transitions. [2025-03-08 17:27:54,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 126 transitions, 615 flow [2025-03-08 17:27:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:27:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:27:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2025-03-08 17:27:54,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347826086956522 [2025-03-08 17:27:54,728 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 141 flow. Second operand 5 states and 169 transitions. [2025-03-08 17:27:54,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 126 transitions, 615 flow [2025-03-08 17:27:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 126 transitions, 611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:54,731 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 162 flow [2025-03-08 17:27:54,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-08 17:27:54,731 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-08 17:27:54,731 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 162 flow [2025-03-08 17:27:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 17:27:54,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:54,732 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] [2025-03-08 17:27:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:27:54,732 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 4 more)] === [2025-03-08 17:27:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1248237662, now seen corresponding path program 1 times [2025-03-08 17:27:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543979811] [2025-03-08 17:27:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:54,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:54,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543979811] [2025-03-08 17:27:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543979811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:27:54,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216142229] [2025-03-08 17:27:54,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:27:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:27:54,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:27:54,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:27:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:54,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:27:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:27:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:54,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:27:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216142229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:27:55,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:27:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-08 17:27:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254646112] [2025-03-08 17:27:55,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:27:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:27:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:55,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:27:55,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:27:55,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:55,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-03-08 17:27:55,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:55,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:55,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:56,686 INFO L124 PetriNetUnfolderBase]: 35781/42567 cut-off events. [2025-03-08 17:27:56,686 INFO L125 PetriNetUnfolderBase]: For 25310/25310 co-relation queries the response was YES. [2025-03-08 17:27:56,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114178 conditions, 42567 events. 35781/42567 cut-off events. For 25310/25310 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 178264 event pairs, 4692 based on Foata normal form. 917/43064 useless extension candidates. Maximal degree in co-relation 39089. Up to 20852 conditions per place. [2025-03-08 17:27:56,857 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 108 selfloop transitions, 6 changer transitions 7/128 dead transitions. [2025-03-08 17:27:56,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 128 transitions, 693 flow [2025-03-08 17:27:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:27:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:27:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-03-08 17:27:56,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-03-08 17:27:56,859 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 162 flow. Second operand 5 states and 165 transitions. [2025-03-08 17:27:56,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 128 transitions, 693 flow [2025-03-08 17:27:56,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 128 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:56,862 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 195 flow [2025-03-08 17:27:56,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-08 17:27:56,862 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-08 17:27:56,862 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 195 flow [2025-03-08 17:27:56,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-03-08 17:27:56,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:56,863 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] [2025-03-08 17:27:56,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:27:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:27:57,065 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 4 more)] === [2025-03-08 17:27:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1833353129, now seen corresponding path program 1 times [2025-03-08 17:27:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472261132] [2025-03-08 17:27:57,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:57,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:57,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:57,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:57,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:27:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472261132] [2025-03-08 17:27:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472261132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:27:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582168508] [2025-03-08 17:27:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:57,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:27:57,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:27:57,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:27:57,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:27:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:57,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:57,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:57,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:27:57,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:27:57,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:27:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:57,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:27:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:27:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582168508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:27:57,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:27:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-08 17:27:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090432119] [2025-03-08 17:27:57,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:27:57,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:27:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:27:57,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:27:57,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:27:57,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:27:57,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-03-08 17:27:57,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:27:57,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:27:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:27:59,607 INFO L124 PetriNetUnfolderBase]: 41097/49285 cut-off events. [2025-03-08 17:27:59,607 INFO L125 PetriNetUnfolderBase]: For 50421/50421 co-relation queries the response was YES. [2025-03-08 17:27:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147695 conditions, 49285 events. 41097/49285 cut-off events. For 50421/50421 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 218199 event pairs, 5193 based on Foata normal form. 1141/49514 useless extension candidates. Maximal degree in co-relation 64940. Up to 24945 conditions per place. [2025-03-08 17:27:59,752 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 116 selfloop transitions, 6 changer transitions 14/143 dead transitions. [2025-03-08 17:27:59,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 818 flow [2025-03-08 17:27:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:27:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:27:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-03-08 17:27:59,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2025-03-08 17:27:59,753 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 195 flow. Second operand 5 states and 175 transitions. [2025-03-08 17:27:59,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 818 flow [2025-03-08 17:27:59,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 143 transitions, 801 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-08 17:27:59,765 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 219 flow [2025-03-08 17:27:59,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-08 17:27:59,765 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-08 17:27:59,765 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 219 flow [2025-03-08 17:27:59,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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-03-08 17:27:59,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:27:59,765 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] [2025-03-08 17:27:59,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:27:59,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 17:27:59,970 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 4 more)] === [2025-03-08 17:27:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:27:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 511250302, now seen corresponding path program 1 times [2025-03-08 17:27:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:27:59,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431163567] [2025-03-08 17:27:59,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:27:59,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:27:59,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 17:27:59,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:27:59,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:27:59,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:28:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431163567] [2025-03-08 17:28:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431163567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:28:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134387410] [2025-03-08 17:28:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:28:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:00,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:28:00,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:28:00,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:28:00,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 17:28:00,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:00,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:28:00,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:01,547 INFO L124 PetriNetUnfolderBase]: 28207/33435 cut-off events. [2025-03-08 17:28:01,547 INFO L125 PetriNetUnfolderBase]: For 46032/46038 co-relation queries the response was YES. [2025-03-08 17:28:01,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110998 conditions, 33435 events. 28207/33435 cut-off events. For 46032/46038 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 131590 event pairs, 665 based on Foata normal form. 367/33682 useless extension candidates. Maximal degree in co-relation 56781. Up to 13109 conditions per place. [2025-03-08 17:28:01,711 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 89 selfloop transitions, 4 changer transitions 34/134 dead transitions. [2025-03-08 17:28:01,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 841 flow [2025-03-08 17:28:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:28:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:28:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-03-08 17:28:01,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-08 17:28:01,712 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 219 flow. Second operand 5 states and 161 transitions. [2025-03-08 17:28:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 841 flow [2025-03-08 17:28:01,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 812 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-08 17:28:01,905 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 221 flow [2025-03-08 17:28:01,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-03-08 17:28:01,905 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-03-08 17:28:01,905 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 221 flow [2025-03-08 17:28:01,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 17:28:01,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:01,905 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] [2025-03-08 17:28:01,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:28:01,905 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 4 more)] === [2025-03-08 17:28:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2112762972, now seen corresponding path program 2 times [2025-03-08 17:28:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202258775] [2025-03-08 17:28:01,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:02,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 17:28:02,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:28:02,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:28:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202258775] [2025-03-08 17:28:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202258775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91557176] [2025-03-08 17:28:02,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:02,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:28:02,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:28:02,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 17:28:02,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:28:02,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:02,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:02,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:28:02,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:28:02,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:28:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91557176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:28:02,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:28:02,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-08 17:28:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833191133] [2025-03-08 17:28:02,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:28:02,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:28:02,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:28:02,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:02,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:02,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:28:02,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:03,643 INFO L124 PetriNetUnfolderBase]: 19916/23672 cut-off events. [2025-03-08 17:28:03,643 INFO L125 PetriNetUnfolderBase]: For 41076/41076 co-relation queries the response was YES. [2025-03-08 17:28:03,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83023 conditions, 23672 events. 19916/23672 cut-off events. For 41076/41076 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 89036 event pairs, 257 based on Foata normal form. 1106/24728 useless extension candidates. Maximal degree in co-relation 46094. Up to 6957 conditions per place. [2025-03-08 17:28:03,789 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 290 selfloop transitions, 41 changer transitions 6/344 dead transitions. [2025-03-08 17:28:03,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 344 transitions, 2354 flow [2025-03-08 17:28:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 17:28:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 17:28:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 483 transitions. [2025-03-08 17:28:03,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2025-03-08 17:28:03,791 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 221 flow. Second operand 17 states and 483 transitions. [2025-03-08 17:28:03,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 344 transitions, 2354 flow [2025-03-08 17:28:03,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 344 transitions, 2317 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:28:03,835 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 619 flow [2025-03-08 17:28:03,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=619, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-03-08 17:28:03,836 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2025-03-08 17:28:03,836 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 619 flow [2025-03-08 17:28:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:03,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:03,837 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] [2025-03-08 17:28:03,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:28:04,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:04,037 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 4 more)] === [2025-03-08 17:28:04,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:04,038 INFO L85 PathProgramCache]: Analyzing trace with hash 853990859, now seen corresponding path program 1 times [2025-03-08 17:28:04,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977722711] [2025-03-08 17:28:04,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:04,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 17:28:04,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:28:04,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:04,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977722711] [2025-03-08 17:28:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977722711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:04,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:28:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811233247] [2025-03-08 17:28:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:28:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:04,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:28:04,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:28:04,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:28:04,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-08 17:28:04,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:04,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:28:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:05,294 INFO L124 PetriNetUnfolderBase]: 19713/23589 cut-off events. [2025-03-08 17:28:05,294 INFO L125 PetriNetUnfolderBase]: For 126812/126818 co-relation queries the response was YES. [2025-03-08 17:28:05,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112573 conditions, 23589 events. 19713/23589 cut-off events. For 126812/126818 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 89423 event pairs, 998 based on Foata normal form. 204/23516 useless extension candidates. Maximal degree in co-relation 100071. Up to 9384 conditions per place. [2025-03-08 17:28:05,449 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 127 selfloop transitions, 10 changer transitions 54/198 dead transitions. [2025-03-08 17:28:05,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 198 transitions, 1761 flow [2025-03-08 17:28:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:28:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:28:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-08 17:28:05,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2025-03-08 17:28:05,450 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 619 flow. Second operand 5 states and 153 transitions. [2025-03-08 17:28:05,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 198 transitions, 1761 flow [2025-03-08 17:28:05,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 198 transitions, 1675 flow, removed 28 selfloop flow, removed 2 redundant places. [2025-03-08 17:28:05,878 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 600 flow [2025-03-08 17:28:05,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2025-03-08 17:28:05,878 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2025-03-08 17:28:05,878 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 600 flow [2025-03-08 17:28:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-03-08 17:28:05,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:05,879 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] [2025-03-08 17:28:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:28:05,879 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 4 more)] === [2025-03-08 17:28:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash -203051585, now seen corresponding path program 2 times [2025-03-08 17:28:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803612707] [2025-03-08 17:28:05,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:05,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 17:28:05,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:28:05,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:05,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:05,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803612707] [2025-03-08 17:28:05,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803612707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384401852] [2025-03-08 17:28:05,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:05,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:05,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:28:05,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:28:05,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 17:28:06,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 17:28:06,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:06,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:06,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:28:06,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:06,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384401852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:28:06,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:28:06,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-08 17:28:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701709607] [2025-03-08 17:28:06,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:28:06,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:06,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:06,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:28:06,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-08 17:28:06,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 600 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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-03-08 17:28:06,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:06,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-08 17:28:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:07,652 INFO L124 PetriNetUnfolderBase]: 12943/15527 cut-off events. [2025-03-08 17:28:07,653 INFO L125 PetriNetUnfolderBase]: For 83070/83076 co-relation queries the response was YES. [2025-03-08 17:28:07,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74354 conditions, 15527 events. 12943/15527 cut-off events. For 83070/83076 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 54758 event pairs, 82 based on Foata normal form. 945/16438 useless extension candidates. Maximal degree in co-relation 64970. Up to 7455 conditions per place. [2025-03-08 17:28:07,776 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 456 selfloop transitions, 65 changer transitions 0/528 dead transitions. [2025-03-08 17:28:07,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 528 transitions, 4772 flow [2025-03-08 17:28:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 17:28:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 17:28:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 474 transitions. [2025-03-08 17:28:07,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061381074168798 [2025-03-08 17:28:07,778 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 600 flow. Second operand 17 states and 474 transitions. [2025-03-08 17:28:07,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 528 transitions, 4772 flow [2025-03-08 17:28:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 528 transitions, 4735 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:28:08,099 INFO L231 Difference]: Finished difference. Result has 119 places, 153 transitions, 1314 flow [2025-03-08 17:28:08,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1314, PETRI_PLACES=119, PETRI_TRANSITIONS=153} [2025-03-08 17:28:08,100 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 67 predicate places. [2025-03-08 17:28:08,100 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 153 transitions, 1314 flow [2025-03-08 17:28:08,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 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-03-08 17:28:08,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:08,100 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] [2025-03-08 17:28:08,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 17:28:08,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:08,304 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 4 more)] === [2025-03-08 17:28:08,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -588016477, now seen corresponding path program 1 times [2025-03-08 17:28:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:08,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511826273] [2025-03-08 17:28:08,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:08,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:28:08,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:28:08,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:08,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511826273] [2025-03-08 17:28:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511826273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546089660] [2025-03-08 17:28:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:08,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:08,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:08,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:28:08,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:28:08,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:28:08,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:28:08,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:08,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:08,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 17:28:08,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:37,478 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)