./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:00:07,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:00:07,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:00:07,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:00:07,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:00:07,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:00:07,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:00:07,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:00:07,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:00:07,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:00:07,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:00:07,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:00:07,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:00:07,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:00:07,156 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:00:07,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:00:07,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:00:07,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:00:07,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:00:07,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:00:07,159 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7399a2144dae504b22d3bd9a68ebd91d200de1e145cd9c7db720353ffec7d306 [2025-03-04 02:00:07,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:00:07,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:00:07,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:00:07,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:00:07,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:00:07,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-7.i [2025-03-04 02:00:08,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43322f5f0/05a9aa8afbc84f4189004e833f34f6b8/FLAGee6d3580b [2025-03-04 02:00:08,825 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:00:08,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-7.i [2025-03-04 02:00:08,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43322f5f0/05a9aa8afbc84f4189004e833f34f6b8/FLAGee6d3580b [2025-03-04 02:00:09,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43322f5f0/05a9aa8afbc84f4189004e833f34f6b8 [2025-03-04 02:00:09,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:00:09,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:00:09,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:00:09,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:00:09,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:00:09,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7060f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09, skipping insertion in model container [2025-03-04 02:00:09,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:00:09,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-7.i[30243,30256] [2025-03-04 02:00:09,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:00:09,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:00:09,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-7.i[30243,30256] [2025-03-04 02:00:09,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:00:09,476 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:00:09,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09 WrapperNode [2025-03-04 02:00:09,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:00:09,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:00:09,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:00:09,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:00:09,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,511 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-03-04 02:00:09,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:00:09,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:00:09,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:00:09,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:00:09,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:00:09,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:00:09,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:00:09,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:00:09,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:00:09,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (1/1) ... [2025-03-04 02:00:09,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:00:09,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:09,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:00:09,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:00:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:00:09,589 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:00:09,589 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:00:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:00:09,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:00:09,591 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:00:09,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:00:09,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:00:09,795 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:00:09,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:00:09,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:00:09,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:00:09,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:00:09 BoogieIcfgContainer [2025-03-04 02:00:09,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:00:09,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:00:09,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:00:09,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:00:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:00:09" (1/3) ... [2025-03-04 02:00:09,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0cc0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:00:09, skipping insertion in model container [2025-03-04 02:00:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:00:09" (2/3) ... [2025-03-04 02:00:09,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0cc0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:00:09, skipping insertion in model container [2025-03-04 02:00:09,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:00:09" (3/3) ... [2025-03-04 02:00:09,874 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2025-03-04 02:00:09,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:00:09,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-7.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:00:09,887 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:00:09,914 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:00:09,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 02:00:09,959 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-04 02:00:09,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:00:09,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-04 02:00:09,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 02:00:09,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-03-04 02:00:09,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:00:09,980 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;@568a4f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:00:09,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:00:09,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:00:09,993 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-03-04 02:00:09,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:00:09,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:09,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:09,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:09,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -412560026, now seen corresponding path program 1 times [2025-03-04 02:00:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222457195] [2025-03-04 02:00:10,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:00:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:10,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:00:10,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:00:10,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:00:10,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222457195] [2025-03-04 02:00:10,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222457195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:00:10,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:00:10,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:00:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831782083] [2025-03-04 02:00:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:00:10,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:00:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:10,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:00:10,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:00:10,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-04 02:00:10,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:10,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:10,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-04 02:00:10,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:00:10,392 INFO L124 PetriNetUnfolderBase]: 233/410 cut-off events. [2025-03-04 02:00:10,392 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:00:10,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 410 events. 233/410 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1576 event pairs, 39 based on Foata normal form. 16/389 useless extension candidates. Maximal degree in co-relation 765. Up to 257 conditions per place. [2025-03-04 02:00:10,396 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2025-03-04 02:00:10,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 136 flow [2025-03-04 02:00:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:00:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:00:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-04 02:00:10,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-03-04 02:00:10,405 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 53 transitions. [2025-03-04 02:00:10,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 136 flow [2025-03-04 02:00:10,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:00:10,409 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-03-04 02:00:10,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-03-04 02:00:10,412 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-03-04 02:00:10,412 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-03-04 02:00:10,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:10,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:10,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:10,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:00:10,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash 103279624, now seen corresponding path program 1 times [2025-03-04 02:00:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144876535] [2025-03-04 02:00:10,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:00:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:10,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:00:10,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:00:10,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:00:10,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144876535] [2025-03-04 02:00:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144876535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:00:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755355126] [2025-03-04 02:00:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:00:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:10,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:00:10,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:00:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:00:10,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:00:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:00:10,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 02:00:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:00:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:10,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:00:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755355126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:00:10,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:00:10,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 02:00:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257251918] [2025-03-04 02:00:10,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:00:10,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:00:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:10,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:00:10,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:00:10,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-04 02:00:10,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:10,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:10,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-04 02:00:10,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:00:10,786 INFO L124 PetriNetUnfolderBase]: 297/506 cut-off events. [2025-03-04 02:00:10,786 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:00:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 506 events. 297/506 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1880 event pairs, 39 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 1069. Up to 209 conditions per place. [2025-03-04 02:00:10,789 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 51 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-04 02:00:10,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 254 flow [2025-03-04 02:00:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:00:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:00:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-03-04 02:00:10,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5804597701149425 [2025-03-04 02:00:10,793 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 6 states and 101 transitions. [2025-03-04 02:00:10,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 254 flow [2025-03-04 02:00:10,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:00:10,794 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 100 flow [2025-03-04 02:00:10,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-04 02:00:10,794 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-03-04 02:00:10,795 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 100 flow [2025-03-04 02:00:10,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:10,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:10,795 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:10,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:00:10,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:10,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash 701132262, now seen corresponding path program 2 times [2025-03-04 02:00:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936565162] [2025-03-04 02:00:10,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:00:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:11,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:00:11,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:00:11,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:00:11,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936565162] [2025-03-04 02:00:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936565162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:00:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808541926] [2025-03-04 02:00:11,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:00:11,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:11,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:00:11,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:00:11,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:00:11,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:00:11,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:00:11,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:00:11,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:00:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:11,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:00:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808541926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:00:11,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:00:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 02:00:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137826657] [2025-03-04 02:00:11,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:00:11,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:00:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:11,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:00:11,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:00:11,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-04 02:00:11,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 100 flow. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:11,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:11,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-04 02:00:11,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:00:11,460 INFO L124 PetriNetUnfolderBase]: 489/794 cut-off events. [2025-03-04 02:00:11,461 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-04 02:00:11,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 794 events. 489/794 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2900 event pairs, 39 based on Foata normal form. 96/869 useless extension candidates. Maximal degree in co-relation 1997. Up to 209 conditions per place. [2025-03-04 02:00:11,465 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 99 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2025-03-04 02:00:11,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 115 transitions, 516 flow [2025-03-04 02:00:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:00:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:00:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2025-03-04 02:00:11,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2025-03-04 02:00:11,467 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 100 flow. Second operand 12 states and 200 transitions. [2025-03-04 02:00:11,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 115 transitions, 516 flow [2025-03-04 02:00:11,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 115 transitions, 502 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:00:11,474 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 170 flow [2025-03-04 02:00:11,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-03-04 02:00:11,475 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-03-04 02:00:11,475 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 170 flow [2025-03-04 02:00:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:11,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:11,475 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:11,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:00:11,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 02:00:11,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:11,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1268144806, now seen corresponding path program 3 times [2025-03-04 02:00:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:11,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727582550] [2025-03-04 02:00:11,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:00:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:11,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-03-04 02:00:11,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:00:11,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:00:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727582550] [2025-03-04 02:00:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727582550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:00:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823395214] [2025-03-04 02:00:11,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:00:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:11,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:00:11,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:00:11,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-03-04 02:00:11,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:00:11,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 02:00:11,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:11,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:00:11,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:00:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:12,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:00:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823395214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:00:12,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:00:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-03-04 02:00:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879582857] [2025-03-04 02:00:12,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:00:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:00:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:12,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:00:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:00:12,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2025-03-04 02:00:12,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 170 flow. Second operand has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:12,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:12,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2025-03-04 02:00:12,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:00:12,434 INFO L124 PetriNetUnfolderBase]: 681/1082 cut-off events. [2025-03-04 02:00:12,435 INFO L125 PetriNetUnfolderBase]: For 4012/4012 co-relation queries the response was YES. [2025-03-04 02:00:12,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 1082 events. 681/1082 cut-off events. For 4012/4012 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3921 event pairs, 39 based on Foata normal form. 96/1157 useless extension candidates. Maximal degree in co-relation 3133. Up to 241 conditions per place. [2025-03-04 02:00:12,444 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 147 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2025-03-04 02:00:12,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 169 transitions, 802 flow [2025-03-04 02:00:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:00:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:00:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 296 transitions. [2025-03-04 02:00:12,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670498084291188 [2025-03-04 02:00:12,446 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 170 flow. Second operand 18 states and 296 transitions. [2025-03-04 02:00:12,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 169 transitions, 802 flow [2025-03-04 02:00:12,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 169 transitions, 742 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-03-04 02:00:12,458 INFO L231 Difference]: Finished difference. Result has 71 places, 41 transitions, 218 flow [2025-03-04 02:00:12,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=218, PETRI_PLACES=71, PETRI_TRANSITIONS=41} [2025-03-04 02:00:12,458 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2025-03-04 02:00:12,459 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 41 transitions, 218 flow [2025-03-04 02:00:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:12,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:12,461 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:12,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:00:12,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:12,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1804748954, now seen corresponding path program 4 times [2025-03-04 02:00:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576372513] [2025-03-04 02:00:12,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:00:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:12,670 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:00:12,697 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:00:12,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:00:12,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576372513] [2025-03-04 02:00:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576372513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:00:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931627732] [2025-03-04 02:00:13,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:00:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:13,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:13,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:00:13,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:00:13,659 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:00:13,685 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:00:13,685 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:00:13,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:13,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 02:00:13,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:00:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:14,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:00:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931627732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:00:15,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:00:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-03-04 02:00:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316436786] [2025-03-04 02:00:15,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:00:15,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 02:00:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 02:00:15,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=3951, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 02:00:15,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-03-04 02:00:15,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 41 transitions, 218 flow. Second operand has 68 states, 68 states have (on average 6.235294117647059) internal successors, (424), 68 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:15,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:15,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-03-04 02:00:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:00:34,283 INFO L124 PetriNetUnfolderBase]: 19135/31485 cut-off events. [2025-03-04 02:00:34,285 INFO L125 PetriNetUnfolderBase]: For 80341/80341 co-relation queries the response was YES. [2025-03-04 02:00:34,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85211 conditions, 31485 events. 19135/31485 cut-off events. For 80341/80341 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 208277 event pairs, 104 based on Foata normal form. 0/31115 useless extension candidates. Maximal degree in co-relation 85177. Up to 4050 conditions per place. [2025-03-04 02:00:34,506 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 644 selfloop transitions, 720 changer transitions 789/2156 dead transitions. [2025-03-04 02:00:34,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 2156 transitions, 13373 flow [2025-03-04 02:00:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-03-04 02:00:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2025-03-04 02:00:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 2626 transitions. [2025-03-04 02:00:34,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46199859254046444 [2025-03-04 02:00:34,520 INFO L175 Difference]: Start difference. First operand has 71 places, 41 transitions, 218 flow. Second operand 196 states and 2626 transitions. [2025-03-04 02:00:34,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 2156 transitions, 13373 flow [2025-03-04 02:00:34,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 2156 transitions, 11207 flow, removed 722 selfloop flow, removed 11 redundant places. [2025-03-04 02:00:34,631 INFO L231 Difference]: Finished difference. Result has 333 places, 822 transitions, 4966 flow [2025-03-04 02:00:34,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=196, PETRI_FLOW=4966, PETRI_PLACES=333, PETRI_TRANSITIONS=822} [2025-03-04 02:00:34,632 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 303 predicate places. [2025-03-04 02:00:34,632 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 822 transitions, 4966 flow [2025-03-04 02:00:34,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.235294117647059) internal successors, (424), 68 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:34,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:00:34,633 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:00:34,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:00:34,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:34,836 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:00:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:00:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash -287952604, now seen corresponding path program 1 times [2025-03-04 02:00:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:00:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317929536] [2025-03-04 02:00:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:00:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:00:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:00:34,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:00:34,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:00:34,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:00:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317929536] [2025-03-04 02:00:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317929536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:00:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511699707] [2025-03-04 02:00:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:00:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:00:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:00:35,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:00:35,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:00:35,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:00:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:00:35,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:00:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:00:35,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 02:00:35,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:00:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:36,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:00:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:00:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511699707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:00:37,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:00:37,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-03-04 02:00:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606217433] [2025-03-04 02:00:37,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:00:37,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-04 02:00:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:00:37,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-04 02:00:37,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=4591, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 02:00:37,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-03-04 02:00:37,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 822 transitions, 4966 flow. Second operand has 73 states, 73 states have (on average 6.301369863013699) internal successors, (460), 73 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:00:37,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:00:37,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-03-04 02:00:37,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand