./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/popl20-min-max-dec.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 47814a6c2066a31334f0b50a42e69cfeb567d5dd7f02dc6c703588c90e067366 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:47:29,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:47:29,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:47:29,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:47:29,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:47:29,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:47:29,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:47:29,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:47:29,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:47:29,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:47:29,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:47:29,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:47:29,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:47:29,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:47:29,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:47:29,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:47:29,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:47:29,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:47:29,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:47:29,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:47:29,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:47:29,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:47:29,454 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 -> 47814a6c2066a31334f0b50a42e69cfeb567d5dd7f02dc6c703588c90e067366 [2025-03-13 21:47:29,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:47:29,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:47:29,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:47:29,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:47:29,680 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:47:29,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2025-03-13 21:47:30,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ee7c23e/c99227d0927a445cbd262fe0567e4c26/FLAGbe75684d5 [2025-03-13 21:47:30,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:47:30,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-min-max-dec.wvr.c [2025-03-13 21:47:31,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ee7c23e/c99227d0927a445cbd262fe0567e4c26/FLAGbe75684d5 [2025-03-13 21:47:31,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ee7c23e/c99227d0927a445cbd262fe0567e4c26 [2025-03-13 21:47:31,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:47:31,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:47:31,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:47:31,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:47:31,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:47:31,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31, skipping insertion in model container [2025-03-13 21:47:31,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:47:31,148 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/popl20-min-max-dec.wvr.c[2683,2696] [2025-03-13 21:47:31,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:47:31,158 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:47:31,171 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/popl20-min-max-dec.wvr.c[2683,2696] [2025-03-13 21:47:31,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:47:31,185 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:47:31,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31 WrapperNode [2025-03-13 21:47:31,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:47:31,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:47:31,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:47:31,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:47:31,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,207 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-03-13 21:47:31,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:47:31,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:47:31,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:47:31,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:47:31,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,231 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:47:31,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:47:31,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:47:31,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:47:31,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:47:31,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (1/1) ... [2025-03-13 21:47:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:47:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:47:31,272 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-13 21:47:31,274 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-13 21:47:31,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:47:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:47:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:47:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:47:31,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:47:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:47:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:47:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:47:31,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:47:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:47:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:47:31,291 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:47:31,358 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:47:31,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:47:31,553 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:47:31,554 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:47:31,554 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:47:31,675 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:47:31,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:47:31 BoogieIcfgContainer [2025-03-13 21:47:31,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:47:31,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:47:31,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:47:31,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:47:31,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:47:31" (1/3) ... [2025-03-13 21:47:31,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de42765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:47:31, skipping insertion in model container [2025-03-13 21:47:31,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:47:31" (2/3) ... [2025-03-13 21:47:31,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de42765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:47:31, skipping insertion in model container [2025-03-13 21:47:31,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:47:31" (3/3) ... [2025-03-13 21:47:31,683 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2025-03-13 21:47:31,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:47:31,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-dec.wvr.c that has 5 procedures, 57 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:47:31,694 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:47:31,746 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:47:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 152 flow [2025-03-13 21:47:31,809 INFO L124 PetriNetUnfolderBase]: 6/58 cut-off events. [2025-03-13 21:47:31,812 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:47:31,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 6/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2025-03-13 21:47:31,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 62 transitions, 152 flow [2025-03-13 21:47:31,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 57 transitions, 138 flow [2025-03-13 21:47:31,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:47:31,836 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;@4cd94803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:47:31,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:47:31,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:47:31,869 INFO L124 PetriNetUnfolderBase]: 6/56 cut-off events. [2025-03-13 21:47:31,869 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:47:31,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:31,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:31,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:31,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 485313208, now seen corresponding path program 1 times [2025-03-13 21:47:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806025963] [2025-03-13 21:47:31,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:47:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:47:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:32,217 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-13 21:47:32,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806025963] [2025-03-13 21:47:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806025963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-03-13 21:47:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:32,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:32,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:32,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:32,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-13 21:47:32,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-13 21:47:32,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:32,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-13 21:47:32,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:34,709 INFO L124 PetriNetUnfolderBase]: 29126/39672 cut-off events. [2025-03-13 21:47:34,709 INFO L125 PetriNetUnfolderBase]: For 1832/1832 co-relation queries the response was YES. [2025-03-13 21:47:34,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78941 conditions, 39672 events. 29126/39672 cut-off events. For 1832/1832 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 240807 event pairs, 13149 based on Foata normal form. 850/39762 useless extension candidates. Maximal degree in co-relation 75425. Up to 21730 conditions per place. [2025-03-13 21:47:34,932 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 68 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-13 21:47:34,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 345 flow [2025-03-13 21:47:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-03-13 21:47:34,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2025-03-13 21:47:34,946 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 138 flow. Second operand 4 states and 144 transitions. [2025-03-13 21:47:34,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 345 flow [2025-03-13 21:47:34,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:47:34,993 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 136 flow [2025-03-13 21:47:34,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-03-13 21:47:34,997 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -4 predicate places. [2025-03-13 21:47:34,999 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 136 flow [2025-03-13 21:47:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-13 21:47:35,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:35,000 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] [2025-03-13 21:47:35,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:47:35,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:35,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1481624911, now seen corresponding path program 1 times [2025-03-13 21:47:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:35,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-13 21:47:35,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:35,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:47:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:47:35,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:35,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:35,147 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-13 21:47:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823208937] [2025-03-13 21:47:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823208937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:35,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296355664] [2025-03-13 21:47:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:35,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:35,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:35,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:35,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2025-03-13 21:47:35,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-13 21:47:35,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:35,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2025-03-13 21:47:35,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:37,634 INFO L124 PetriNetUnfolderBase]: 35839/52361 cut-off events. [2025-03-13 21:47:37,634 INFO L125 PetriNetUnfolderBase]: For 4866/4866 co-relation queries the response was YES. [2025-03-13 21:47:37,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104292 conditions, 52361 events. 35839/52361 cut-off events. For 4866/4866 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 367266 event pairs, 20230 based on Foata normal form. 920/50704 useless extension candidates. Maximal degree in co-relation 23141. Up to 32645 conditions per place. [2025-03-13 21:47:37,826 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 71 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2025-03-13 21:47:37,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 355 flow [2025-03-13 21:47:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-03-13 21:47:37,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685483870967742 [2025-03-13 21:47:37,832 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 136 flow. Second operand 4 states and 141 transitions. [2025-03-13 21:47:37,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 355 flow [2025-03-13 21:47:37,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:47:37,840 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 146 flow [2025-03-13 21:47:37,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-13 21:47:37,841 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2025-03-13 21:47:37,841 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 146 flow [2025-03-13 21:47:37,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-13 21:47:37,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:37,842 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] [2025-03-13 21:47:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:47:37,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 531588830, now seen corresponding path program 1 times [2025-03-13 21:47:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651929650] [2025-03-13 21:47:37,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:37,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:47:37,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:47:37,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:37,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:37,973 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-13 21:47:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651929650] [2025-03-13 21:47:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651929650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182036738] [2025-03-13 21:47:37,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:37,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:37,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:37,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:37,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2025-03-13 21:47:37,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-13 21:47:37,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:37,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2025-03-13 21:47:37,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:40,812 INFO L124 PetriNetUnfolderBase]: 47955/69413 cut-off events. [2025-03-13 21:47:40,813 INFO L125 PetriNetUnfolderBase]: For 8100/9217 co-relation queries the response was YES. [2025-03-13 21:47:40,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145421 conditions, 69413 events. 47955/69413 cut-off events. For 8100/9217 co-relation queries the response was YES. Maximal size of possible extension queue 1640. Compared 484975 event pairs, 27914 based on Foata normal form. 2381/68485 useless extension candidates. Maximal degree in co-relation 41637. Up to 43877 conditions per place. [2025-03-13 21:47:41,024 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 72 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-03-13 21:47:41,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 372 flow [2025-03-13 21:47:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-03-13 21:47:41,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2025-03-13 21:47:41,025 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 146 flow. Second operand 4 states and 140 transitions. [2025-03-13 21:47:41,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 372 flow [2025-03-13 21:47:41,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:47:41,030 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 156 flow [2025-03-13 21:47:41,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-03-13 21:47:41,031 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2025-03-13 21:47:41,031 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 156 flow [2025-03-13 21:47:41,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-13 21:47:41,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:41,031 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] [2025-03-13 21:47:41,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:47:41,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:41,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1513810455, now seen corresponding path program 1 times [2025-03-13 21:47:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522976143] [2025-03-13 21:47:41,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:41,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 21:47:41,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 21:47:41,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:41,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:41,141 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-13 21:47:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522976143] [2025-03-13 21:47:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522976143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:41,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:47:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476091697] [2025-03-13 21:47:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:41,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:47:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:47:41,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:47:41,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-13 21:47:41,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-13 21:47:41,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:41,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-13 21:47:41,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:43,504 INFO L124 PetriNetUnfolderBase]: 44415/64010 cut-off events. [2025-03-13 21:47:43,504 INFO L125 PetriNetUnfolderBase]: For 10520/12666 co-relation queries the response was YES. [2025-03-13 21:47:43,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137988 conditions, 64010 events. 44415/64010 cut-off events. For 10520/12666 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 440389 event pairs, 36184 based on Foata normal form. 2146/62778 useless extension candidates. Maximal degree in co-relation 44425. Up to 57138 conditions per place. [2025-03-13 21:47:43,722 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 45 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-03-13 21:47:43,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 252 flow [2025-03-13 21:47:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:47:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:47:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-13 21:47:43,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2025-03-13 21:47:43,723 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 156 flow. Second operand 3 states and 99 transitions. [2025-03-13 21:47:43,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 252 flow [2025-03-13 21:47:43,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:47:43,731 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 164 flow [2025-03-13 21:47:43,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-03-13 21:47:43,731 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-03-13 21:47:43,731 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 164 flow [2025-03-13 21:47:43,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-13 21:47:43,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:43,731 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] [2025-03-13 21:47:43,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:47:43,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 45004916, now seen corresponding path program 1 times [2025-03-13 21:47:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708557044] [2025-03-13 21:47:43,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 21:47:43,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:47:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:43,994 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-13 21:47:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708557044] [2025-03-13 21:47:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708557044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:43,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:47:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667818216] [2025-03-13 21:47:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:47:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:43,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:47:43,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:47:44,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-13 21:47:44,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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-13 21:47:44,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:44,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-13 21:47:44,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:55,334 INFO L124 PetriNetUnfolderBase]: 167152/243863 cut-off events. [2025-03-13 21:47:55,334 INFO L125 PetriNetUnfolderBase]: For 40854/45719 co-relation queries the response was YES. [2025-03-13 21:47:55,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513312 conditions, 243863 events. 167152/243863 cut-off events. For 40854/45719 co-relation queries the response was YES. Maximal size of possible extension queue 5555. Compared 1974781 event pairs, 20327 based on Foata normal form. 4869/238823 useless extension candidates. Maximal degree in co-relation 513294. Up to 66444 conditions per place. [2025-03-13 21:47:56,217 INFO L140 encePairwiseOnDemand]: 49/62 looper letters, 402 selfloop transitions, 88 changer transitions 396/898 dead transitions. [2025-03-13 21:47:56,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 898 transitions, 4185 flow [2025-03-13 21:47:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-13 21:47:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-13 21:47:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1595 transitions. [2025-03-13 21:47:56,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5250164581961817 [2025-03-13 21:47:56,221 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 164 flow. Second operand 49 states and 1595 transitions. [2025-03-13 21:47:56,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 898 transitions, 4185 flow [2025-03-13 21:47:57,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 898 transitions, 4181 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:47:57,074 INFO L231 Difference]: Finished difference. Result has 147 places, 157 transitions, 808 flow [2025-03-13 21:47:57,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=808, PETRI_PLACES=147, PETRI_TRANSITIONS=157} [2025-03-13 21:47:57,075 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 83 predicate places. [2025-03-13 21:47:57,075 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 157 transitions, 808 flow [2025-03-13 21:47:57,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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-13 21:47:57,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:57,075 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] [2025-03-13 21:47:57,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:47:57,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:47:57,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1329634288, now seen corresponding path program 2 times [2025-03-13 21:47:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-03-13 21:47:57,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:47:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:57,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-13 21:47:57,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 53 statements. [2025-03-13 21:47:57,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:47:57,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:57,537 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-13 21:47:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-03-13 21:47:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156395231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 21:47:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571360977] [2025-03-13 21:47:57,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:57,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:47:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:57,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:47:57,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:47:57,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-03-13 21:47:57,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 157 transitions, 808 flow. Second operand has 13 states, 13 states have (on average 19.307692307692307) internal successors, (251), 13 states have internal predecessors, (251), 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-13 21:47:57,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:57,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-03-13 21:47:57,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand