./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:20:28,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:20:28,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:20:28,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:20:28,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:20:28,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:20:28,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:20:28,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:20:28,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:20:28,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:20:28,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:20:28,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:20:28,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:20:28,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:20:28,870 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:20:28,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:20:28,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:20:28,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:20:28,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:28,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:20:28,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:20:28,873 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-03-04 02:20:29,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:20:29,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:20:29,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:20:29,079 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:20:29,079 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:20:29,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-04 02:20:30,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dd280f4/de28a8348c274f7dbedb53c29bc48a12/FLAG26c6bacba [2025-03-04 02:20:30,423 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:20:30,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-03-04 02:20:30,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dd280f4/de28a8348c274f7dbedb53c29bc48a12/FLAG26c6bacba [2025-03-04 02:20:30,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dd280f4/de28a8348c274f7dbedb53c29bc48a12 [2025-03-04 02:20:30,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:20:30,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:20:30,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:30,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:20:30,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:20:30,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30, skipping insertion in model container [2025-03-04 02:20:30,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:20:30,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[3418,3431] [2025-03-04 02:20:30,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:30,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:20:30,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c[3418,3431] [2025-03-04 02:20:30,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:20:30,656 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:20:30,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30 WrapperNode [2025-03-04 02:20:30,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:20:30,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:30,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:20:30,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:20:30,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,693 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 210 [2025-03-04 02:20:30,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:20:30,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:20:30,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:20:30,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:20:30,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,715 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:20:30,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:20:30,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:20:30,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:20:30,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:20:30,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (1/1) ... [2025-03-04 02:20:30,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:20:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:30,760 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-04 02:20:30,769 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-04 02:20:30,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:20:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:20:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:20:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:20:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:20:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:20:30,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:20:30,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:20:30,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-04 02:20:30,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-04 02:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-04 02:20:30,792 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-04 02:20:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:20:30,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:20:30,794 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:20:30,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:20:30,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:20:31,116 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:20:31,117 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:20:31,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:20:31,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:20:31,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:31 BoogieIcfgContainer [2025-03-04 02:20:31,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:20:31,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:20:31,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:20:31,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:20:31,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:20:30" (1/3) ... [2025-03-04 02:20:31,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d0fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:31, skipping insertion in model container [2025-03-04 02:20:31,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:20:30" (2/3) ... [2025-03-04 02:20:31,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d0fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:20:31, skipping insertion in model container [2025-03-04 02:20:31,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:20:31" (3/3) ... [2025-03-04 02:20:31,318 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-03-04 02:20:31,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:20:31,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 73 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:20:31,337 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:20:31,421 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-04 02:20:31,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 82 transitions, 230 flow [2025-03-04 02:20:31,509 INFO L124 PetriNetUnfolderBase]: 4/70 cut-off events. [2025-03-04 02:20:31,512 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:20:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 70 events. 4/70 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-04 02:20:31,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 82 transitions, 230 flow [2025-03-04 02:20:31,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 69 transitions, 186 flow [2025-03-04 02:20:31,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:20:31,538 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;@12b66455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:20:31,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 02:20:31,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:20:31,567 INFO L124 PetriNetUnfolderBase]: 4/68 cut-off events. [2025-03-04 02:20:31,567 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:20:31,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:31,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:31,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:20:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -279960230, now seen corresponding path program 1 times [2025-03-04 02:20:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136584554] [2025-03-04 02:20:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:20:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:20:31,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:31,917 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-04 02:20:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136584554] [2025-03-04 02:20:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136584554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798168324] [2025-03-04 02:20:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:31,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:31,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:31,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:31,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:20:31,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:31,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:31,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:20:31,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:37,507 INFO L124 PetriNetUnfolderBase]: 90013/113964 cut-off events. [2025-03-04 02:20:37,507 INFO L125 PetriNetUnfolderBase]: For 7355/7355 co-relation queries the response was YES. [2025-03-04 02:20:37,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239389 conditions, 113964 events. 90013/113964 cut-off events. For 7355/7355 co-relation queries the response was YES. Maximal size of possible extension queue 1739. Compared 564349 event pairs, 53048 based on Foata normal form. 1984/113164 useless extension candidates. Maximal degree in co-relation 238400. Up to 76768 conditions per place. [2025-03-04 02:20:38,169 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 93 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-03-04 02:20:38,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 459 flow [2025-03-04 02:20:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-03-04 02:20:38,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2025-03-04 02:20:38,183 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 186 flow. Second operand 3 states and 119 transitions. [2025-03-04 02:20:38,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 459 flow [2025-03-04 02:20:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 413 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:38,408 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 168 flow [2025-03-04 02:20:38,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-04 02:20:38,413 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-04 02:20:38,414 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 168 flow [2025-03-04 02:20:38,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:38,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:38,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:38,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:20:38,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:20:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash -744397046, now seen corresponding path program 2 times [2025-03-04 02:20:38,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:38,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775744234] [2025-03-04 02:20:38,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:38,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:38,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:20:38,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:20:38,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:38,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:38,540 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-04 02:20:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:38,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775744234] [2025-03-04 02:20:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775744234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:38,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:38,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421961733] [2025-03-04 02:20:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:38,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:38,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:38,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:20:38,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:38,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:38,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:20:38,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,360 INFO L124 PetriNetUnfolderBase]: 68959/87699 cut-off events. [2025-03-04 02:20:42,361 INFO L125 PetriNetUnfolderBase]: For 4094/4094 co-relation queries the response was YES. [2025-03-04 02:20:42,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182286 conditions, 87699 events. 68959/87699 cut-off events. For 4094/4094 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 420777 event pairs, 40785 based on Foata normal form. 1544/87308 useless extension candidates. Maximal degree in co-relation 80231. Up to 59185 conditions per place. [2025-03-04 02:20:42,719 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 92 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2025-03-04 02:20:42,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 431 flow [2025-03-04 02:20:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-04 02:20:42,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2025-03-04 02:20:42,721 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 168 flow. Second operand 3 states and 118 transitions. [2025-03-04 02:20:42,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 431 flow [2025-03-04 02:20:42,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:42,758 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 174 flow [2025-03-04 02:20:42,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-03-04 02:20:42,758 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2025-03-04 02:20:42,759 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 174 flow [2025-03-04 02:20:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:42,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:42,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:42,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:20:42,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:20:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1264244032, now seen corresponding path program 3 times [2025-03-04 02:20:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-03-04 02:20:42,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:20:42,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:20:42,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:42,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:43,663 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-04 02:20:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-03-04 02:20:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243168097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 02:20:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287757701] [2025-03-04 02:20:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:20:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:20:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:20:43,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:20:43,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 174 flow. Second operand has 20 states, 20 states have (on average 10.2) internal successors, (204), 20 states have internal predecessors, (204), 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-04 02:20:43,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:43,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:20:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:50,652 INFO L124 PetriNetUnfolderBase]: 89726/114031 cut-off events. [2025-03-04 02:20:50,652 INFO L125 PetriNetUnfolderBase]: For 6910/6910 co-relation queries the response was YES. [2025-03-04 02:20:50,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241259 conditions, 114031 events. 89726/114031 cut-off events. For 6910/6910 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 554619 event pairs, 9751 based on Foata normal form. 2/111315 useless extension candidates. Maximal degree in co-relation 107429. Up to 69274 conditions per place. [2025-03-04 02:20:51,108 INFO L140 encePairwiseOnDemand]: 63/86 looper letters, 475 selfloop transitions, 149 changer transitions 40/665 dead transitions. [2025-03-04 02:20:51,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 665 transitions, 2929 flow [2025-03-04 02:20:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 02:20:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 02:20:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 974 transitions. [2025-03-04 02:20:51,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.257399577167019 [2025-03-04 02:20:51,113 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 174 flow. Second operand 44 states and 974 transitions. [2025-03-04 02:20:51,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 665 transitions, 2929 flow [2025-03-04 02:20:51,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 665 transitions, 2879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:51,406 INFO L231 Difference]: Finished difference. Result has 140 places, 217 transitions, 987 flow [2025-03-04 02:20:51,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=987, PETRI_PLACES=140, PETRI_TRANSITIONS=217} [2025-03-04 02:20:51,407 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 56 predicate places. [2025-03-04 02:20:51,407 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 217 transitions, 987 flow [2025-03-04 02:20:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.2) internal successors, (204), 20 states have internal predecessors, (204), 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-04 02:20:51,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:51,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:51,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:20:51,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:20:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 242518636, now seen corresponding path program 4 times [2025-03-04 02:20:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923877729] [2025-03-04 02:20:51,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:51,420 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-04 02:20:51,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:20:51,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:51,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:51,499 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-04 02:20:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923877729] [2025-03-04 02:20:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923877729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:20:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280620688] [2025-03-04 02:20:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:51,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:20:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:20:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:20:51,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:20:51,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 217 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:51,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:51,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:20:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:56,912 INFO L124 PetriNetUnfolderBase]: 72761/92972 cut-off events. [2025-03-04 02:20:56,913 INFO L125 PetriNetUnfolderBase]: For 200575/200575 co-relation queries the response was YES. [2025-03-04 02:20:57,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285704 conditions, 92972 events. 72761/92972 cut-off events. For 200575/200575 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 449476 event pairs, 34524 based on Foata normal form. 1502/91968 useless extension candidates. Maximal degree in co-relation 258454. Up to 60890 conditions per place. [2025-03-04 02:20:57,726 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 285 selfloop transitions, 5 changer transitions 0/291 dead transitions. [2025-03-04 02:20:57,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 291 transitions, 1915 flow [2025-03-04 02:20:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:20:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:20:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-03-04 02:20:57,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-03-04 02:20:57,727 INFO L175 Difference]: Start difference. First operand has 140 places, 217 transitions, 987 flow. Second operand 3 states and 120 transitions. [2025-03-04 02:20:57,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 291 transitions, 1915 flow [2025-03-04 02:20:58,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 291 transitions, 1907 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:58,661 INFO L231 Difference]: Finished difference. Result has 142 places, 216 transitions, 1000 flow [2025-03-04 02:20:58,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1000, PETRI_PLACES=142, PETRI_TRANSITIONS=216} [2025-03-04 02:20:58,662 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 58 predicate places. [2025-03-04 02:20:58,662 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 216 transitions, 1000 flow [2025-03-04 02:20:58,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-04 02:20:58,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:58,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:58,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:20:58,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:20:58,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -936860973, now seen corresponding path program 1 times [2025-03-04 02:20:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407202949] [2025-03-04 02:20:58,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:58,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:20:58,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:20:58,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:58,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:59,244 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-04 02:20:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407202949] [2025-03-04 02:20:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407202949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-04 02:20:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738118594] [2025-03-04 02:20:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:59,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:20:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:59,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:20:59,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:20:59,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:20:59,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 216 transitions, 1000 flow. Second operand has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 22 states have internal predecessors, (218), 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-04 02:20:59,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:59,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:20:59,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:10,236 INFO L124 PetriNetUnfolderBase]: 108758/139567 cut-off events. [2025-03-04 02:21:10,237 INFO L125 PetriNetUnfolderBase]: For 261474/261474 co-relation queries the response was YES. [2025-03-04 02:21:11,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424905 conditions, 139567 events. 108758/139567 cut-off events. For 261474/261474 co-relation queries the response was YES. Maximal size of possible extension queue 2044. Compared 719010 event pairs, 12218 based on Foata normal form. 1/135345 useless extension candidates. Maximal degree in co-relation 397529. Up to 71461 conditions per place. [2025-03-04 02:21:11,453 INFO L140 encePairwiseOnDemand]: 63/86 looper letters, 817 selfloop transitions, 207 changer transitions 32/1057 dead transitions. [2025-03-04 02:21:11,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1057 transitions, 6152 flow [2025-03-04 02:21:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 02:21:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-04 02:21:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 1346 transitions. [2025-03-04 02:21:11,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26085271317829456 [2025-03-04 02:21:11,458 INFO L175 Difference]: Start difference. First operand has 142 places, 216 transitions, 1000 flow. Second operand 60 states and 1346 transitions. [2025-03-04 02:21:11,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1057 transitions, 6152 flow [2025-03-04 02:21:13,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1057 transitions, 6054 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:21:13,236 INFO L231 Difference]: Finished difference. Result has 228 places, 377 transitions, 2583 flow [2025-03-04 02:21:13,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2583, PETRI_PLACES=228, PETRI_TRANSITIONS=377} [2025-03-04 02:21:13,237 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 144 predicate places. [2025-03-04 02:21:13,237 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 377 transitions, 2583 flow [2025-03-04 02:21:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 22 states have internal predecessors, (218), 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-04 02:21:13,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:13,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:21:13,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:21:13,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-04 02:21:13,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -601886031, now seen corresponding path program 2 times [2025-03-04 02:21:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655153040] [2025-03-04 02:21:13,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:21:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:13,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:21:13,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:21:13,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:21:13,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:13,869 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-04 02:21:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655153040] [2025-03-04 02:21:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655153040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:13,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 02:21:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494550475] [2025-03-04 02:21:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:13,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:21:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:13,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:21:13,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:21:13,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 86 [2025-03-04 02:21:13,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 377 transitions, 2583 flow. Second operand has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 21 states have internal predecessors, (211), 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-04 02:21:13,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:13,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 86 [2025-03-04 02:21:13,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand