./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-5.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/unroll-cond-5.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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:53:09,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:53:09,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:53:09,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:53:09,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:53:09,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:53:09,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:53:09,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:53:09,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:53:09,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:53:09,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:53:09,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:53:09,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:53:09,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:53:09,173 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:53:09,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:53:09,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:53:09,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:53:09,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:53:09,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:53:09,176 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2025-03-13 21:53:09,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:53:09,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:53:09,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:53:09,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:53:09,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:53:09,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-13 21:53:10,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76641c988/4dc2d971897e447e80362229ba6efc5f/FLAGd6d96121d [2025-03-13 21:53:10,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:53:10,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-5.wvr.c [2025-03-13 21:53:10,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76641c988/4dc2d971897e447e80362229ba6efc5f/FLAGd6d96121d [2025-03-13 21:53:10,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76641c988/4dc2d971897e447e80362229ba6efc5f [2025-03-13 21:53:10,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:53:10,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:53:10,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:53:10,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:53:10,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:53:10,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ef1198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10, skipping insertion in model container [2025-03-13 21:53:10,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:53:10,873 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/unroll-cond-5.wvr.c[3001,3014] [2025-03-13 21:53:10,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:53:10,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:53:10,912 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/unroll-cond-5.wvr.c[3001,3014] [2025-03-13 21:53:10,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:53:10,930 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:53:10,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10 WrapperNode [2025-03-13 21:53:10,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:53:10,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:53:10,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:53:10,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:53:10,936 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:53:10" (1/1) ... [2025-03-13 21:53:10,944 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:53:10" (1/1) ... [2025-03-13 21:53:10,963 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 188 [2025-03-13 21:53:10,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:53:10,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:53:10,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:53:10,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:53:10,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,994 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-13 21:53:10,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:10,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:53:11,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:53:11,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:53:11,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:53:11,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (1/1) ... [2025-03-13 21:53:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:53:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:11,028 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:53:11,030 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:53:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:53:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:53:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:53:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:53:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:53:11,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:53:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:53:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:53:11,050 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:53:11,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:53:11,133 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:53:11,380 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:53:11,381 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:53:11,381 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:53:11,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:53:11,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:53:11 BoogieIcfgContainer [2025-03-13 21:53:11,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:53:11,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:53:11,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:53:11,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:53:11,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:53:10" (1/3) ... [2025-03-13 21:53:11,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a6e239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:53:11, skipping insertion in model container [2025-03-13 21:53:11,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:53:10" (2/3) ... [2025-03-13 21:53:11,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a6e239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:53:11, skipping insertion in model container [2025-03-13 21:53:11,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:53:11" (3/3) ... [2025-03-13 21:53:11,656 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2025-03-13 21:53:11,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:53:11,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-5.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:53:11,668 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:53:11,720 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:53:11,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-13 21:53:11,763 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-13 21:53:11,765 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:53:11,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-13 21:53:11,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-13 21:53:11,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-13 21:53:11,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:53:11,788 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;@f9a39d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:53:11,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:53:11,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:53:11,799 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-13 21:53:11,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:53:11,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:11,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:11,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash -669387975, now seen corresponding path program 1 times [2025-03-13 21:53:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376572177] [2025-03-13 21:53:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:53:11,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:53:11,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:12,108 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:53:12,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376572177] [2025-03-13 21:53:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376572177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:53:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83190929] [2025-03-13 21:53:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:53:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:12,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:53:12,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:53:12,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:12,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:53:12,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:12,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:12,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:12,869 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-03-13 21:53:12,869 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 21:53:12,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-03-13 21:53:12,873 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-03-13 21:53:12,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-03-13 21:53:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:53:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:53:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-13 21:53:12,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-13 21:53:12,884 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-03-13 21:53:12,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-03-13 21:53:12,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:12,890 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-03-13 21:53:12,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-03-13 21:53:12,894 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-13 21:53:12,894 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-03-13 21:53:12,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:53:12,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:12,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:12,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:53:12,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1618550358, now seen corresponding path program 1 times [2025-03-13 21:53:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242283893] [2025-03-13 21:53:12,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:12,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:53:12,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:53:12,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:12,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:13,151 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:53:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242283893] [2025-03-13 21:53:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242283893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088729805] [2025-03-13 21:53:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:13,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:13,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:13,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:13,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:13,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:13,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:13,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:14,453 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-03-13 21:53:14,453 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:53:14,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 321 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-03-13 21:53:14,454 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-03-13 21:53:14,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-03-13 21:53:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-13 21:53:14,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:53:14,457 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-03-13 21:53:14,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-03-13 21:53:14,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:14,458 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-03-13 21:53:14,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-13 21:53:14,459 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-13 21:53:14,459 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-03-13 21:53:14,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:14,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:14,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:14,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:53:14,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1231893450, now seen corresponding path program 2 times [2025-03-13 21:53:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818929080] [2025-03-13 21:53:14,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:14,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:53:14,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:53:14,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:53:14,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:14,680 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:53:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818929080] [2025-03-13 21:53:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818929080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556220176] [2025-03-13 21:53:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:14,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:14,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:14,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:14,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:14,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:14,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:14,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:14,877 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2025-03-13 21:53:14,877 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-13 21:53:14,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 588 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2025-03-13 21:53:14,880 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-03-13 21:53:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2025-03-13 21:53:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-13 21:53:14,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-13 21:53:14,882 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2025-03-13 21:53:14,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2025-03-13 21:53:14,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:14,885 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2025-03-13 21:53:14,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-03-13 21:53:14,886 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-03-13 21:53:14,886 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2025-03-13 21:53:14,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:14,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:14,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:14,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:53:14,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:14,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash 831937644, now seen corresponding path program 3 times [2025-03-13 21:53:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570213017] [2025-03-13 21:53:14,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:14,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:53:14,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:53:14,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:53:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:15,040 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:53:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570213017] [2025-03-13 21:53:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570213017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:15,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131424293] [2025-03-13 21:53:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:15,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:15,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:15,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:15,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:15,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:15,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:15,235 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2025-03-13 21:53:15,237 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-03-13 21:53:15,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 646 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2025-03-13 21:53:15,239 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-03-13 21:53:15,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2025-03-13 21:53:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-13 21:53:15,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:53:15,242 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2025-03-13 21:53:15,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2025-03-13 21:53:15,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:15,246 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2025-03-13 21:53:15,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-13 21:53:15,247 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-03-13 21:53:15,247 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2025-03-13 21:53:15,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:15,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:15,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:15,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:53:15,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:15,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2008245736, now seen corresponding path program 4 times [2025-03-13 21:53:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244158612] [2025-03-13 21:53:15,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:15,258 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:53:15,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:53:15,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:15,425 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:53:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244158612] [2025-03-13 21:53:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244158612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212986661] [2025-03-13 21:53:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:15,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:15,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:15,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:15,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:15,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:15,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:15,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:15,662 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2025-03-13 21:53:15,663 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2025-03-13 21:53:15,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 638 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2025-03-13 21:53:15,665 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2025-03-13 21:53:15,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2025-03-13 21:53:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-13 21:53:15,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-13 21:53:15,669 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2025-03-13 21:53:15,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2025-03-13 21:53:15,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:15,674 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2025-03-13 21:53:15,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-13 21:53:15,677 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2025-03-13 21:53:15,677 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2025-03-13 21:53:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:15,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:15,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:15,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:53:15,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:15,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 908798424, now seen corresponding path program 5 times [2025-03-13 21:53:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137645953] [2025-03-13 21:53:15,678 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:15,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:53:15,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:53:15,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:15,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:15,811 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:53:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137645953] [2025-03-13 21:53:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137645953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237605179] [2025-03-13 21:53:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:15,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:15,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:15,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:15,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:15,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:15,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:15,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:15,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:20,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-13 21:53:20,359 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2025-03-13 21:53:20,360 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-03-13 21:53:20,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 658 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2025-03-13 21:53:20,363 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2025-03-13 21:53:20,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2025-03-13 21:53:20,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-03-13 21:53:20,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-13 21:53:20,365 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2025-03-13 21:53:20,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2025-03-13 21:53:20,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-13 21:53:20,371 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2025-03-13 21:53:20,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-13 21:53:20,372 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2025-03-13 21:53:20,373 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2025-03-13 21:53:20,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:20,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:20,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:53:20,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2091362626, now seen corresponding path program 6 times [2025-03-13 21:53:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686044556] [2025-03-13 21:53:20,374 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:53:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:20,386 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:53:20,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:53:20,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:53:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:20,534 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:53:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686044556] [2025-03-13 21:53:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686044556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:53:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:53:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:53:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306571282] [2025-03-13 21:53:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:20,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:20,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:53:20,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:20,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:20,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:20,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:20,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:20,668 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-03-13 21:53:20,669 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2025-03-13 21:53:20,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 616 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2025-03-13 21:53:20,671 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2025-03-13 21:53:20,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2025-03-13 21:53:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-13 21:53:20,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-13 21:53:20,673 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2025-03-13 21:53:20,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2025-03-13 21:53:20,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:53:20,675 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2025-03-13 21:53:20,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-13 21:53:20,677 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-03-13 21:53:20,678 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2025-03-13 21:53:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:53:20,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:20,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:53:20,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1113778678, now seen corresponding path program 1 times [2025-03-13 21:53:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994761231] [2025-03-13 21:53:20,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:20,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:53:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:53:20,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:20,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:53:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994761231] [2025-03-13 21:53:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994761231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759200834] [2025-03-13 21:53:20,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:20,863 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-13 21:53:20,864 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-13 21:53:20,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:53:20,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:53:20,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:20,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:20,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-13 21:53:20,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:21,022 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-13 21:53:24,994 INFO L349 Elim1Store]: treesize reduction 39, result has 20.4 percent of original size [2025-03-13 21:53:24,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 224 [2025-03-13 21:53:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:43,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:54:03,039 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-13 21:54:25,491 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-13 21:54:33,500 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-13 21:54:50,853 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)