./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.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/triangular-2.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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:01:40,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:01:40,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:01:40,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:01:40,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:01:40,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:01:40,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:01:40,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:01:40,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:01:40,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:01:40,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:01:40,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:01:40,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:01:40,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:40,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:01:40,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:01:40,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:01:40,887 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2025-03-04 02:01:41,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:01:41,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:01:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:01:41,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:01:41,135 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:01:41,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-03-04 02:01:42,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d1afb8d/6c78c1eba4994962825b1d445e6a3334/FLAG57831a77b [2025-03-04 02:01:42,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:01:42,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-03-04 02:01:42,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d1afb8d/6c78c1eba4994962825b1d445e6a3334/FLAG57831a77b [2025-03-04 02:01:42,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d1afb8d/6c78c1eba4994962825b1d445e6a3334 [2025-03-04 02:01:42,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:01:42,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:01:42,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:42,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:01:42,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:01:42,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:42" (1/1) ... [2025-03-04 02:01:42,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e512d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:42, skipping insertion in model container [2025-03-04 02:01:42,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:42" (1/1) ... [2025-03-04 02:01:42,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:01:43,117 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/triangular-2.i[30952,30965] [2025-03-04 02:01:43,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:43,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:01:43,156 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/triangular-2.i[30952,30965] [2025-03-04 02:01:43,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:43,185 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:01:43,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43 WrapperNode [2025-03-04 02:01:43,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:43,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:43,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:01:43,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:01:43,193 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:01:43" (1/1) ... [2025-03-04 02:01:43,200 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:01:43" (1/1) ... [2025-03-04 02:01:43,210 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-03-04 02:01:43,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:43,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:01:43,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:01:43,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:01:43,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,225 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:01:43,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:01:43,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:01:43,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:01:43,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:01:43,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (1/1) ... [2025-03-04 02:01:43,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:43,260 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:01:43,263 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:01:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:01:43,280 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:01:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:01:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:01:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:01:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:01:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:01:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:01:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:01:43,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:01:43,282 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:01:43,365 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:01:43,367 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:01:43,460 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:01:43,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:01:43,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:01:43,510 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:01:43,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43 BoogieIcfgContainer [2025-03-04 02:01:43,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:01:43,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:01:43,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:01:43,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:01:43,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:01:42" (1/3) ... [2025-03-04 02:01:43,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f3531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:43, skipping insertion in model container [2025-03-04 02:01:43,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:43" (2/3) ... [2025-03-04 02:01:43,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f3531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:43, skipping insertion in model container [2025-03-04 02:01:43,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43" (3/3) ... [2025-03-04 02:01:43,517 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-03-04 02:01:43,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:01:43,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:01:43,528 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:01:43,567 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:01:43,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-03-04 02:01:43,617 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-04 02:01:43,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:01:43,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-04 02:01:43,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-03-04 02:01:43,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-03-04 02:01:43,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:01:43,635 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;@717272b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:01:43,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:01:43,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:01:43,641 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-04 02:01:43,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:01:43,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:43,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:43,642 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:01:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 341173780, now seen corresponding path program 1 times [2025-03-04 02:01:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307311819] [2025-03-04 02:01:43,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:43,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:01:43,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:01:43,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:43,956 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:01:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307311819] [2025-03-04 02:01:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307311819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:01:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571056278] [2025-03-04 02:01:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:43,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:43,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:43,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:01:43,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:43,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:01:43,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:43,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,173 INFO L124 PetriNetUnfolderBase]: 321/540 cut-off events. [2025-03-04 02:01:44,173 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:01:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 540 events. 321/540 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2134 event pairs, 62 based on Foata normal form. 12/535 useless extension candidates. Maximal degree in co-relation 1042. Up to 221 conditions per place. [2025-03-04 02:01:44,179 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2025-03-04 02:01:44,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2025-03-04 02:01:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:01:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:01:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-04 02:01:44,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:01:44,188 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2025-03-04 02:01:44,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2025-03-04 02:01:44,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,193 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2025-03-04 02:01:44,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-03-04 02:01:44,197 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-04 02:01:44,197 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2025-03-04 02:01:44,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:01:44,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:01:44,197 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:01:44,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -26154638, now seen corresponding path program 1 times [2025-03-04 02:01:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029929048] [2025-03-04 02:01:44,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:44,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:44,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:44,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,319 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:01:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029929048] [2025-03-04 02:01:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029929048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:44,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:44,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:01:44,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709412273] [2025-03-04 02:01:44,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:44,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:01:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:01:44,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:01:44,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:01:44,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,518 INFO L124 PetriNetUnfolderBase]: 382/687 cut-off events. [2025-03-04 02:01:44,518 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-03-04 02:01:44,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 687 events. 382/687 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2911 event pairs, 65 based on Foata normal form. 27/710 useless extension candidates. Maximal degree in co-relation 1570. Up to 246 conditions per place. [2025-03-04 02:01:44,525 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2025-03-04 02:01:44,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2025-03-04 02:01:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:01:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:01:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-03-04 02:01:44,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 02:01:44,528 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2025-03-04 02:01:44,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2025-03-04 02:01:44,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,535 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2025-03-04 02:01:44,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2025-03-04 02:01:44,536 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-03-04 02:01:44,536 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2025-03-04 02:01:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:01:44,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:01:44,536 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:01:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1984146738, now seen corresponding path program 2 times [2025-03-04 02:01:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769872449] [2025-03-04 02:01:44,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:01:44,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:01:44,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,658 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:01:44,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769872449] [2025-03-04 02:01:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769872449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:01:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217627894] [2025-03-04 02:01:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:44,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:01:44,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:01:44,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:01:44,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:01:44,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,814 INFO L124 PetriNetUnfolderBase]: 328/603 cut-off events. [2025-03-04 02:01:44,814 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2025-03-04 02:01:44,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 603 events. 328/603 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2513 event pairs, 65 based on Foata normal form. 45/644 useless extension candidates. Maximal degree in co-relation 1711. Up to 234 conditions per place. [2025-03-04 02:01:44,820 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2025-03-04 02:01:44,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2025-03-04 02:01:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:01:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:01:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-03-04 02:01:44,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-03-04 02:01:44,822 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2025-03-04 02:01:44,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2025-03-04 02:01:44,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,829 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2025-03-04 02:01:44,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-04 02:01:44,830 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-04 02:01:44,830 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2025-03-04 02:01:44,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:01:44,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:01:44,830 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:01:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947173, now seen corresponding path program 1 times [2025-03-04 02:01:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910489920] [2025-03-04 02:01:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,933 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:01:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910489920] [2025-03-04 02:01:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910489920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:44,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:01:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612872038] [2025-03-04 02:01:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:01:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:44,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:01:44,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:01:44,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:44,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:01:44,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:44,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:44,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:45,165 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2025-03-04 02:01:45,165 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-03-04 02:01:45,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 612 events. 337/612 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2551 event pairs, 74 based on Foata normal form. 18/626 useless extension candidates. Maximal degree in co-relation 1911. Up to 237 conditions per place. [2025-03-04 02:01:45,168 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 16 changer transitions 24/89 dead transitions. [2025-03-04 02:01:45,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 607 flow [2025-03-04 02:01:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:01:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:01:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-04 02:01:45,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-04 02:01:45,169 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 11 states and 135 transitions. [2025-03-04 02:01:45,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 607 flow [2025-03-04 02:01:45,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 540 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 02:01:45,176 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 279 flow [2025-03-04 02:01:45,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2025-03-04 02:01:45,178 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-03-04 02:01:45,178 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 279 flow [2025-03-04 02:01:45,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:01:45,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:45,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:01:45,178 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:01:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 765975209, now seen corresponding path program 2 times [2025-03-04 02:01:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238034499] [2025-03-04 02:01:45,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:45,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:45,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:45,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,255 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:01:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238034499] [2025-03-04 02:01:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238034499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:01:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648042295] [2025-03-04 02:01:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:01:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:01:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:01:45,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:45,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:01:45,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:45,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:45,491 INFO L124 PetriNetUnfolderBase]: 445/801 cut-off events. [2025-03-04 02:01:45,491 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2025-03-04 02:01:45,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 801 events. 445/801 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3459 event pairs, 59 based on Foata normal form. 27/823 useless extension candidates. Maximal degree in co-relation 2600. Up to 151 conditions per place. [2025-03-04 02:01:45,496 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 23 changer transitions 30/100 dead transitions. [2025-03-04 02:01:45,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 739 flow [2025-03-04 02:01:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:01:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:01:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2025-03-04 02:01:45,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 02:01:45,500 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 279 flow. Second operand 11 states and 138 transitions. [2025-03-04 02:01:45,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 739 flow [2025-03-04 02:01:45,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 685 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-04 02:01:45,507 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 390 flow [2025-03-04 02:01:45,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=390, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-04 02:01:45,509 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-04 02:01:45,509 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 390 flow [2025-03-04 02:01:45,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:01:45,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:45,510 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:01:45,510 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:01:45,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1363386589, now seen corresponding path program 1 times [2025-03-04 02:01:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102776666] [2025-03-04 02:01:45,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:45,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:45,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:45,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,642 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:01:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102776666] [2025-03-04 02:01:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102776666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859563925] [2025-03-04 02:01:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:45,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:45,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:45,645 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:01:45,647 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:01:45,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:45,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:45,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:45,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:01:45,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:45,766 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:01:45,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:45,896 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:01:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859563925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:45,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:01:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369269042] [2025-03-04 02:01:45,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:01:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:01:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:01:45,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 390 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:01:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:46,307 INFO L124 PetriNetUnfolderBase]: 571/1050 cut-off events. [2025-03-04 02:01:46,307 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2025-03-04 02:01:46,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1050 events. 571/1050 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4364 event pairs, 137 based on Foata normal form. 63/1109 useless extension candidates. Maximal degree in co-relation 4107. Up to 486 conditions per place. [2025-03-04 02:01:46,314 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 17 changer transitions 67/151 dead transitions. [2025-03-04 02:01:46,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 1346 flow [2025-03-04 02:01:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:01:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:01:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-03-04 02:01:46,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-04 02:01:46,316 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 390 flow. Second operand 19 states and 231 transitions. [2025-03-04 02:01:46,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 1346 flow [2025-03-04 02:01:46,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 1267 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-04 02:01:46,326 INFO L231 Difference]: Finished difference. Result has 88 places, 51 transitions, 521 flow [2025-03-04 02:01:46,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=521, PETRI_PLACES=88, PETRI_TRANSITIONS=51} [2025-03-04 02:01:46,327 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 62 predicate places. [2025-03-04 02:01:46,327 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 51 transitions, 521 flow [2025-03-04 02:01:46,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:01:46,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:46,327 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:46,334 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:01:46,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:01:46,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:46,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1919587151, now seen corresponding path program 2 times [2025-03-04 02:01:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347353613] [2025-03-04 02:01:46,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:46,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:01:46,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:46,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:01:46,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:46,629 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:01:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347353613] [2025-03-04 02:01:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347353613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:01:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353549191] [2025-03-04 02:01:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:01:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:46,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:01:46,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:01:46,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:46,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 51 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:01:46,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:46,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:46,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:46,938 INFO L124 PetriNetUnfolderBase]: 652/1217 cut-off events. [2025-03-04 02:01:46,939 INFO L125 PetriNetUnfolderBase]: For 19130/19130 co-relation queries the response was YES. [2025-03-04 02:01:46,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6062 conditions, 1217 events. 652/1217 cut-off events. For 19130/19130 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5640 event pairs, 132 based on Foata normal form. 27/1240 useless extension candidates. Maximal degree in co-relation 6019. Up to 483 conditions per place. [2025-03-04 02:01:46,948 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 76 selfloop transitions, 23 changer transitions 31/133 dead transitions. [2025-03-04 02:01:46,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 133 transitions, 1509 flow [2025-03-04 02:01:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:01:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:01:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-03-04 02:01:46,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-04 02:01:46,949 INFO L175 Difference]: Start difference. First operand has 88 places, 51 transitions, 521 flow. Second operand 15 states and 187 transitions. [2025-03-04 02:01:46,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 133 transitions, 1509 flow [2025-03-04 02:01:46,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1211 flow, removed 138 selfloop flow, removed 12 redundant places. [2025-03-04 02:01:46,970 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 583 flow [2025-03-04 02:01:46,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2025-03-04 02:01:46,971 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 64 predicate places. [2025-03-04 02:01:46,971 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 583 flow [2025-03-04 02:01:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:01:46,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:46,972 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:46,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:01:46,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:46,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash -744688911, now seen corresponding path program 3 times [2025-03-04 02:01:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124940781] [2025-03-04 02:01:46,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:46,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:01:46,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:46,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:01:46,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:47,075 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:01:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124940781] [2025-03-04 02:01:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124940781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643961958] [2025-03-04 02:01:47,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:47,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:47,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:47,078 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:01:47,080 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:01:47,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:01:47,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:01:47,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:01:47,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:47,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:01:47,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:47,177 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:01:47,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:47,256 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:01:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643961958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:47,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 02:01:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65461538] [2025-03-04 02:01:47,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:47,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:01:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:47,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:01:47,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:01:47,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:47,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 583 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:01:47,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:47,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:47,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:47,743 INFO L124 PetriNetUnfolderBase]: 814/1489 cut-off events. [2025-03-04 02:01:47,743 INFO L125 PetriNetUnfolderBase]: For 23715/23715 co-relation queries the response was YES. [2025-03-04 02:01:47,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7554 conditions, 1489 events. 814/1489 cut-off events. For 23715/23715 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6954 event pairs, 72 based on Foata normal form. 81/1566 useless extension candidates. Maximal degree in co-relation 7511. Up to 237 conditions per place. [2025-03-04 02:01:47,751 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 78 selfloop transitions, 45 changer transitions 81/207 dead transitions. [2025-03-04 02:01:47,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 207 transitions, 2402 flow [2025-03-04 02:01:47,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:01:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:01:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 308 transitions. [2025-03-04 02:01:47,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-04 02:01:47,753 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 583 flow. Second operand 25 states and 308 transitions. [2025-03-04 02:01:47,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 207 transitions, 2402 flow [2025-03-04 02:01:47,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 207 transitions, 2182 flow, removed 94 selfloop flow, removed 10 redundant places. [2025-03-04 02:01:47,778 INFO L231 Difference]: Finished difference. Result has 117 places, 69 transitions, 910 flow [2025-03-04 02:01:47,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=69} [2025-03-04 02:01:47,778 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 91 predicate places. [2025-03-04 02:01:47,778 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 69 transitions, 910 flow [2025-03-04 02:01:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:01:47,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:47,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:47,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:47,979 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,SelfDestructingSolverStorable7 [2025-03-04 02:01:47,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:47,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 183631298, now seen corresponding path program 1 times [2025-03-04 02:01:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818248719] [2025-03-04 02:01:47,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:47,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:01:47,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:01:47,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:47,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818248719] [2025-03-04 02:01:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818248719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328952680] [2025-03-04 02:01:48,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:48,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:48,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:48,079 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:01:48,081 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:01:48,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:01:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:01:48,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:48,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:48,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:01:48,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:48,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:48,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328952680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:48,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:48,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 02:01:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981469956] [2025-03-04 02:01:48,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:48,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:01:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:48,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:01:48,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:01:48,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:48,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 69 transitions, 910 flow. Second operand has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 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:01:48,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:48,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:48,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:48,852 INFO L124 PetriNetUnfolderBase]: 1129/2119 cut-off events. [2025-03-04 02:01:48,852 INFO L125 PetriNetUnfolderBase]: For 69281/69281 co-relation queries the response was YES. [2025-03-04 02:01:48,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13163 conditions, 2119 events. 1129/2119 cut-off events. For 69281/69281 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11353 event pairs, 70 based on Foata normal form. 72/2187 useless extension candidates. Maximal degree in co-relation 13107. Up to 400 conditions per place. [2025-03-04 02:01:48,867 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 90 selfloop transitions, 66 changer transitions 88/247 dead transitions. [2025-03-04 02:01:48,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 3782 flow [2025-03-04 02:01:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:01:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:01:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-03-04 02:01:48,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-03-04 02:01:48,871 INFO L175 Difference]: Start difference. First operand has 117 places, 69 transitions, 910 flow. Second operand 28 states and 341 transitions. [2025-03-04 02:01:48,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 3782 flow [2025-03-04 02:01:48,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 247 transitions, 3161 flow, removed 288 selfloop flow, removed 17 redundant places. [2025-03-04 02:01:48,932 INFO L231 Difference]: Finished difference. Result has 138 places, 97 transitions, 1499 flow [2025-03-04 02:01:48,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1499, PETRI_PLACES=138, PETRI_TRANSITIONS=97} [2025-03-04 02:01:48,934 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 112 predicate places. [2025-03-04 02:01:48,934 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 97 transitions, 1499 flow [2025-03-04 02:01:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.1875) internal successors, (115), 16 states have internal predecessors, (115), 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:01:48,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:48,934 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:48,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:01:49,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:49,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1643456025, now seen corresponding path program 2 times [2025-03-04 02:01:49,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:49,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962890301] [2025-03-04 02:01:49,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:49,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:01:49,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:01:49,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:49,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962890301] [2025-03-04 02:01:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962890301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373720393] [2025-03-04 02:01:49,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:49,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:49,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:49,255 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:01:49,256 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:01:49,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:01:49,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:01:49,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:49,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:01:49,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:49,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373720393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:49,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:49,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-04 02:01:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983478732] [2025-03-04 02:01:49,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:49,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:01:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:49,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:01:49,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:01:49,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:49,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 97 transitions, 1499 flow. Second operand has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 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:01:49,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:49,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:49,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:50,181 INFO L124 PetriNetUnfolderBase]: 1372/2603 cut-off events. [2025-03-04 02:01:50,181 INFO L125 PetriNetUnfolderBase]: For 133366/133366 co-relation queries the response was YES. [2025-03-04 02:01:50,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18222 conditions, 2603 events. 1372/2603 cut-off events. For 133366/133366 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14085 event pairs, 38 based on Foata normal form. 54/2653 useless extension candidates. Maximal degree in co-relation 18156. Up to 513 conditions per place. [2025-03-04 02:01:50,204 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 93 selfloop transitions, 96 changer transitions 79/271 dead transitions. [2025-03-04 02:01:50,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 271 transitions, 4770 flow [2025-03-04 02:01:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:01:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:01:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 343 transitions. [2025-03-04 02:01:50,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-04 02:01:50,205 INFO L175 Difference]: Start difference. First operand has 138 places, 97 transitions, 1499 flow. Second operand 28 states and 343 transitions. [2025-03-04 02:01:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 271 transitions, 4770 flow [2025-03-04 02:01:50,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 271 transitions, 3665 flow, removed 528 selfloop flow, removed 15 redundant places. [2025-03-04 02:01:50,365 INFO L231 Difference]: Finished difference. Result has 156 places, 121 transitions, 1893 flow [2025-03-04 02:01:50,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1893, PETRI_PLACES=156, PETRI_TRANSITIONS=121} [2025-03-04 02:01:50,366 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 130 predicate places. [2025-03-04 02:01:50,366 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 121 transitions, 1893 flow [2025-03-04 02:01:50,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.105263157894737) internal successors, (135), 19 states have internal predecessors, (135), 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:01:50,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:50,367 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:50,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:50,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:50,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1211190236, now seen corresponding path program 3 times [2025-03-04 02:01:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:50,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706089132] [2025-03-04 02:01:50,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:50,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-04 02:01:50,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:01:50,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 02:01:50,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:50,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:50,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706089132] [2025-03-04 02:01:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706089132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:50,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686106582] [2025-03-04 02:01:50,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:01:50,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:50,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:50,725 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:01:50,726 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:01:50,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-03-04 02:01:50,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:01:50,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 02:01:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:50,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:01:50,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:50,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686106582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:50,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-04 02:01:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573494794] [2025-03-04 02:01:50,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:01:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:01:50,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:01:50,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:01:50,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 121 transitions, 1893 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 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:01:50,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:50,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:01:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:51,885 INFO L124 PetriNetUnfolderBase]: 1696/3169 cut-off events. [2025-03-04 02:01:51,885 INFO L125 PetriNetUnfolderBase]: For 156825/156825 co-relation queries the response was YES. [2025-03-04 02:01:51,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22103 conditions, 3169 events. 1696/3169 cut-off events. For 156825/156825 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 17187 event pairs, 50 based on Foata normal form. 54/3219 useless extension candidates. Maximal degree in co-relation 22030. Up to 621 conditions per place. [2025-03-04 02:01:51,923 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 117 selfloop transitions, 120 changer transitions 91/331 dead transitions. [2025-03-04 02:01:51,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 331 transitions, 5780 flow [2025-03-04 02:01:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:01:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:01:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2025-03-04 02:01:51,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2025-03-04 02:01:51,925 INFO L175 Difference]: Start difference. First operand has 156 places, 121 transitions, 1893 flow. Second operand 34 states and 417 transitions. [2025-03-04 02:01:51,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 331 transitions, 5780 flow [2025-03-04 02:01:52,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 331 transitions, 4884 flow, removed 413 selfloop flow, removed 19 redundant places. [2025-03-04 02:01:52,111 INFO L231 Difference]: Finished difference. Result has 180 places, 145 transitions, 2474 flow [2025-03-04 02:01:52,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2474, PETRI_PLACES=180, PETRI_TRANSITIONS=145} [2025-03-04 02:01:52,112 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-04 02:01:52,112 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 145 transitions, 2474 flow [2025-03-04 02:01:52,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 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:01:52,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:52,112 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:52,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:01:52,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:01:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1587385757, now seen corresponding path program 4 times [2025-03-04 02:01:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769802344] [2025-03-04 02:01:52,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:01:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:52,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:01:52,330 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:01:52,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:01:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:01:52,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:01:52,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:01:52,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:01:52,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:52,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:01:52,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:01:52,356 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:01:52,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:01:52,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:01:52,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:01:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:01:52,359 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-03-04 02:01:52,397 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:01:52,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:01:52,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:01:52 BasicIcfg [2025-03-04 02:01:52,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:01:52,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:01:52,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:01:52,404 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:01:52,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:43" (3/4) ... [2025-03-04 02:01:52,405 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:01:52,463 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-04 02:01:52,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:01:52,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:01:52,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:01:52,496 INFO L158 Benchmark]: Toolchain (without parser) took 9643.93ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 104.5MB in the beginning and 308.0MB in the end (delta: -203.5MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,496 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:52,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.01ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 85.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.98ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,497 INFO L158 Benchmark]: Boogie Preprocessor took 24.03ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:01:52,497 INFO L158 Benchmark]: IcfgBuilder took 274.51ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 64.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,497 INFO L158 Benchmark]: TraceAbstraction took 8891.54ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 63.1MB in the beginning and 320.0MB in the end (delta: -256.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,497 INFO L158 Benchmark]: Witness Printer took 91.88ms. Allocated memory is still 402.7MB. Free memory was 320.0MB in the beginning and 308.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:01:52,499 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.01ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 85.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.98ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.03ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 274.51ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 64.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8891.54ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 63.1MB in the beginning and 320.0MB in the end (delta: -256.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 91.88ms. Allocated memory is still 402.7MB. Free memory was 320.0MB in the beginning and 308.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=7, id1=-1, id2=0, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1880 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1870 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3062 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 10 mSDtfsCounter, 3062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2474occurred in iteration=11, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1615 SizeOfPredicates, 29 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 1/132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:01:52,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE