./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:23:48,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:23:48,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:23:48,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:23:48,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:23:48,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:23:48,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:23:48,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:23:48,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:23:48,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:23:48,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:23:48,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:23:48,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:23:48,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:23:48,222 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:23:48,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:23:48,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:23:48,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:48,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:48,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:48,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:23:48,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:23:48,225 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-jdk21/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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2025-01-09 16:23:48,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:23:48,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:23:48,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:23:48,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:23:48,441 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:23:48,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-01-09 16:23:49,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440a0cf48/c0e37740bbbb4ebd98a7303a809ba486/FLAGf19155a10 [2025-01-09 16:23:49,902 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:23:49,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i [2025-01-09 16:23:49,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440a0cf48/c0e37740bbbb4ebd98a7303a809ba486/FLAGf19155a10 [2025-01-09 16:23:50,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/440a0cf48/c0e37740bbbb4ebd98a7303a809ba486 [2025-01-09 16:23:50,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:23:50,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:23:50,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:50,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:23:50,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:23:50,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54dd45e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50, skipping insertion in model container [2025-01-09 16:23:50,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:23:50,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2025-01-09 16:23:50,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:50,420 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:23:50,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/29_conditionals_vs.i[30422,30435] [2025-01-09 16:23:50,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:50,482 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:23:50,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50 WrapperNode [2025-01-09 16:23:50,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:50,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:50,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:23:50,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:23:50,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,507 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 55 [2025-01-09 16:23:50,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:50,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:23:50,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:23:50,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:23:50,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,520 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-01-09 16:23:50,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:23:50,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:23:50,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:23:50,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:23:50,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (1/1) ... [2025-01-09 16:23:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:50,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:23:50,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:23:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:23:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:23:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:23:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:23:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:23:50,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:23:50,576 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:23:50,670 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:23:50,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:23:50,753 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:23:50,753 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:23:50,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:23:50,862 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:23:50,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:50 BoogieIcfgContainer [2025-01-09 16:23:50,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:23:50,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:23:50,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:23:50,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:23:50,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:50" (1/3) ... [2025-01-09 16:23:50,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14047655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:50, skipping insertion in model container [2025-01-09 16:23:50,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:50" (2/3) ... [2025-01-09 16:23:50,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14047655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:50, skipping insertion in model container [2025-01-09 16:23:50,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:50" (3/3) ... [2025-01-09 16:23:50,869 INFO L128 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2025-01-09 16:23:50,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:23:50,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 29_conditionals_vs.i that has 2 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:23:50,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:23:50,901 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:50,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2025-01-09 16:23:50,935 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-01-09 16:23:50,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:50,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2025-01-09 16:23:50,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2025-01-09 16:23:50,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2025-01-09 16:23:50,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:50,952 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;@73646799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:50,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:23:50,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:50,956 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-09 16:23:50,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:50,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:50,956 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:23:50,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:23:50,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1271966785, now seen corresponding path program 1 times [2025-01-09 16:23:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:50,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492248079] [2025-01-09 16:23:50,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:51,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:23:51,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:23:51,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:51,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:51,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:23:51,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:23:51,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:51,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:51,043 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:51,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:23:51,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:23:51,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:23:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:23:51,045 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:23:51,048 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:51,048 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:23:51,062 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:51,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2025-01-09 16:23:51,070 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-01-09 16:23:51,071 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:23:51,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-01-09 16:23:51,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2025-01-09 16:23:51,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2025-01-09 16:23:51,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:51,073 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;@73646799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:51,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:23:51,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:51,078 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-01-09 16:23:51,078 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:23:51,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:51,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:51,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 238470401, now seen corresponding path program 1 times [2025-01-09 16:23:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124946004] [2025-01-09 16:23:51,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:51,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124946004] [2025-01-09 16:23:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124946004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:51,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:51,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208349218] [2025-01-09 16:23:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:51,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:51,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:51,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:51,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-01-09 16:23:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-09 16:23:51,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:51,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-01-09 16:23:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:51,413 INFO L124 PetriNetUnfolderBase]: 358/702 cut-off events. [2025-01-09 16:23:51,413 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 16:23:51,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 702 events. 358/702 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3524 event pairs, 70 based on Foata normal form. 57/711 useless extension candidates. Maximal degree in co-relation 921. Up to 255 conditions per place. [2025-01-09 16:23:51,419 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-09 16:23:51,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 188 flow [2025-01-09 16:23:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-01-09 16:23:51,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2025-01-09 16:23:51,429 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 76 flow. Second operand 4 states and 85 transitions. [2025-01-09 16:23:51,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 188 flow [2025-01-09 16:23:51,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:51,433 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 74 flow [2025-01-09 16:23:51,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-01-09 16:23:51,437 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-01-09 16:23:51,437 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 74 flow [2025-01-09 16:23:51,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-09 16:23:51,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:51,437 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:23:51,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:23:51,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash -319894279, now seen corresponding path program 1 times [2025-01-09 16:23:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368811170] [2025-01-09 16:23:51,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:51,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:51,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:51,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:51,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:51,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:51,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:51,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:51,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:51,459 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:51,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:23:51,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:23:51,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:23:51,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:23:51,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:23:51,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:23:51,463 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:51,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:23:51,479 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2025-01-09 16:23:51,484 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2025-01-09 16:23:51,484 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:23:51,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-01-09 16:23:51,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2025-01-09 16:23:51,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2025-01-09 16:23:51,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:51,487 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;@73646799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:51,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:23:51,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:51,490 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-01-09 16:23:51,490 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:23:51,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:51,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:51,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 301232125, now seen corresponding path program 1 times [2025-01-09 16:23:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190597953] [2025-01-09 16:23:51,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:51,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:51,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:51,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190597953] [2025-01-09 16:23:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190597953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:51,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:51,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087354295] [2025-01-09 16:23:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:51,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:51,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:51,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:51,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:23:51,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-01-09 16:23:51,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:51,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:23:51,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:52,174 INFO L124 PetriNetUnfolderBase]: 3454/5586 cut-off events. [2025-01-09 16:23:52,174 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-01-09 16:23:52,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 5586 events. 3454/5586 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34773 event pairs, 736 based on Foata normal form. 564/5799 useless extension candidates. Maximal degree in co-relation 4764. Up to 2085 conditions per place. [2025-01-09 16:23:52,198 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-01-09 16:23:52,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 296 flow [2025-01-09 16:23:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-09 16:23:52,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2025-01-09 16:23:52,199 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 112 flow. Second operand 4 states and 134 transitions. [2025-01-09 16:23:52,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 296 flow [2025-01-09 16:23:52,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 290 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:52,201 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 106 flow [2025-01-09 16:23:52,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-01-09 16:23:52,202 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-09 16:23:52,202 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 106 flow [2025-01-09 16:23:52,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-01-09 16:23:52,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:52,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:23:52,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:52,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 301233148, now seen corresponding path program 1 times [2025-01-09 16:23:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137702779] [2025-01-09 16:23:52,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:52,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:52,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:52,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137702779] [2025-01-09 16:23:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137702779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:52,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:52,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441096098] [2025-01-09 16:23:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:52,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:52,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:52,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:52,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-01-09 16:23:52,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-09 16:23:52,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:52,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-01-09 16:23:52,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:52,753 INFO L124 PetriNetUnfolderBase]: 3454/5328 cut-off events. [2025-01-09 16:23:52,754 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2025-01-09 16:23:52,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 5328 events. 3454/5328 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 31009 event pairs, 736 based on Foata normal form. 129/5214 useless extension candidates. Maximal degree in co-relation 8547. Up to 2085 conditions per place. [2025-01-09 16:23:52,777 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 53 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-01-09 16:23:52,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 290 flow [2025-01-09 16:23:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-01-09 16:23:52,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2025-01-09 16:23:52,778 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 106 flow. Second operand 4 states and 120 transitions. [2025-01-09 16:23:52,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 290 flow [2025-01-09 16:23:52,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:52,780 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 101 flow [2025-01-09 16:23:52,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-01-09 16:23:52,783 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2025-01-09 16:23:52,783 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 101 flow [2025-01-09 16:23:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-01-09 16:23:52,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:52,784 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:23:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:23:52,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:52,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 639070176, now seen corresponding path program 1 times [2025-01-09 16:23:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130161535] [2025-01-09 16:23:52,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:52,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:23:52,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:23:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:52,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:52,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:23:52,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:23:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:52,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:52,804 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:23:52,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:23:52,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:23:52,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:23:52,805 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:52,805 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:23:52,834 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:52,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2025-01-09 16:23:52,842 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2025-01-09 16:23:52,842 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:23:52,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2025-01-09 16:23:52,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2025-01-09 16:23:52,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2025-01-09 16:23:52,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:52,846 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;@73646799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:52,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:23:52,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:52,848 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-01-09 16:23:52,848 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:23:52,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:52,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:52,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:52,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -202120985, now seen corresponding path program 1 times [2025-01-09 16:23:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436221156] [2025-01-09 16:23:52,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:52,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:52,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436221156] [2025-01-09 16:23:52,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436221156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:52,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:52,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381767653] [2025-01-09 16:23:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:52,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:52,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:52,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:52,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-01-09 16:23:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-01-09 16:23:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-01-09 16:23:52,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:55,011 INFO L124 PetriNetUnfolderBase]: 28492/41307 cut-off events. [2025-01-09 16:23:55,011 INFO L125 PetriNetUnfolderBase]: For 5011/5011 co-relation queries the response was YES. [2025-01-09 16:23:55,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 41307 events. 28492/41307 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 288780 event pairs, 6352 based on Foata normal form. 4892/44047 useless extension candidates. Maximal degree in co-relation 10947. Up to 15765 conditions per place. [2025-01-09 16:23:55,242 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 70 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-01-09 16:23:55,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2025-01-09 16:23:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-01-09 16:23:55,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 16:23:55,247 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 150 flow. Second operand 4 states and 183 transitions. [2025-01-09 16:23:55,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 410 flow [2025-01-09 16:23:55,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 392 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:55,253 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 138 flow [2025-01-09 16:23:55,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-01-09 16:23:55,253 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-01-09 16:23:55,253 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 138 flow [2025-01-09 16:23:55,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-01-09 16:23:55,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:55,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:55,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:23:55,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:55,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -202119962, now seen corresponding path program 1 times [2025-01-09 16:23:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:55,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905041573] [2025-01-09 16:23:55,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:55,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:55,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:55,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:55,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905041573] [2025-01-09 16:23:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905041573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491005987] [2025-01-09 16:23:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:55,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-09 16:23:55,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-09 16:23:55,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:55,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-09 16:23:55,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:57,149 INFO L124 PetriNetUnfolderBase]: 28492/39753 cut-off events. [2025-01-09 16:23:57,150 INFO L125 PetriNetUnfolderBase]: For 2566/2566 co-relation queries the response was YES. [2025-01-09 16:23:57,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39753 events. 28492/39753 cut-off events. For 2566/2566 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 258314 event pairs, 6352 based on Foata normal form. 777/39029 useless extension candidates. Maximal degree in co-relation 65082. Up to 15765 conditions per place. [2025-01-09 16:23:57,456 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-01-09 16:23:57,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 392 flow [2025-01-09 16:23:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:23:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:23:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-01-09 16:23:57,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2025-01-09 16:23:57,459 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 138 flow. Second operand 4 states and 166 transitions. [2025-01-09 16:23:57,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 392 flow [2025-01-09 16:23:57,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:57,464 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 133 flow [2025-01-09 16:23:57,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-01-09 16:23:57,464 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-01-09 16:23:57,464 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 133 flow [2025-01-09 16:23:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-09 16:23:57,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:57,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:23:57,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:57,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 760380169, now seen corresponding path program 1 times [2025-01-09 16:23:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226763340] [2025-01-09 16:23:57,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:57,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:23:57,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:23:57,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:57,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:57,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226763340] [2025-01-09 16:23:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226763340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:23:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389878796] [2025-01-09 16:23:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:57,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:23:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:57,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:23:57,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:23:57,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2025-01-09 16:23:57,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:57,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:57,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2025-01-09 16:23:57,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:59,846 INFO L124 PetriNetUnfolderBase]: 38482/55572 cut-off events. [2025-01-09 16:23:59,848 INFO L125 PetriNetUnfolderBase]: For 3976/3976 co-relation queries the response was YES. [2025-01-09 16:23:59,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109068 conditions, 55572 events. 38482/55572 cut-off events. For 3976/3976 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 402294 event pairs, 8611 based on Foata normal form. 0/51210 useless extension candidates. Maximal degree in co-relation 81252. Up to 21195 conditions per place. [2025-01-09 16:24:00,122 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 68 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-01-09 16:24:00,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 377 flow [2025-01-09 16:24:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2025-01-09 16:24:00,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-01-09 16:24:00,124 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 133 flow. Second operand 4 states and 168 transitions. [2025-01-09 16:24:00,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 377 flow [2025-01-09 16:24:00,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:24:00,131 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 134 flow [2025-01-09 16:24:00,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-01-09 16:24:00,132 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-01-09 16:24:00,133 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 134 flow [2025-01-09 16:24:00,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:00,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:00,134 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:24:00,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 760381192, now seen corresponding path program 1 times [2025-01-09 16:24:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934250104] [2025-01-09 16:24:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:00,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:24:00,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:24:00,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:24:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934250104] [2025-01-09 16:24:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934250104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:24:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788517215] [2025-01-09 16:24:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:00,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:00,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:00,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-09 16:24:00,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:00,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:00,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-09 16:24:00,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:02,335 INFO L124 PetriNetUnfolderBase]: 38482/53508 cut-off events. [2025-01-09 16:24:02,335 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2025-01-09 16:24:02,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107517 conditions, 53508 events. 38482/53508 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 2042. Compared 361059 event pairs, 8611 based on Foata normal form. 1032/51036 useless extension candidates. Maximal degree in co-relation 79704. Up to 21195 conditions per place. [2025-01-09 16:24:02,646 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-09 16:24:02,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 370 flow [2025-01-09 16:24:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-09 16:24:02,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-01-09 16:24:02,647 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 134 flow. Second operand 4 states and 164 transitions. [2025-01-09 16:24:02,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 370 flow [2025-01-09 16:24:02,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:24:02,657 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 129 flow [2025-01-09 16:24:02,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-01-09 16:24:02,658 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-01-09 16:24:02,658 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 129 flow [2025-01-09 16:24:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:24:02,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:02,658 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:02,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:24:02,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:24:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1500417410, now seen corresponding path program 1 times [2025-01-09 16:24:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57007702] [2025-01-09 16:24:02,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:02,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:02,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:02,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:24:02,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:24:02,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:24:02,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:24:02,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:24:02,674 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:24:02,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-09 16:24:02,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-01-09 16:24:02,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-01-09 16:24:02,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:24:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:24:02,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:24:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:24:02,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 16:24:02,675 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:24:02,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 16:24:02,696 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:24:02,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2025-01-09 16:24:02,702 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2025-01-09 16:24:02,702 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 16:24:02,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 225 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2025-01-09 16:24:02,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2025-01-09 16:24:02,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2025-01-09 16:24:02,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:24:02,704 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;@73646799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:24:02,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:24:02,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:24:02,705 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-01-09 16:24:02,705 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:24:02,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:02,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:02,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:24:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1869623583, now seen corresponding path program 1 times [2025-01-09 16:24:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779708817] [2025-01-09 16:24:02,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:02,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:02,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:02,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:02,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:24:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779708817] [2025-01-09 16:24:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779708817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:24:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94939259] [2025-01-09 16:24:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:02,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:02,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:02,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-09 16:24:02,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-09 16:24:02,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:02,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-09 16:24:02,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:24:16,894 INFO L124 PetriNetUnfolderBase]: 217600/294522 cut-off events. [2025-01-09 16:24:16,895 INFO L125 PetriNetUnfolderBase]: For 46094/46094 co-relation queries the response was YES. [2025-01-09 16:24:17,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581613 conditions, 294522 events. 217600/294522 cut-off events. For 46094/46094 co-relation queries the response was YES. Maximal size of possible extension queue 9086. Compared 2203818 event pairs, 49768 based on Foata normal form. 38646/320220 useless extension candidates. Maximal degree in co-relation 80810. Up to 114045 conditions per place. [2025-01-09 16:24:18,930 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 88 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-01-09 16:24:18,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 530 flow [2025-01-09 16:24:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:24:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:24:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-01-09 16:24:18,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-01-09 16:24:18,932 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 190 flow. Second operand 4 states and 232 transitions. [2025-01-09 16:24:18,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 530 flow [2025-01-09 16:24:18,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 494 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 16:24:18,948 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 170 flow [2025-01-09 16:24:18,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-01-09 16:24:18,949 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-01-09 16:24:18,950 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 170 flow [2025-01-09 16:24:18,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-09 16:24:18,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:24:18,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:24:18,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:24:18,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-01-09 16:24:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:24:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1869624606, now seen corresponding path program 1 times [2025-01-09 16:24:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:24:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725211041] [2025-01-09 16:24:18,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:24:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:24:18,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:24:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:24:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:24:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:24:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:24:18,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:24:18,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725211041] [2025-01-09 16:24:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725211041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:24:18,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:24:18,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:24:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723190516] [2025-01-09 16:24:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:24:18,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:24:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:24:18,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:24:18,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:24:18,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2025-01-09 16:24:18,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-01-09 16:24:18,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:24:18,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2025-01-09 16:24:18,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand