./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/31_simple_loop5_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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:17:01,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:17:01,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:17:01,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:17:01,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:17:01,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:17:01,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:17:01,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:17:01,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:17:01,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:17:01,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:17:01,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:17:01,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:17:01,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:17:01,141 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:17:01,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:17:01,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:17:01,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:17:01,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:17:01,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:17:01,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:17:01,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:17:01,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:17:01,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:17:01,143 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-02-06 04:17:01,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:17:01,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:17:01,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:17:01,382 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:17:01,382 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:17:01,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 04:17:02,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8afa488bd/ea13fec243334c87b18663600f155348/FLAG8bd298fb1 [2025-02-06 04:17:02,848 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:17:02,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 04:17:02,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8afa488bd/ea13fec243334c87b18663600f155348/FLAG8bd298fb1 [2025-02-06 04:17:03,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8afa488bd/ea13fec243334c87b18663600f155348 [2025-02-06 04:17:03,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:17:03,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:17:03,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:17:03,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:17:03,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:17:03,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dd20c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03, skipping insertion in model container [2025-02-06 04:17:03,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:17:03,320 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/31_simple_loop5_vs.i[30640,30653] [2025-02-06 04:17:03,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:17:03,333 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:17:03,358 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/31_simple_loop5_vs.i[30640,30653] [2025-02-06 04:17:03,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:17:03,382 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:17:03,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03 WrapperNode [2025-02-06 04:17:03,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:17:03,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:17:03,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:17:03,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:17:03,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,411 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-02-06 04:17:03,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:17:03,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:17:03,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:17:03,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:17:03,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,428 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-02-06 04:17:03,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:17:03,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:17:03,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:17:03,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:17:03,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (1/1) ... [2025-02-06 04:17:03,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:17:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:17:03,457 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-02-06 04:17:03,464 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-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 04:17:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 04:17:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:17:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:17:03,477 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:17:03,563 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:17:03,565 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:17:03,670 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:17:03,670 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:17:03,750 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:17:03,750 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:17:03,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:17:03 BoogieIcfgContainer [2025-02-06 04:17:03,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:17:03,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:17:03,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:17:03,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:17:03,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:17:03" (1/3) ... [2025-02-06 04:17:03,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a64516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:17:03, skipping insertion in model container [2025-02-06 04:17:03,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:03" (2/3) ... [2025-02-06 04:17:03,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a64516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:17:03, skipping insertion in model container [2025-02-06 04:17:03,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:17:03" (3/3) ... [2025-02-06 04:17:03,763 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-02-06 04:17:03,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:17:03,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:17:03,776 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:17:03,807 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:03,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-02-06 04:17:03,861 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-02-06 04:17:03,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:17:03,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-06 04:17:03,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-02-06 04:17:03,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-02-06 04:17:03,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:03,888 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;@3ad16c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:03,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:17:03,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:03,900 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-02-06 04:17:03,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:17:03,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:03,900 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:03,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:17:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash 484113, now seen corresponding path program 1 times [2025-02-06 04:17:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:03,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518695247] [2025-02-06 04:17:03,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:03,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:03,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:03,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:03,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:04,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:04,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:04,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:04,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:04,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:04,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 04:17:04,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-06 04:17:04,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-06 04:17:04,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-06 04:17:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:17:04,027 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-06 04:17:04,029 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:04,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:17:04,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:04,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 114 flow [2025-02-06 04:17:04,068 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2025-02-06 04:17:04,068 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:17:04,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 4/39 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 3 conditions per place. [2025-02-06 04:17:04,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 47 transitions, 114 flow [2025-02-06 04:17:04,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 81 flow [2025-02-06 04:17:04,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:04,072 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;@3ad16c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:04,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:17:04,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:04,077 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-06 04:17:04,077 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:17:04,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:04,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:04,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:17:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1079813189, now seen corresponding path program 1 times [2025-02-06 04:17:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861294327] [2025-02-06 04:17:04,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:04,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:04,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:04,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861294327] [2025-02-06 04:17:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861294327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777395493] [2025-02-06 04:17:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:04,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:17:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:04,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:17:04,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:17:04,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-02-06 04:17:04,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-06 04:17:04,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:04,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-02-06 04:17:04,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:04,518 INFO L124 PetriNetUnfolderBase]: 1203/2092 cut-off events. [2025-02-06 04:17:04,518 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-06 04:17:04,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 2092 events. 1203/2092 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12191 event pairs, 303 based on Foata normal form. 634/2619 useless extension candidates. Maximal degree in co-relation 3866. Up to 1003 conditions per place. [2025-02-06 04:17:04,574 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 25 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-02-06 04:17:04,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 158 flow [2025-02-06 04:17:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:17:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:17:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 04:17:04,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2025-02-06 04:17:04,586 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 81 flow. Second operand 3 states and 93 transitions. [2025-02-06 04:17:04,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 158 flow [2025-02-06 04:17:04,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:17:04,592 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 100 flow [2025-02-06 04:17:04,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-06 04:17:04,597 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-06 04:17:04,598 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 100 flow [2025-02-06 04:17:04,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-02-06 04:17:04,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:04,598 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:17:04,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 04:17:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1193980141, now seen corresponding path program 1 times [2025-02-06 04:17:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393456607] [2025-02-06 04:17:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:04,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:17:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:17:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:04,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:04,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:17:04,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:17:04,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:04,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:04,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:04,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:04,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:17:04,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:17:04,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-06 04:17:04,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:17:04,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:17:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:17:04,645 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 04:17:04,645 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:04,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:17:04,664 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:04,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 170 flow [2025-02-06 04:17:04,671 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-02-06 04:17:04,671 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 04:17:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 50 events. 5/50 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-02-06 04:17:04,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 67 transitions, 170 flow [2025-02-06 04:17:04,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 42 transitions, 105 flow [2025-02-06 04:17:04,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:04,673 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;@3ad16c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:04,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:17:04,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:04,676 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-06 04:17:04,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:17:04,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:04,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:04,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:17:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -880479656, now seen corresponding path program 1 times [2025-02-06 04:17:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122403572] [2025-02-06 04:17:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:04,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:04,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:04,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122403572] [2025-02-06 04:17:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122403572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101124312] [2025-02-06 04:17:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:17:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:17:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:17:04,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 67 [2025-02-06 04:17:04,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 04:17:04,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:04,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 67 [2025-02-06 04:17:04,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:05,547 INFO L124 PetriNetUnfolderBase]: 6995/10809 cut-off events. [2025-02-06 04:17:05,548 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-02-06 04:17:05,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20440 conditions, 10809 events. 6995/10809 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 70867 event pairs, 1712 based on Foata normal form. 3672/13945 useless extension candidates. Maximal degree in co-relation 20428. Up to 5767 conditions per place. [2025-02-06 04:17:05,601 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 32 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-02-06 04:17:05,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 211 flow [2025-02-06 04:17:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:17:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:17:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-02-06 04:17:05,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318407960199005 [2025-02-06 04:17:05,603 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 105 flow. Second operand 3 states and 127 transitions. [2025-02-06 04:17:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 211 flow [2025-02-06 04:17:05,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 04:17:05,605 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 128 flow [2025-02-06 04:17:05,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-02-06 04:17:05,606 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-02-06 04:17:05,606 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 128 flow [2025-02-06 04:17:05,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-02-06 04:17:05,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:05,606 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:17:05,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:17:05,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1740471082, now seen corresponding path program 1 times [2025-02-06 04:17:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331432906] [2025-02-06 04:17:05,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:05,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:17:05,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:17:05,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:05,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:05,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:05,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:17:05,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:17:05,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:05,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:05,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:05,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:05,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 04:17:05,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:17:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:17:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-06 04:17:05,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:17:05,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:17:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:17:05,650 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 04:17:05,650 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:05,650 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 04:17:05,678 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 87 transitions, 230 flow [2025-02-06 04:17:05,685 INFO L124 PetriNetUnfolderBase]: 6/61 cut-off events. [2025-02-06 04:17:05,685 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 04:17:05,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 61 events. 6/61 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 77. Up to 5 conditions per place. [2025-02-06 04:17:05,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 87 transitions, 230 flow [2025-02-06 04:17:05,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 50 transitions, 131 flow [2025-02-06 04:17:05,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:05,688 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;@3ad16c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:05,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 04:17:05,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:05,692 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-06 04:17:05,692 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:17:05,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:05,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:05,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:17:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash -857012597, now seen corresponding path program 1 times [2025-02-06 04:17:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932128972] [2025-02-06 04:17:05,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:05,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:05,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932128972] [2025-02-06 04:17:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932128972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679240058] [2025-02-06 04:17:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:17:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:05,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:17:05,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:17:05,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-02-06 04:17:05,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-02-06 04:17:05,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:05,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-02-06 04:17:05,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:08,495 INFO L124 PetriNetUnfolderBase]: 36336/51963 cut-off events. [2025-02-06 04:17:08,496 INFO L125 PetriNetUnfolderBase]: For 7744/7744 co-relation queries the response was YES. [2025-02-06 04:17:08,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99688 conditions, 51963 events. 36336/51963 cut-off events. For 7744/7744 co-relation queries the response was YES. Maximal size of possible extension queue 2156. Compared 364158 event pairs, 9261 based on Foata normal form. 18924/68424 useless extension candidates. Maximal degree in co-relation 99675. Up to 29392 conditions per place. [2025-02-06 04:17:08,873 INFO L140 encePairwiseOnDemand]: 73/87 looper letters, 39 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-02-06 04:17:08,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 268 flow [2025-02-06 04:17:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:17:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:17:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-02-06 04:17:08,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168582375478927 [2025-02-06 04:17:08,882 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 131 flow. Second operand 3 states and 161 transitions. [2025-02-06 04:17:08,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 268 flow [2025-02-06 04:17:08,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 255 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:17:08,890 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 156 flow [2025-02-06 04:17:08,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-02-06 04:17:08,891 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-02-06 04:17:08,891 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 156 flow [2025-02-06 04:17:08,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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-02-06 04:17:08,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:08,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:08,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:17:08,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:17:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1568828847, now seen corresponding path program 1 times [2025-02-06 04:17:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964418421] [2025-02-06 04:17:08,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:17:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:17:08,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:08,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964418421] [2025-02-06 04:17:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964418421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:17:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453515356] [2025-02-06 04:17:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:17:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:08,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:17:08,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:17:08,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-02-06 04:17:08,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-02-06 04:17:08,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:08,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-02-06 04:17:08,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:12,210 INFO L124 PetriNetUnfolderBase]: 43697/64283 cut-off events. [2025-02-06 04:17:12,211 INFO L125 PetriNetUnfolderBase]: For 19152/19152 co-relation queries the response was YES. [2025-02-06 04:17:12,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139026 conditions, 64283 events. 43697/64283 cut-off events. For 19152/19152 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 488072 event pairs, 5040 based on Foata normal form. 372/63209 useless extension candidates. Maximal degree in co-relation 139010. Up to 31321 conditions per place. [2025-02-06 04:17:12,642 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 52 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2025-02-06 04:17:12,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 420 flow [2025-02-06 04:17:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:17:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:17:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-02-06 04:17:12,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-02-06 04:17:12,644 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 156 flow. Second operand 4 states and 198 transitions. [2025-02-06 04:17:12,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 420 flow [2025-02-06 04:17:12,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:17:12,673 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 243 flow [2025-02-06 04:17:12,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-02-06 04:17:12,674 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-02-06 04:17:12,674 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 243 flow [2025-02-06 04:17:12,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-02-06 04:17:12,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:12,674 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:12,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:17:12,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-02-06 04:17:12,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash -91052982, now seen corresponding path program 1 times [2025-02-06 04:17:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885690384] [2025-02-06 04:17:12,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:17:12,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:17:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,687 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:12,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:17:12,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:17:12,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:12,698 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:12,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 04:17:12,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-02-06 04:17:12,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-02-06 04:17:12,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-02-06 04:17:12,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-02-06 04:17:12,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-02-06 04:17:12,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-02-06 04:17:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:17:12,703 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 04:17:12,703 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:12,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 04:17:12,741 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:12,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 294 flow [2025-02-06 04:17:12,756 INFO L124 PetriNetUnfolderBase]: 7/72 cut-off events. [2025-02-06 04:17:12,756 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 04:17:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 72 events. 7/72 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 163 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 94. Up to 6 conditions per place. [2025-02-06 04:17:12,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 107 transitions, 294 flow [2025-02-06 04:17:12,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 58 transitions, 159 flow [2025-02-06 04:17:12,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:12,758 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;@3ad16c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:12,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 04:17:12,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:12,764 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-06 04:17:12,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:17:12,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:12,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:12,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 04:17:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -151457698, now seen corresponding path program 1 times [2025-02-06 04:17:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232500994] [2025-02-06 04:17:12,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:12,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:17:12,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:17:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232500994] [2025-02-06 04:17:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232500994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985534932] [2025-02-06 04:17:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:12,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:17:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:12,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:17:12,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:17:12,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 107 [2025-02-06 04:17:12,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-02-06 04:17:12,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:12,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 107 [2025-02-06 04:17:12,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:26,005 INFO L124 PetriNetUnfolderBase]: 178118/240990 cut-off events. [2025-02-06 04:17:26,005 INFO L125 PetriNetUnfolderBase]: For 49465/49465 co-relation queries the response was YES. [2025-02-06 04:17:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467509 conditions, 240990 events. 178118/240990 cut-off events. For 49465/49465 co-relation queries the response was YES. Maximal size of possible extension queue 8148. Compared 1749388 event pairs, 48026 based on Foata normal form. 92130/322535 useless extension candidates. Maximal degree in co-relation 467495. Up to 141658 conditions per place. [2025-02-06 04:17:27,975 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 46 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2025-02-06 04:17:27,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 329 flow [2025-02-06 04:17:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:17:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:17:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2025-02-06 04:17:27,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6074766355140186 [2025-02-06 04:17:27,978 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 159 flow. Second operand 3 states and 195 transitions. [2025-02-06 04:17:27,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 329 flow [2025-02-06 04:17:27,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 304 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-02-06 04:17:27,998 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 184 flow [2025-02-06 04:17:27,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-02-06 04:17:27,999 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-02-06 04:17:27,999 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 184 flow [2025-02-06 04:17:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-02-06 04:17:27,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:27,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:27,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:17:27,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-02-06 04:17:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1129371633, now seen corresponding path program 1 times [2025-02-06 04:17:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287980793] [2025-02-06 04:17:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:17:28,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:17:28,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287980793] [2025-02-06 04:17:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287980793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:17:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371653615] [2025-02-06 04:17:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:17:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:28,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:17:28,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:17:28,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 107 [2025-02-06 04:17:28,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-02-06 04:17:28,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:28,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 107 [2025-02-06 04:17:28,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand