./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/parallel-lamport.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 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:31:29,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:31:29,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:31:29,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:31:29,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:31:29,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:31:29,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:31:29,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:31:29,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:31:29,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:31:29,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:31:29,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:31:29,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:31:29,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:31:29,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:31:29,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:31:29,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:31:29,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:31:29,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:31:29,192 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 -> 7641d1105b9de7b20c96680ae1baa82cbf27158c037dacb66ff49f347bd2fa94 [2025-03-08 17:31:29,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:31:29,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:31:29,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:31:29,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:31:29,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:31:29,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-08 17:31:30,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352b558fc/b8befda92bfb4ac2b13a7edc056f0e9a/FLAG6432e8531 [2025-03-08 17:31:30,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:31:30,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2025-03-08 17:31:30,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352b558fc/b8befda92bfb4ac2b13a7edc056f0e9a/FLAG6432e8531 [2025-03-08 17:31:31,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352b558fc/b8befda92bfb4ac2b13a7edc056f0e9a [2025-03-08 17:31:31,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:31:31,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:31:31,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:31:31,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:31:31,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:31:31,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb36ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31, skipping insertion in model container [2025-03-08 17:31:31,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:31:31,281 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/parallel-lamport.wvr.c[3044,3057] [2025-03-08 17:31:31,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:31:31,302 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:31:31,324 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/parallel-lamport.wvr.c[3044,3057] [2025-03-08 17:31:31,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:31:31,348 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:31:31,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31 WrapperNode [2025-03-08 17:31:31,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:31:31,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:31:31,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:31:31,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:31:31,356 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:31:31" (1/1) ... [2025-03-08 17:31:31,364 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:31:31" (1/1) ... [2025-03-08 17:31:31,391 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 204 [2025-03-08 17:31:31,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:31:31,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:31:31,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:31:31,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:31:31,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,420 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 17:31:31,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:31:31,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:31:31,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:31:31,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:31:31,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (1/1) ... [2025-03-08 17:31:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:31:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:31:31,461 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:31:31,463 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:31:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:31:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:31:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:31:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:31:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:31:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:31:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:31:31,479 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:31:31,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:31:31,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:31:31,844 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:31:31,844 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:31:32,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:31:32,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:31:32,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:32 BoogieIcfgContainer [2025-03-08 17:31:32,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:31:32,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:31:32,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:31:32,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:31:32,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:31" (1/3) ... [2025-03-08 17:31:32,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3bc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:32, skipping insertion in model container [2025-03-08 17:31:32,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:31" (2/3) ... [2025-03-08 17:31:32,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3bc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:32, skipping insertion in model container [2025-03-08 17:31:32,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:32" (3/3) ... [2025-03-08 17:31:32,011 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-03-08 17:31:32,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:31:32,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:31:32,022 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:31:32,071 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:31:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 141 flow [2025-03-08 17:31:32,132 INFO L124 PetriNetUnfolderBase]: 1/57 cut-off events. [2025-03-08 17:31:32,134 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:31:32,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 1/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2025-03-08 17:31:32,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 141 flow [2025-03-08 17:31:32,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 130 flow [2025-03-08 17:31:32,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:31:32,151 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;@34eeadfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:31:32,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:31:32,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:31:32,175 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2025-03-08 17:31:32,175 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:31:32,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:32,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:32,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:32,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash 84722432, now seen corresponding path program 1 times [2025-03-08 17:31:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729771959] [2025-03-08 17:31:32,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:31:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:32,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 17:31:32,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 17:31:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:32,605 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:31:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729771959] [2025-03-08 17:31:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729771959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699583603] [2025-03-08 17:31:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:32,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:32,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:32,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:32,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2025-03-08 17:31:32,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:31:32,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:32,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2025-03-08 17:31:32,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:33,128 INFO L124 PetriNetUnfolderBase]: 3049/4663 cut-off events. [2025-03-08 17:31:33,128 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-03-08 17:31:33,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9512 conditions, 4663 events. 3049/4663 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23130 event pairs, 3048 based on Foata normal form. 0/4621 useless extension candidates. Maximal degree in co-relation 9043. Up to 4555 conditions per place. [2025-03-08 17:31:33,160 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 50 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-08 17:31:33,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 236 flow [2025-03-08 17:31:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-08 17:31:33,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2025-03-08 17:31:33,171 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 130 flow. Second operand 3 states and 77 transitions. [2025-03-08 17:31:33,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 236 flow [2025-03-08 17:31:33,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 224 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:31:33,184 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 130 flow [2025-03-08 17:31:33,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-03-08 17:31:33,188 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2025-03-08 17:31:33,190 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 130 flow [2025-03-08 17:31:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:31:33,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:33,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:31:33,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -458154889, now seen corresponding path program 1 times [2025-03-08 17:31:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197203813] [2025-03-08 17:31:33,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:31:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:31:33,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:33,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:33,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:33,336 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:31:33,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197203813] [2025-03-08 17:31:33,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197203813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:33,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:33,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:33,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810501377] [2025-03-08 17:31:33,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:33,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:33,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:33,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:33,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:33,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2025-03-08 17:31:33,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:31:33,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:33,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2025-03-08 17:31:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:33,692 INFO L124 PetriNetUnfolderBase]: 3021/4629 cut-off events. [2025-03-08 17:31:33,693 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-08 17:31:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9276 conditions, 4629 events. 3021/4629 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23042 event pairs, 2414 based on Foata normal form. 28/4623 useless extension candidates. Maximal degree in co-relation 9245. Up to 3630 conditions per place. [2025-03-08 17:31:33,711 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 67 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-08 17:31:33,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 304 flow [2025-03-08 17:31:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-08 17:31:33,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-08 17:31:33,714 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 130 flow. Second operand 3 states and 93 transitions. [2025-03-08 17:31:33,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 304 flow [2025-03-08 17:31:33,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 300 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:31:33,716 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 134 flow [2025-03-08 17:31:33,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-03-08 17:31:33,716 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2025-03-08 17:31:33,716 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 134 flow [2025-03-08 17:31:33,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:31:33,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:33,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:33,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:31:33,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:33,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1462391447, now seen corresponding path program 2 times [2025-03-08 17:31:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:33,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812367797] [2025-03-08 17:31:33,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:31:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:33,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:33,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:33,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:31:33,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:33,868 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:31:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812367797] [2025-03-08 17:31:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812367797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:33,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:31:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337612376] [2025-03-08 17:31:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:31:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:33,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:31:33,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:31:33,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2025-03-08 17:31:33,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:31:33,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:33,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2025-03-08 17:31:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:34,334 INFO L124 PetriNetUnfolderBase]: 3659/5759 cut-off events. [2025-03-08 17:31:34,335 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2025-03-08 17:31:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12115 conditions, 5759 events. 3659/5759 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 32308 event pairs, 1074 based on Foata normal form. 98/5854 useless extension candidates. Maximal degree in co-relation 12079. Up to 2617 conditions per place. [2025-03-08 17:31:34,359 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 95 selfloop transitions, 7 changer transitions 1/108 dead transitions. [2025-03-08 17:31:34,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 459 flow [2025-03-08 17:31:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:31:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:31:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-03-08 17:31:34,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-08 17:31:34,361 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 134 flow. Second operand 5 states and 144 transitions. [2025-03-08 17:31:34,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 459 flow [2025-03-08 17:31:34,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:31:34,364 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 172 flow [2025-03-08 17:31:34,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-08 17:31:34,365 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2025-03-08 17:31:34,365 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 172 flow [2025-03-08 17:31:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:31:34,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:34,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:34,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:31:34,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:34,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 546372349, now seen corresponding path program 3 times [2025-03-08 17:31:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608925541] [2025-03-08 17:31:34,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:31:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:34,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:34,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:34,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:31:34,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:34,470 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:31:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608925541] [2025-03-08 17:31:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608925541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:31:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53004025] [2025-03-08 17:31:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:31:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:34,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:31:34,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:31:34,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2025-03-08 17:31:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:31:34,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:34,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2025-03-08 17:31:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:34,782 INFO L124 PetriNetUnfolderBase]: 3503/5451 cut-off events. [2025-03-08 17:31:34,782 INFO L125 PetriNetUnfolderBase]: For 1321/1321 co-relation queries the response was YES. [2025-03-08 17:31:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12529 conditions, 5451 events. 3503/5451 cut-off events. For 1321/1321 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 28928 event pairs, 2656 based on Foata normal form. 28/5448 useless extension candidates. Maximal degree in co-relation 12489. Up to 4404 conditions per place. [2025-03-08 17:31:34,804 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 73 selfloop transitions, 2 changer transitions 1/81 dead transitions. [2025-03-08 17:31:34,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 381 flow [2025-03-08 17:31:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:31:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:31:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-08 17:31:34,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-08 17:31:34,806 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 172 flow. Second operand 3 states and 94 transitions. [2025-03-08 17:31:34,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 381 flow [2025-03-08 17:31:34,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:31:34,813 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 176 flow [2025-03-08 17:31:34,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-08 17:31:34,814 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 6 predicate places. [2025-03-08 17:31:34,814 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 176 flow [2025-03-08 17:31:34,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:31:34,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:34,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:31:34,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 487079021, now seen corresponding path program 4 times [2025-03-08 17:31:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167945537] [2025-03-08 17:31:34,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:31:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:34,828 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:34,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-03-08 17:31:34,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:31:34,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:35,084 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:31:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167945537] [2025-03-08 17:31:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167945537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:31:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224210622] [2025-03-08 17:31:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:35,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:31:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:35,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:31:35,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:31:35,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 176 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:35,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:37,168 INFO L124 PetriNetUnfolderBase]: 7521/11377 cut-off events. [2025-03-08 17:31:37,168 INFO L125 PetriNetUnfolderBase]: For 3887/3887 co-relation queries the response was YES. [2025-03-08 17:31:37,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26614 conditions, 11377 events. 7521/11377 cut-off events. For 3887/3887 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 64549 event pairs, 899 based on Foata normal form. 1/11374 useless extension candidates. Maximal degree in co-relation 26573. Up to 5188 conditions per place. [2025-03-08 17:31:37,208 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 393 selfloop transitions, 116 changer transitions 31/543 dead transitions. [2025-03-08 17:31:37,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 543 transitions, 2752 flow [2025-03-08 17:31:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 17:31:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-08 17:31:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 749 transitions. [2025-03-08 17:31:37,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3120833333333333 [2025-03-08 17:31:37,213 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 176 flow. Second operand 40 states and 749 transitions. [2025-03-08 17:31:37,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 543 transitions, 2752 flow [2025-03-08 17:31:37,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 543 transitions, 2688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:31:37,225 INFO L231 Difference]: Finished difference. Result has 139 places, 183 transitions, 934 flow [2025-03-08 17:31:37,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=934, PETRI_PLACES=139, PETRI_TRANSITIONS=183} [2025-03-08 17:31:37,229 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 74 predicate places. [2025-03-08 17:31:37,229 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 183 transitions, 934 flow [2025-03-08 17:31:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:37,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:37,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:37,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:31:37,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:37,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1970018469, now seen corresponding path program 5 times [2025-03-08 17:31:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:37,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775514010] [2025-03-08 17:31:37,233 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:31:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:37,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:37,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:37,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:31:37,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:37,371 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:31:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775514010] [2025-03-08 17:31:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775514010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:31:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798347883] [2025-03-08 17:31:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:31:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:31:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:31:37,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2025-03-08 17:31:37,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 183 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:31:37,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:37,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2025-03-08 17:31:37,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:38,029 INFO L124 PetriNetUnfolderBase]: 4610/7399 cut-off events. [2025-03-08 17:31:38,029 INFO L125 PetriNetUnfolderBase]: For 19304/19318 co-relation queries the response was YES. [2025-03-08 17:31:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25469 conditions, 7399 events. 4610/7399 cut-off events. For 19304/19318 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 43968 event pairs, 1113 based on Foata normal form. 94/7476 useless extension candidates. Maximal degree in co-relation 25393. Up to 3133 conditions per place. [2025-03-08 17:31:38,059 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 200 selfloop transitions, 9 changer transitions 4/222 dead transitions. [2025-03-08 17:31:38,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 222 transitions, 1507 flow [2025-03-08 17:31:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:31:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:31:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-08 17:31:38,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2025-03-08 17:31:38,060 INFO L175 Difference]: Start difference. First operand has 139 places, 183 transitions, 934 flow. Second operand 5 states and 139 transitions. [2025-03-08 17:31:38,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 222 transitions, 1507 flow [2025-03-08 17:31:38,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 222 transitions, 1406 flow, removed 35 selfloop flow, removed 15 redundant places. [2025-03-08 17:31:38,128 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 566 flow [2025-03-08 17:31:38,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=566, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2025-03-08 17:31:38,129 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 52 predicate places. [2025-03-08 17:31:38,129 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 566 flow [2025-03-08 17:31:38,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:31:38,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:38,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:31:38,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2099462993, now seen corresponding path program 6 times [2025-03-08 17:31:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:38,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691333958] [2025-03-08 17:31:38,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:31:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:38,139 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:38,164 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:38,165 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:31:38,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:38,409 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:31:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:38,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691333958] [2025-03-08 17:31:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691333958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:31:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050828061] [2025-03-08 17:31:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:31:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:38,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:31:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:31:38,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:38,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 566 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:38,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:38,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:38,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:40,047 INFO L124 PetriNetUnfolderBase]: 5605/8736 cut-off events. [2025-03-08 17:31:40,047 INFO L125 PetriNetUnfolderBase]: For 9417/9417 co-relation queries the response was YES. [2025-03-08 17:31:40,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27582 conditions, 8736 events. 5605/8736 cut-off events. For 9417/9417 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 49472 event pairs, 1139 based on Foata normal form. 1/8734 useless extension candidates. Maximal degree in co-relation 27518. Up to 5602 conditions per place. [2025-03-08 17:31:40,093 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 204 selfloop transitions, 47 changer transitions 74/328 dead transitions. [2025-03-08 17:31:40,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 328 transitions, 2182 flow [2025-03-08 17:31:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 17:31:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 17:31:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 416 transitions. [2025-03-08 17:31:40,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2773333333333333 [2025-03-08 17:31:40,095 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 566 flow. Second operand 25 states and 416 transitions. [2025-03-08 17:31:40,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 328 transitions, 2182 flow [2025-03-08 17:31:40,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 328 transitions, 2138 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-08 17:31:40,140 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 732 flow [2025-03-08 17:31:40,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=732, PETRI_PLACES=151, PETRI_TRANSITIONS=131} [2025-03-08 17:31:40,141 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 86 predicate places. [2025-03-08 17:31:40,141 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 732 flow [2025-03-08 17:31:40,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:40,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:40,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:31:40,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1000104851, now seen corresponding path program 7 times [2025-03-08 17:31:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375341236] [2025-03-08 17:31:40,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:31:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:31:40,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:40,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375341236] [2025-03-08 17:31:40,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375341236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:31:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133148586] [2025-03-08 17:31:40,532 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:31:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:31:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:31:40,534 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:31:40,535 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:31:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:31:40,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:40,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:40,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:40,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 17:31:40,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:31:40,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:31:40,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:31:40,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-03-08 17:31:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:41,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:31:41,256 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:31:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133148586] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:31:41,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:31:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12, 15] total 31 [2025-03-08 17:31:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535368857] [2025-03-08 17:31:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:31:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:41,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:31:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-03-08 17:31:41,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:41,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 131 transitions, 732 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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:31:41,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:41,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:42,690 INFO L124 PetriNetUnfolderBase]: 5994/9303 cut-off events. [2025-03-08 17:31:42,690 INFO L125 PetriNetUnfolderBase]: For 18892/18892 co-relation queries the response was YES. [2025-03-08 17:31:42,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32661 conditions, 9303 events. 5994/9303 cut-off events. For 18892/18892 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 53010 event pairs, 1452 based on Foata normal form. 1/9301 useless extension candidates. Maximal degree in co-relation 32618. Up to 6451 conditions per place. [2025-03-08 17:31:42,738 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 218 selfloop transitions, 47 changer transitions 51/319 dead transitions. [2025-03-08 17:31:42,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 319 transitions, 2284 flow [2025-03-08 17:31:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 17:31:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-08 17:31:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 371 transitions. [2025-03-08 17:31:42,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2688405797101449 [2025-03-08 17:31:42,741 INFO L175 Difference]: Start difference. First operand has 151 places, 131 transitions, 732 flow. Second operand 23 states and 371 transitions. [2025-03-08 17:31:42,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 319 transitions, 2284 flow [2025-03-08 17:31:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 319 transitions, 2108 flow, removed 42 selfloop flow, removed 19 redundant places. [2025-03-08 17:31:42,922 INFO L231 Difference]: Finished difference. Result has 160 places, 160 transitions, 1008 flow [2025-03-08 17:31:42,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1008, PETRI_PLACES=160, PETRI_TRANSITIONS=160} [2025-03-08 17:31:42,924 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 95 predicate places. [2025-03-08 17:31:42,924 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 160 transitions, 1008 flow [2025-03-08 17:31:42,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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:31:42,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:42,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:42,932 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:31:43,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:31:43,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:43,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -709936911, now seen corresponding path program 8 times [2025-03-08 17:31:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937579852] [2025-03-08 17:31:43,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:31:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:43,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:43,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:43,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:31:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:43,385 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:31:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937579852] [2025-03-08 17:31:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937579852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:43,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:31:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831846349] [2025-03-08 17:31:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:43,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:31:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:43,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:31:43,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:31:43,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:43,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 160 transitions, 1008 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:43,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:43,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:45,232 INFO L124 PetriNetUnfolderBase]: 6607/10288 cut-off events. [2025-03-08 17:31:45,232 INFO L125 PetriNetUnfolderBase]: For 26694/26694 co-relation queries the response was YES. [2025-03-08 17:31:45,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39099 conditions, 10288 events. 6607/10288 cut-off events. For 26694/26694 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 59978 event pairs, 1388 based on Foata normal form. 1/10286 useless extension candidates. Maximal degree in co-relation 39045. Up to 6429 conditions per place. [2025-03-08 17:31:45,278 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 281 selfloop transitions, 60 changer transitions 92/436 dead transitions. [2025-03-08 17:31:45,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 436 transitions, 3319 flow [2025-03-08 17:31:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 17:31:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-08 17:31:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 537 transitions. [2025-03-08 17:31:45,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27121212121212124 [2025-03-08 17:31:45,280 INFO L175 Difference]: Start difference. First operand has 160 places, 160 transitions, 1008 flow. Second operand 33 states and 537 transitions. [2025-03-08 17:31:45,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 436 transitions, 3319 flow [2025-03-08 17:31:45,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 436 transitions, 3125 flow, removed 96 selfloop flow, removed 7 redundant places. [2025-03-08 17:31:45,385 INFO L231 Difference]: Finished difference. Result has 196 places, 167 transitions, 1180 flow [2025-03-08 17:31:45,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1180, PETRI_PLACES=196, PETRI_TRANSITIONS=167} [2025-03-08 17:31:45,386 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 131 predicate places. [2025-03-08 17:31:45,386 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 167 transitions, 1180 flow [2025-03-08 17:31:45,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:45,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:45,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:45,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:31:45,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1085475629, now seen corresponding path program 9 times [2025-03-08 17:31:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544065305] [2025-03-08 17:31:45,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:31:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:45,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:45,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:45,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:31:45,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:45,563 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:31:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544065305] [2025-03-08 17:31:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544065305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:31:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868299743] [2025-03-08 17:31:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:31:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:45,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:31:45,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:31:45,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:45,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 167 transitions, 1180 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 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:31:45,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:45,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:45,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:47,310 INFO L124 PetriNetUnfolderBase]: 7055/10963 cut-off events. [2025-03-08 17:31:47,310 INFO L125 PetriNetUnfolderBase]: For 53335/53335 co-relation queries the response was YES. [2025-03-08 17:31:47,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46226 conditions, 10963 events. 7055/10963 cut-off events. For 53335/53335 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 64867 event pairs, 1530 based on Foata normal form. 1/10961 useless extension candidates. Maximal degree in co-relation 46160. Up to 7467 conditions per place. [2025-03-08 17:31:47,399 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 291 selfloop transitions, 61 changer transitions 48/403 dead transitions. [2025-03-08 17:31:47,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 403 transitions, 3395 flow [2025-03-08 17:31:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 17:31:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-08 17:31:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 463 transitions. [2025-03-08 17:31:47,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2660919540229885 [2025-03-08 17:31:47,401 INFO L175 Difference]: Start difference. First operand has 196 places, 167 transitions, 1180 flow. Second operand 29 states and 463 transitions. [2025-03-08 17:31:47,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 403 transitions, 3395 flow [2025-03-08 17:31:47,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 403 transitions, 3084 flow, removed 89 selfloop flow, removed 23 redundant places. [2025-03-08 17:31:47,583 INFO L231 Difference]: Finished difference. Result has 203 places, 196 transitions, 1519 flow [2025-03-08 17:31:47,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1519, PETRI_PLACES=203, PETRI_TRANSITIONS=196} [2025-03-08 17:31:47,584 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 138 predicate places. [2025-03-08 17:31:47,584 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 196 transitions, 1519 flow [2025-03-08 17:31:47,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 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:31:47,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:47,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:47,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:31:47,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 448621971, now seen corresponding path program 10 times [2025-03-08 17:31:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:47,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554124919] [2025-03-08 17:31:47,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:31:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:47,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:47,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-03-08 17:31:47,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:31:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:47,740 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:31:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:47,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554124919] [2025-03-08 17:31:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554124919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:47,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:31:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377560774] [2025-03-08 17:31:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:47,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:31:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:47,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:31:47,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:31:47,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:47,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 196 transitions, 1519 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:47,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:47,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:47,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:49,397 INFO L124 PetriNetUnfolderBase]: 7011/10903 cut-off events. [2025-03-08 17:31:49,398 INFO L125 PetriNetUnfolderBase]: For 44739/44739 co-relation queries the response was YES. [2025-03-08 17:31:49,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45913 conditions, 10903 events. 7011/10903 cut-off events. For 44739/44739 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 64236 event pairs, 1727 based on Foata normal form. 1/10901 useless extension candidates. Maximal degree in co-relation 45841. Up to 7353 conditions per place. [2025-03-08 17:31:49,493 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 270 selfloop transitions, 70 changer transitions 89/432 dead transitions. [2025-03-08 17:31:49,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 432 transitions, 3571 flow [2025-03-08 17:31:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 17:31:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-08 17:31:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 505 transitions. [2025-03-08 17:31:49,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2630208333333333 [2025-03-08 17:31:49,494 INFO L175 Difference]: Start difference. First operand has 203 places, 196 transitions, 1519 flow. Second operand 32 states and 505 transitions. [2025-03-08 17:31:49,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 432 transitions, 3571 flow [2025-03-08 17:31:49,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 432 transitions, 3371 flow, removed 99 selfloop flow, removed 6 redundant places. [2025-03-08 17:31:49,690 INFO L231 Difference]: Finished difference. Result has 234 places, 200 transitions, 1598 flow [2025-03-08 17:31:49,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1598, PETRI_PLACES=234, PETRI_TRANSITIONS=200} [2025-03-08 17:31:49,691 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 169 predicate places. [2025-03-08 17:31:49,691 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 200 transitions, 1598 flow [2025-03-08 17:31:49,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:49,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:49,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:49,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:31:49,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:49,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash 100580757, now seen corresponding path program 11 times [2025-03-08 17:31:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898497466] [2025-03-08 17:31:49,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:31:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:49,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:49,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:49,722 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:31:49,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898497466] [2025-03-08 17:31:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898497466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:31:50,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720330432] [2025-03-08 17:31:50,256 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:31:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:31:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:31:50,258 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:31:50,260 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:31:50,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:50,321 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:50,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:31:50,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:50,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 17:31:50,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:31:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-08 17:31:50,544 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:31:50,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-08 17:31:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:50,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:31:51,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-08 17:31:51,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-08 17:31:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720330432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:31:51,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:31:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 30 [2025-03-08 17:31:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121042094] [2025-03-08 17:31:51,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:31:51,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 17:31:51,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:51,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 17:31:51,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:31:51,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 60 [2025-03-08 17:31:51,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 200 transitions, 1598 flow. Second operand has 30 states, 30 states have (on average 11.3) internal successors, (339), 30 states have internal predecessors, (339), 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:31:51,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:51,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 60 [2025-03-08 17:31:51,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:54,790 INFO L124 PetriNetUnfolderBase]: 14648/23008 cut-off events. [2025-03-08 17:31:54,790 INFO L125 PetriNetUnfolderBase]: For 104523/104555 co-relation queries the response was YES. [2025-03-08 17:31:55,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98744 conditions, 23008 events. 14648/23008 cut-off events. For 104523/104555 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 159092 event pairs, 2750 based on Foata normal form. 34/23003 useless extension candidates. Maximal degree in co-relation 96799. Up to 8940 conditions per place. [2025-03-08 17:31:55,079 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 358 selfloop transitions, 76 changer transitions 246/686 dead transitions. [2025-03-08 17:31:55,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 686 transitions, 6380 flow [2025-03-08 17:31:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 17:31:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 17:31:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 479 transitions. [2025-03-08 17:31:55,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36287878787878786 [2025-03-08 17:31:55,085 INFO L175 Difference]: Start difference. First operand has 234 places, 200 transitions, 1598 flow. Second operand 22 states and 479 transitions. [2025-03-08 17:31:55,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 686 transitions, 6380 flow [2025-03-08 17:31:55,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 686 transitions, 5831 flow, removed 156 selfloop flow, removed 26 redundant places. [2025-03-08 17:31:55,651 INFO L231 Difference]: Finished difference. Result has 230 places, 259 transitions, 2450 flow [2025-03-08 17:31:55,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2450, PETRI_PLACES=230, PETRI_TRANSITIONS=259} [2025-03-08 17:31:55,652 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 165 predicate places. [2025-03-08 17:31:55,652 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 259 transitions, 2450 flow [2025-03-08 17:31:55,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.3) internal successors, (339), 30 states have internal predecessors, (339), 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:31:55,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:55,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:55,658 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:31:55,853 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,SelfDestructingSolverStorable11 [2025-03-08 17:31:55,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2122467485, now seen corresponding path program 12 times [2025-03-08 17:31:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547466420] [2025-03-08 17:31:55,854 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:31:55,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:55,860 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:31:55,875 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:31:55,876 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:31:55,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:56,027 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:31:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547466420] [2025-03-08 17:31:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547466420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:31:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:31:56,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:31:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838268961] [2025-03-08 17:31:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:31:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:31:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:31:56,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:31:56,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:31:56,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:31:56,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 259 transitions, 2450 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:56,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:31:56,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:31:56,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:31:58,683 INFO L124 PetriNetUnfolderBase]: 11640/18419 cut-off events. [2025-03-08 17:31:58,683 INFO L125 PetriNetUnfolderBase]: For 105426/105426 co-relation queries the response was YES. [2025-03-08 17:31:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82903 conditions, 18419 events. 11640/18419 cut-off events. For 105426/105426 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 121652 event pairs, 3182 based on Foata normal form. 2/18415 useless extension candidates. Maximal degree in co-relation 81160. Up to 12867 conditions per place. [2025-03-08 17:31:58,871 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 329 selfloop transitions, 124 changer transitions 41/497 dead transitions. [2025-03-08 17:31:58,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 497 transitions, 4877 flow [2025-03-08 17:31:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 17:31:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-08 17:31:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 431 transitions. [2025-03-08 17:31:58,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2762820512820513 [2025-03-08 17:31:58,877 INFO L175 Difference]: Start difference. First operand has 230 places, 259 transitions, 2450 flow. Second operand 26 states and 431 transitions. [2025-03-08 17:31:58,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 497 transitions, 4877 flow [2025-03-08 17:31:59,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 497 transitions, 4679 flow, removed 95 selfloop flow, removed 6 redundant places. [2025-03-08 17:31:59,724 INFO L231 Difference]: Finished difference. Result has 256 places, 303 transitions, 3136 flow [2025-03-08 17:31:59,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3136, PETRI_PLACES=256, PETRI_TRANSITIONS=303} [2025-03-08 17:31:59,725 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 191 predicate places. [2025-03-08 17:31:59,725 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 303 transitions, 3136 flow [2025-03-08 17:31:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:31:59,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:31:59,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:31:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:31:59,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:31:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:31:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 511604647, now seen corresponding path program 13 times [2025-03-08 17:31:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:31:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435192874] [2025-03-08 17:31:59,726 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:31:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:31:59,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:31:59,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:31:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:31:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:31:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:31:59,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:31:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435192874] [2025-03-08 17:31:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435192874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:31:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566530076] [2025-03-08 17:31:59,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:31:59,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:31:59,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:31:59,997 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:31:59,998 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:32:00,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:32:00,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:00,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:00,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 17:32:00,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:00,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:32:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:00,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:01,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-03-08 17:32:01,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:32:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-03-08 17:32:01,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2025-03-08 17:32:01,489 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-08 17:32:01,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 1 [2025-03-08 17:32:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566530076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:32:01,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:32:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2025-03-08 17:32:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253079581] [2025-03-08 17:32:01,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:32:01,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 17:32:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:01,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 17:32:01,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 17:32:01,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:01,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 303 transitions, 3136 flow. Second operand has 33 states, 33 states have (on average 10.030303030303031) internal successors, (331), 33 states have internal predecessors, (331), 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:32:01,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:01,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:01,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:08,353 INFO L124 PetriNetUnfolderBase]: 12812/20397 cut-off events. [2025-03-08 17:32:08,353 INFO L125 PetriNetUnfolderBase]: For 119042/119042 co-relation queries the response was YES. [2025-03-08 17:32:08,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95230 conditions, 20397 events. 12812/20397 cut-off events. For 119042/119042 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 139304 event pairs, 3000 based on Foata normal form. 2/20396 useless extension candidates. Maximal degree in co-relation 91995. Up to 10365 conditions per place. [2025-03-08 17:32:08,523 INFO L140 encePairwiseOnDemand]: 38/60 looper letters, 438 selfloop transitions, 81 changer transitions 362/884 dead transitions. [2025-03-08 17:32:08,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 884 transitions, 8212 flow [2025-03-08 17:32:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-08 17:32:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-08 17:32:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 1023 transitions. [2025-03-08 17:32:08,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24357142857142858 [2025-03-08 17:32:08,525 INFO L175 Difference]: Start difference. First operand has 256 places, 303 transitions, 3136 flow. Second operand 70 states and 1023 transitions. [2025-03-08 17:32:08,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 884 transitions, 8212 flow [2025-03-08 17:32:09,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 884 transitions, 7781 flow, removed 195 selfloop flow, removed 8 redundant places. [2025-03-08 17:32:09,461 INFO L231 Difference]: Finished difference. Result has 346 places, 306 transitions, 3154 flow [2025-03-08 17:32:09,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2868, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=3154, PETRI_PLACES=346, PETRI_TRANSITIONS=306} [2025-03-08 17:32:09,462 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 281 predicate places. [2025-03-08 17:32:09,462 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 306 transitions, 3154 flow [2025-03-08 17:32:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.030303030303031) internal successors, (331), 33 states have internal predecessors, (331), 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:32:09,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:09,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:09,468 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:32:09,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:09,666 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:09,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 6810503, now seen corresponding path program 14 times [2025-03-08 17:32:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:09,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536902274] [2025-03-08 17:32:09,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:09,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:09,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:32:09,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:32:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:09,806 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:32:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536902274] [2025-03-08 17:32:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536902274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:32:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245838165] [2025-03-08 17:32:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:32:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:09,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:32:09,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:32:09,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:09,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 306 transitions, 3154 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:32:09,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:09,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:09,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:12,858 INFO L124 PetriNetUnfolderBase]: 11594/18251 cut-off events. [2025-03-08 17:32:12,858 INFO L125 PetriNetUnfolderBase]: For 130575/130575 co-relation queries the response was YES. [2025-03-08 17:32:13,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89174 conditions, 18251 events. 11594/18251 cut-off events. For 130575/130575 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 119536 event pairs, 2122 based on Foata normal form. 2/18247 useless extension candidates. Maximal degree in co-relation 89009. Up to 10676 conditions per place. [2025-03-08 17:32:13,191 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 420 selfloop transitions, 127 changer transitions 67/617 dead transitions. [2025-03-08 17:32:13,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 617 transitions, 6672 flow [2025-03-08 17:32:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 17:32:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-08 17:32:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 501 transitions. [2025-03-08 17:32:13,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28793103448275864 [2025-03-08 17:32:13,193 INFO L175 Difference]: Start difference. First operand has 346 places, 306 transitions, 3154 flow. Second operand 29 states and 501 transitions. [2025-03-08 17:32:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 617 transitions, 6672 flow [2025-03-08 17:32:14,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 617 transitions, 6174 flow, removed 207 selfloop flow, removed 28 redundant places. [2025-03-08 17:32:14,093 INFO L231 Difference]: Finished difference. Result has 323 places, 356 transitions, 3954 flow [2025-03-08 17:32:14,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3954, PETRI_PLACES=323, PETRI_TRANSITIONS=356} [2025-03-08 17:32:14,093 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 258 predicate places. [2025-03-08 17:32:14,093 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 356 transitions, 3954 flow [2025-03-08 17:32:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:32:14,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:14,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:14,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:32:14,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash 592564791, now seen corresponding path program 15 times [2025-03-08 17:32:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442407193] [2025-03-08 17:32:14,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:14,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:14,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:32:14,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:32:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:14,243 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:32:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442407193] [2025-03-08 17:32:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442407193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646230214] [2025-03-08 17:32:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:14,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:14,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 356 transitions, 3954 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:14,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:14,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:14,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:16,972 INFO L124 PetriNetUnfolderBase]: 11114/17506 cut-off events. [2025-03-08 17:32:16,972 INFO L125 PetriNetUnfolderBase]: For 131087/131087 co-relation queries the response was YES. [2025-03-08 17:32:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88218 conditions, 17506 events. 11114/17506 cut-off events. For 131087/131087 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 113296 event pairs, 2721 based on Foata normal form. 2/17502 useless extension candidates. Maximal degree in co-relation 87782. Up to 13137 conditions per place. [2025-03-08 17:32:17,125 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 385 selfloop transitions, 94 changer transitions 59/541 dead transitions. [2025-03-08 17:32:17,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 541 transitions, 6240 flow [2025-03-08 17:32:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 17:32:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-08 17:32:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 366 transitions. [2025-03-08 17:32:17,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26521739130434785 [2025-03-08 17:32:17,127 INFO L175 Difference]: Start difference. First operand has 323 places, 356 transitions, 3954 flow. Second operand 23 states and 366 transitions. [2025-03-08 17:32:17,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 541 transitions, 6240 flow [2025-03-08 17:32:18,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 541 transitions, 5782 flow, removed 202 selfloop flow, removed 13 redundant places. [2025-03-08 17:32:18,279 INFO L231 Difference]: Finished difference. Result has 337 places, 386 transitions, 4292 flow [2025-03-08 17:32:18,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3584, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4292, PETRI_PLACES=337, PETRI_TRANSITIONS=386} [2025-03-08 17:32:18,279 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 272 predicate places. [2025-03-08 17:32:18,280 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 386 transitions, 4292 flow [2025-03-08 17:32:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:18,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:18,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:32:18,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 123232339, now seen corresponding path program 16 times [2025-03-08 17:32:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485041358] [2025-03-08 17:32:18,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:18,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:18,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-03-08 17:32:18,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:32:18,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:18,388 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:32:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485041358] [2025-03-08 17:32:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485041358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:18,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83242542] [2025-03-08 17:32:18,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:18,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:18,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:18,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 386 transitions, 4292 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:21,810 INFO L124 PetriNetUnfolderBase]: 11574/18241 cut-off events. [2025-03-08 17:32:21,810 INFO L125 PetriNetUnfolderBase]: For 135779/135779 co-relation queries the response was YES. [2025-03-08 17:32:21,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92480 conditions, 18241 events. 11574/18241 cut-off events. For 135779/135779 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 119323 event pairs, 2091 based on Foata normal form. 2/18237 useless extension candidates. Maximal degree in co-relation 91666. Up to 10719 conditions per place. [2025-03-08 17:32:21,943 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 453 selfloop transitions, 171 changer transitions 45/672 dead transitions. [2025-03-08 17:32:21,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 672 transitions, 7472 flow [2025-03-08 17:32:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 17:32:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-08 17:32:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 540 transitions. [2025-03-08 17:32:21,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28125 [2025-03-08 17:32:21,945 INFO L175 Difference]: Start difference. First operand has 337 places, 386 transitions, 4292 flow. Second operand 32 states and 540 transitions. [2025-03-08 17:32:21,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 672 transitions, 7472 flow [2025-03-08 17:32:22,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 672 transitions, 7085 flow, removed 129 selfloop flow, removed 12 redundant places. [2025-03-08 17:32:22,907 INFO L231 Difference]: Finished difference. Result has 362 places, 413 transitions, 4887 flow [2025-03-08 17:32:22,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4021, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4887, PETRI_PLACES=362, PETRI_TRANSITIONS=413} [2025-03-08 17:32:22,908 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 297 predicate places. [2025-03-08 17:32:22,908 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 413 transitions, 4887 flow [2025-03-08 17:32:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:22,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:22,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:32:22,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash -468213299, now seen corresponding path program 17 times [2025-03-08 17:32:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974995686] [2025-03-08 17:32:22,909 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:22,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:22,918 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:22,918 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:22,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974995686] [2025-03-08 17:32:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974995686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763986617] [2025-03-08 17:32:23,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:23,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:23,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:23,387 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:32:23,388 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:32:23,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:23,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:23,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:23,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:23,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 17:32:23,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:23,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:32:23,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:32:23,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-03-08 17:32:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:23,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:24,085 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:32:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763986617] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:32:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13, 15] total 32 [2025-03-08 17:32:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984639615] [2025-03-08 17:32:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:24,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:32:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:32:24,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2025-03-08 17:32:24,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:24,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 413 transitions, 4887 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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:32:24,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:24,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:24,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:27,873 INFO L124 PetriNetUnfolderBase]: 11810/18623 cut-off events. [2025-03-08 17:32:27,873 INFO L125 PetriNetUnfolderBase]: For 145609/145609 co-relation queries the response was YES. [2025-03-08 17:32:28,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97184 conditions, 18623 events. 11810/18623 cut-off events. For 145609/145609 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 121574 event pairs, 2728 based on Foata normal form. 2/18619 useless extension candidates. Maximal degree in co-relation 96362. Up to 13741 conditions per place. [2025-03-08 17:32:28,064 INFO L140 encePairwiseOnDemand]: 40/60 looper letters, 409 selfloop transitions, 112 changer transitions 59/583 dead transitions. [2025-03-08 17:32:28,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 583 transitions, 7095 flow [2025-03-08 17:32:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 17:32:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 17:32:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 381 transitions. [2025-03-08 17:32:28,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.254 [2025-03-08 17:32:28,065 INFO L175 Difference]: Start difference. First operand has 362 places, 413 transitions, 4887 flow. Second operand 25 states and 381 transitions. [2025-03-08 17:32:28,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 583 transitions, 7095 flow [2025-03-08 17:32:29,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 583 transitions, 6768 flow, removed 89 selfloop flow, removed 18 redundant places. [2025-03-08 17:32:29,292 INFO L231 Difference]: Finished difference. Result has 372 places, 426 transitions, 5171 flow [2025-03-08 17:32:29,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5171, PETRI_PLACES=372, PETRI_TRANSITIONS=426} [2025-03-08 17:32:29,292 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 307 predicate places. [2025-03-08 17:32:29,292 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 426 transitions, 5171 flow [2025-03-08 17:32:29,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 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:32:29,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:29,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:29,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 17:32:29,493 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1427293741, now seen corresponding path program 18 times [2025-03-08 17:32:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646129811] [2025-03-08 17:32:29,494 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:32:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:29,500 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:29,508 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:32:29,508 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:32:29,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:29,796 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:32:29,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:29,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646129811] [2025-03-08 17:32:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646129811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:29,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265640885] [2025-03-08 17:32:29,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:29,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:29,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:29,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 426 transitions, 5171 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:29,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:29,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:29,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:32,824 INFO L124 PetriNetUnfolderBase]: 11586/18275 cut-off events. [2025-03-08 17:32:32,824 INFO L125 PetriNetUnfolderBase]: For 143389/143389 co-relation queries the response was YES. [2025-03-08 17:32:32,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95753 conditions, 18275 events. 11586/18275 cut-off events. For 143389/143389 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 119352 event pairs, 2717 based on Foata normal form. 2/18271 useless extension candidates. Maximal degree in co-relation 94927. Up to 13248 conditions per place. [2025-03-08 17:32:32,977 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 406 selfloop transitions, 108 changer transitions 65/582 dead transitions. [2025-03-08 17:32:32,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 582 transitions, 7095 flow [2025-03-08 17:32:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 17:32:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 17:32:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 358 transitions. [2025-03-08 17:32:32,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2841269841269841 [2025-03-08 17:32:32,978 INFO L175 Difference]: Start difference. First operand has 372 places, 426 transitions, 5171 flow. Second operand 21 states and 358 transitions. [2025-03-08 17:32:32,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 582 transitions, 7095 flow [2025-03-08 17:32:33,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 582 transitions, 6820 flow, removed 78 selfloop flow, removed 14 redundant places. [2025-03-08 17:32:33,975 INFO L231 Difference]: Finished difference. Result has 378 places, 414 transitions, 5004 flow [2025-03-08 17:32:33,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4916, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5004, PETRI_PLACES=378, PETRI_TRANSITIONS=414} [2025-03-08 17:32:33,975 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 313 predicate places. [2025-03-08 17:32:33,975 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 414 transitions, 5004 flow [2025-03-08 17:32:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:33,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:33,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:33,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:32:33,975 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:33,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1032745037, now seen corresponding path program 19 times [2025-03-08 17:32:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707703393] [2025-03-08 17:32:33,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:32:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:33,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:32:33,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:33,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:33,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707703393] [2025-03-08 17:32:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707703393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130679275] [2025-03-08 17:32:34,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:32:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:34,294 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:32:34,295 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:32:34,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 17:32:34,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:34,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:32:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:34,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 17:32:34,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:34,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:32:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:34,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:32:35,236 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:32:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130679275] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:32:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12, 16] total 35 [2025-03-08 17:32:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547181670] [2025-03-08 17:32:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:32:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:35,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:32:35,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 17:32:35,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:35,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 414 transitions, 5004 flow. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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:32:35,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:35,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:35,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:39,061 INFO L124 PetriNetUnfolderBase]: 11242/17742 cut-off events. [2025-03-08 17:32:39,061 INFO L125 PetriNetUnfolderBase]: For 131984/131984 co-relation queries the response was YES. [2025-03-08 17:32:39,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92445 conditions, 17742 events. 11242/17742 cut-off events. For 131984/131984 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 115315 event pairs, 2651 based on Foata normal form. 2/17738 useless extension candidates. Maximal degree in co-relation 92015. Up to 13797 conditions per place. [2025-03-08 17:32:39,204 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 391 selfloop transitions, 78 changer transitions 62/534 dead transitions. [2025-03-08 17:32:39,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 534 transitions, 6589 flow [2025-03-08 17:32:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:32:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 17:32:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 304 transitions. [2025-03-08 17:32:39,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2814814814814815 [2025-03-08 17:32:39,206 INFO L175 Difference]: Start difference. First operand has 378 places, 414 transitions, 5004 flow. Second operand 18 states and 304 transitions. [2025-03-08 17:32:39,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 534 transitions, 6589 flow [2025-03-08 17:32:39,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 534 transitions, 6403 flow, removed 29 selfloop flow, removed 14 redundant places. [2025-03-08 17:32:40,004 INFO L231 Difference]: Finished difference. Result has 376 places, 401 transitions, 4838 flow [2025-03-08 17:32:40,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4830, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4838, PETRI_PLACES=376, PETRI_TRANSITIONS=401} [2025-03-08 17:32:40,005 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 311 predicate places. [2025-03-08 17:32:40,005 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 401 transitions, 4838 flow [2025-03-08 17:32:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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:32:40,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:40,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:32:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:40,210 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 383037931, now seen corresponding path program 20 times [2025-03-08 17:32:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614616168] [2025-03-08 17:32:40,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:32:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:40,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:40,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:32:40,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:32:40,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:40,346 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:32:40,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:40,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614616168] [2025-03-08 17:32:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614616168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:40,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176845977] [2025-03-08 17:32:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:40,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:40,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:40,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:40,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 401 transitions, 4838 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:40,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:40,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:40,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:43,411 INFO L124 PetriNetUnfolderBase]: 11087/17507 cut-off events. [2025-03-08 17:32:43,412 INFO L125 PetriNetUnfolderBase]: For 129253/129253 co-relation queries the response was YES. [2025-03-08 17:32:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91133 conditions, 17507 events. 11087/17507 cut-off events. For 129253/129253 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 113308 event pairs, 2658 based on Foata normal form. 2/17503 useless extension candidates. Maximal degree in co-relation 90556. Up to 13604 conditions per place. [2025-03-08 17:32:43,551 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 400 selfloop transitions, 84 changer transitions 48/535 dead transitions. [2025-03-08 17:32:43,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 535 transitions, 6545 flow [2025-03-08 17:32:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 17:32:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 17:32:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 336 transitions. [2025-03-08 17:32:43,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2025-03-08 17:32:43,552 INFO L175 Difference]: Start difference. First operand has 376 places, 401 transitions, 4838 flow. Second operand 21 states and 336 transitions. [2025-03-08 17:32:43,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 535 transitions, 6545 flow [2025-03-08 17:32:44,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 535 transitions, 6327 flow, removed 15 selfloop flow, removed 18 redundant places. [2025-03-08 17:32:44,345 INFO L231 Difference]: Finished difference. Result has 377 places, 397 transitions, 4811 flow [2025-03-08 17:32:44,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4634, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4811, PETRI_PLACES=377, PETRI_TRANSITIONS=397} [2025-03-08 17:32:44,346 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 312 predicate places. [2025-03-08 17:32:44,346 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 397 transitions, 4811 flow [2025-03-08 17:32:44,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:44,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:44,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:44,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:32:44,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:44,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash -677740159, now seen corresponding path program 21 times [2025-03-08 17:32:44,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:44,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980544343] [2025-03-08 17:32:44,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:32:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:44,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:44,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 56 statements. [2025-03-08 17:32:44,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:32:44,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:44,478 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:32:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980544343] [2025-03-08 17:32:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980544343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475304837] [2025-03-08 17:32:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:44,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:44,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:44,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 397 transitions, 4811 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:44,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:44,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:44,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:47,789 INFO L124 PetriNetUnfolderBase]: 11153/17614 cut-off events. [2025-03-08 17:32:47,789 INFO L125 PetriNetUnfolderBase]: For 137349/137349 co-relation queries the response was YES. [2025-03-08 17:32:47,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92011 conditions, 17614 events. 11153/17614 cut-off events. For 137349/137349 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 114386 event pairs, 2642 based on Foata normal form. 2/17610 useless extension candidates. Maximal degree in co-relation 91433. Up to 13429 conditions per place. [2025-03-08 17:32:47,930 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 408 selfloop transitions, 95 changer transitions 51/557 dead transitions. [2025-03-08 17:32:47,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 557 transitions, 6774 flow [2025-03-08 17:32:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 17:32:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 17:32:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 381 transitions. [2025-03-08 17:32:47,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.254 [2025-03-08 17:32:47,932 INFO L175 Difference]: Start difference. First operand has 377 places, 397 transitions, 4811 flow. Second operand 25 states and 381 transitions. [2025-03-08 17:32:47,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 557 transitions, 6774 flow [2025-03-08 17:32:48,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 557 transitions, 6549 flow, removed 49 selfloop flow, removed 16 redundant places. [2025-03-08 17:32:48,657 INFO L231 Difference]: Finished difference. Result has 384 places, 402 transitions, 4937 flow [2025-03-08 17:32:48,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4600, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4937, PETRI_PLACES=384, PETRI_TRANSITIONS=402} [2025-03-08 17:32:48,658 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 319 predicate places. [2025-03-08 17:32:48,658 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 402 transitions, 4937 flow [2025-03-08 17:32:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:48,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:48,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 17:32:48,659 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -646734553, now seen corresponding path program 22 times [2025-03-08 17:32:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168825647] [2025-03-08 17:32:48,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:32:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:48,666 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:48,669 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 47 of 56 statements. [2025-03-08 17:32:48,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:32:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:48,763 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:32:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168825647] [2025-03-08 17:32:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168825647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:32:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:32:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 17:32:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846963980] [2025-03-08 17:32:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:32:48,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:32:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:32:48,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:32:48,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:32:48,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-03-08 17:32:48,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 402 transitions, 4937 flow. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:48,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:32:48,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-03-08 17:32:48,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:32:51,661 INFO L124 PetriNetUnfolderBase]: 11067/17477 cut-off events. [2025-03-08 17:32:51,661 INFO L125 PetriNetUnfolderBase]: For 142323/142323 co-relation queries the response was YES. [2025-03-08 17:32:51,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92402 conditions, 17477 events. 11067/17477 cut-off events. For 142323/142323 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 113435 event pairs, 2182 based on Foata normal form. 2/17473 useless extension candidates. Maximal degree in co-relation 91822. Up to 11961 conditions per place. [2025-03-08 17:32:51,829 INFO L140 encePairwiseOnDemand]: 42/60 looper letters, 404 selfloop transitions, 112 changer transitions 55/574 dead transitions. [2025-03-08 17:32:51,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 574 transitions, 6960 flow [2025-03-08 17:32:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 17:32:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-08 17:32:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 399 transitions. [2025-03-08 17:32:51,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27708333333333335 [2025-03-08 17:32:51,831 INFO L175 Difference]: Start difference. First operand has 384 places, 402 transitions, 4937 flow. Second operand 24 states and 399 transitions. [2025-03-08 17:32:51,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 574 transitions, 6960 flow [2025-03-08 17:32:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 574 transitions, 6714 flow, removed 55 selfloop flow, removed 17 redundant places. [2025-03-08 17:32:52,760 INFO L231 Difference]: Finished difference. Result has 391 places, 396 transitions, 4941 flow [2025-03-08 17:32:52,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4706, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4941, PETRI_PLACES=391, PETRI_TRANSITIONS=396} [2025-03-08 17:32:52,761 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 326 predicate places. [2025-03-08 17:32:52,761 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 396 transitions, 4941 flow [2025-03-08 17:32:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 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:32:52,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:32:52,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:32:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 17:32:52,762 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:32:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:32:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 79949527, now seen corresponding path program 23 times [2025-03-08 17:32:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:32:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105640629] [2025-03-08 17:32:52,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:32:52,767 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:52,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:52,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:52,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:53,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:32:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105640629] [2025-03-08 17:32:53,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105640629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:32:53,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355321204] [2025-03-08 17:32:53,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:32:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:32:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:32:53,148 INFO L229 MonitoredProcess]: Starting monitored process 7 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:32:53,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:32:53,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 17:32:53,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 17:32:53,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:32:53,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:32:53,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 17:32:53,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:32:53,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-08 17:32:53,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 17:32:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:32:53,395 INFO L312 TraceCheckSpWp]: Computing backward predicates...