/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:00:51,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:00:51,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:00:51,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:00:51,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:00:51,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:00:51,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:00:51,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:00:51,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:00:51,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:00:51,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:00:51,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:00:51,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:00:51,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:00:51,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:00:51,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:00:51,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:00:51,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:00:51,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:00:51,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:00:51,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:00:51,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:00:51,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:00:51,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:00:51,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:00:51,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:00:51,394 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:00:51,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2025-04-14 00:00:52,762 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083854582/7cce37a965a54fe2abb2a1b11918cd97/FLAGb16c83297 [2025-04-14 00:00:53,064 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:00:53,065 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2025-04-14 00:00:53,079 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083854582/7cce37a965a54fe2abb2a1b11918cd97/FLAGb16c83297 [2025-04-14 00:00:53,813 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083854582/7cce37a965a54fe2abb2a1b11918cd97 [2025-04-14 00:00:53,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:00:53,820 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:00:53,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:00:53,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:00:53,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:00:53,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:00:53" (1/1) ... [2025-04-14 00:00:53,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f625d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:53, skipping insertion in model container [2025-04-14 00:00:53,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:00:53" (1/1) ... [2025-04-14 00:00:53,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:00:54,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2025-04-14 00:00:54,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:00:54,162 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:00:54,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2025-04-14 00:00:54,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:00:54,249 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:00:54,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54 WrapperNode [2025-04-14 00:00:54,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:00:54,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:00:54,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:00:54,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:00:54,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,296 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2025-04-14 00:00:54,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:00:54,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:00:54,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:00:54,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:00:54,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,333 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-04-14 00:00:54,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:00:54,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:00:54,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:00:54,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:00:54,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (1/1) ... [2025-04-14 00:00:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:00:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:00:54,379 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-04-14 00:00:54,384 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-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:00:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:00:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:00:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:00:54,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:00:54,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:00:54,402 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:00:54,514 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:00:54,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:00:54,776 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:00:54,777 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:00:54,777 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:00:54,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:00:55,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:00:54 BoogieIcfgContainer [2025-04-14 00:00:55,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:00:55,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:00:55,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:00:55,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:00:55,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:00:53" (1/3) ... [2025-04-14 00:00:55,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69a5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:00:55, skipping insertion in model container [2025-04-14 00:00:55,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:00:54" (2/3) ... [2025-04-14 00:00:55,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69a5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:00:55, skipping insertion in model container [2025-04-14 00:00:55,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:00:54" (3/3) ... [2025-04-14 00:00:55,010 INFO L128 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2025-04-14 00:00:55,020 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:00:55,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix019_tso.oepc.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:00:55,022 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:00:55,062 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:00:55,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:00:55,110 INFO L116 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-04-14 00:00:55,111 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:00:55,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:00:55,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:00:55,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-04-14 00:00:55,124 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:00:55,135 INFO L340 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;@60e0121d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:00:55,135 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:00:55,142 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:00:55,142 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-14 00:00:55,142 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:00:55,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:00:55,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:00:55,143 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:00:55,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:00:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2124708758, now seen corresponding path program 1 times [2025-04-14 00:00:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:00:55,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512536519] [2025-04-14 00:00:55,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:00:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:00:55,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:00:55,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:00:55,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:00:55,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:00:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:00:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:00:55,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512536519] [2025-04-14 00:00:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512536519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:00:55,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:00:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:00:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77718218] [2025-04-14 00:00:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:00:55,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:00:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:00:55,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:00:55,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:00:55,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:00:55,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-14 00:00:55,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:00:55,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:00:55,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:00:56,457 INFO L116 PetriNetUnfolderBase]: 4967/7074 cut-off events. [2025-04-14 00:00:56,458 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-14 00:00:56,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14233 conditions, 7074 events. 4967/7074 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 37359 event pairs, 547 based on Foata normal form. 0/6815 useless extension candidates. Maximal degree in co-relation 14222. Up to 6161 conditions per place. [2025-04-14 00:00:56,501 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-04-14 00:00:56,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 214 flow [2025-04-14 00:00:56,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:00:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:00:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 00:00:56,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-04-14 00:00:56,511 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 68 transitions. [2025-04-14 00:00:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 214 flow [2025-04-14 00:00:56,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:00:56,515 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 72 flow [2025-04-14 00:00:56,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-14 00:00:56,521 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-04-14 00:00:56,521 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 72 flow [2025-04-14 00:00:56,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-04-14 00:00:56,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:00:56,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:00:56,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:00:56,522 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:00:56,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:00:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 20550559, now seen corresponding path program 1 times [2025-04-14 00:00:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:00:56,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962187606] [2025-04-14 00:00:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:00:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:00:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:00:56,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:00:56,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:00:56,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:00:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:00:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:00:57,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962187606] [2025-04-14 00:00:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962187606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:00:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:00:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:00:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106456938] [2025-04-14 00:00:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:00:57,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:00:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:00:57,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:00:57,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:00:57,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:00:57,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-04-14 00:00:57,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:00:57,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:00:57,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:00:57,802 INFO L116 PetriNetUnfolderBase]: 4403/6369 cut-off events. [2025-04-14 00:00:57,802 INFO L117 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-04-14 00:00:57,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 6369 events. 4403/6369 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32557 event pairs, 1127 based on Foata normal form. 252/6610 useless extension candidates. Maximal degree in co-relation 13133. Up to 4369 conditions per place. [2025-04-14 00:00:57,830 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 27/72 dead transitions. [2025-04-14 00:00:57,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 298 flow [2025-04-14 00:00:57,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:00:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:00:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-04-14 00:00:57,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2025-04-14 00:00:57,833 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 72 flow. Second operand 5 states and 101 transitions. [2025-04-14 00:00:57,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 298 flow [2025-04-14 00:00:57,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 72 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:00:57,836 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 80 flow [2025-04-14 00:00:57,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-04-14 00:00:57,836 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-04-14 00:00:57,837 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 80 flow [2025-04-14 00:00:57,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-04-14 00:00:57,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:00:57,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:00:57,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:00:57,838 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:00:57,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:00:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1717639859, now seen corresponding path program 1 times [2025-04-14 00:00:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:00:57,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719638838] [2025-04-14 00:00:57,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:00:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:00:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:00:57,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:00:57,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:00:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:00:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:00:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:00:58,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719638838] [2025-04-14 00:00:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719638838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:00:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:00:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:00:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665912802] [2025-04-14 00:00:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:00:58,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:00:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:00:58,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:00:58,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:00:58,384 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:00:58,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-04-14 00:00:58,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:00:58,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:00:58,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:00:59,016 INFO L116 PetriNetUnfolderBase]: 4191/6073 cut-off events. [2025-04-14 00:00:59,017 INFO L117 PetriNetUnfolderBase]: For 1064/1064 co-relation queries the response was YES. [2025-04-14 00:00:59,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13126 conditions, 6073 events. 4191/6073 cut-off events. For 1064/1064 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 31096 event pairs, 1911 based on Foata normal form. 180/6248 useless extension candidates. Maximal degree in co-relation 13113. Up to 5525 conditions per place. [2025-04-14 00:00:59,052 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 39 selfloop transitions, 4 changer transitions 20/66 dead transitions. [2025-04-14 00:00:59,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 285 flow [2025-04-14 00:00:59,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:00:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:00:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-14 00:00:59,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-14 00:00:59,056 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 80 flow. Second operand 5 states and 95 transitions. [2025-04-14 00:00:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 285 flow [2025-04-14 00:00:59,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 275 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:00:59,069 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 108 flow [2025-04-14 00:00:59,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2025-04-14 00:00:59,070 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2025-04-14 00:00:59,070 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 108 flow [2025-04-14 00:00:59,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-04-14 00:00:59,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:00:59,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:00:59,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:00:59,070 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:00:59,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:00:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2133969411, now seen corresponding path program 1 times [2025-04-14 00:00:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:00:59,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295226388] [2025-04-14 00:00:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:00:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:00:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:00:59,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:00:59,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:00:59,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:00:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:00:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:00:59,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295226388] [2025-04-14 00:00:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295226388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:00:59,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:00:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:00:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892520416] [2025-04-14 00:00:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:00:59,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:00:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:00:59,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:00:59,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:00:59,674 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:00:59,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-04-14 00:00:59,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:00:59,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:00:59,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:00,274 INFO L116 PetriNetUnfolderBase]: 4279/6193 cut-off events. [2025-04-14 00:01:00,275 INFO L117 PetriNetUnfolderBase]: For 2768/2768 co-relation queries the response was YES. [2025-04-14 00:01:00,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15115 conditions, 6193 events. 4279/6193 cut-off events. For 2768/2768 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31365 event pairs, 1766 based on Foata normal form. 180/6368 useless extension candidates. Maximal degree in co-relation 15101. Up to 5114 conditions per place. [2025-04-14 00:01:00,293 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 55 selfloop transitions, 8 changer transitions 29/95 dead transitions. [2025-04-14 00:01:00,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 474 flow [2025-04-14 00:01:00,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:01:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:01:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-04-14 00:01:00,296 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-04-14 00:01:00,296 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 108 flow. Second operand 7 states and 135 transitions. [2025-04-14 00:01:00,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 474 flow [2025-04-14 00:01:00,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 468 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:00,304 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 178 flow [2025-04-14 00:01:00,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-04-14 00:01:00,305 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-04-14 00:01:00,305 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 178 flow [2025-04-14 00:01:00,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-04-14 00:01:00,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:00,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:00,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:01:00,306 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:00,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1195684620, now seen corresponding path program 1 times [2025-04-14 00:01:00,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:00,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987227758] [2025-04-14 00:01:00,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:00,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:01:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:01:00,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:00,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:00,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:00,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987227758] [2025-04-14 00:01:00,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987227758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:00,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353749583] [2025-04-14 00:01:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:00,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:00,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:00,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:00,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-04-14 00:01:00,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:01,173 INFO L116 PetriNetUnfolderBase]: 4207/6081 cut-off events. [2025-04-14 00:01:01,173 INFO L117 PetriNetUnfolderBase]: For 8529/8529 co-relation queries the response was YES. [2025-04-14 00:01:01,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17567 conditions, 6081 events. 4207/6081 cut-off events. For 8529/8529 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30907 event pairs, 655 based on Foata normal form. 120/6195 useless extension candidates. Maximal degree in co-relation 17548. Up to 5069 conditions per place. [2025-04-14 00:01:01,199 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 60 selfloop transitions, 10 changer transitions 20/93 dead transitions. [2025-04-14 00:01:01,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 550 flow [2025-04-14 00:01:01,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:01:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:01:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-14 00:01:01,201 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2025-04-14 00:01:01,201 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 178 flow. Second operand 6 states and 121 transitions. [2025-04-14 00:01:01,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 550 flow [2025-04-14 00:01:01,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 524 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:01,215 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 220 flow [2025-04-14 00:01:01,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-04-14 00:01:01,216 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2025-04-14 00:01:01,216 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 220 flow [2025-04-14 00:01:01,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-04-14 00:01:01,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:01,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:01,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:01:01,216 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:01,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1183691340, now seen corresponding path program 2 times [2025-04-14 00:01:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:01,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781130470] [2025-04-14 00:01:01,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:01:01,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:01,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:01:01,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:01:01,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:01:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:01,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781130470] [2025-04-14 00:01:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781130470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474211459] [2025-04-14 00:01:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:01,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:01,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:01,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:01,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:01,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-04-14 00:01:01,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:01,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:01,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:01,995 INFO L116 PetriNetUnfolderBase]: 4120/5954 cut-off events. [2025-04-14 00:01:01,995 INFO L117 PetriNetUnfolderBase]: For 9804/9804 co-relation queries the response was YES. [2025-04-14 00:01:02,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17971 conditions, 5954 events. 4120/5954 cut-off events. For 9804/9804 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 29797 event pairs, 716 based on Foata normal form. 120/6068 useless extension candidates. Maximal degree in co-relation 17949. Up to 5029 conditions per place. [2025-04-14 00:01:02,024 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 58 selfloop transitions, 10 changer transitions 20/91 dead transitions. [2025-04-14 00:01:02,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 560 flow [2025-04-14 00:01:02,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:01:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:01:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-14 00:01:02,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2025-04-14 00:01:02,025 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 220 flow. Second operand 6 states and 119 transitions. [2025-04-14 00:01:02,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 560 flow [2025-04-14 00:01:02,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 536 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 00:01:02,039 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 232 flow [2025-04-14 00:01:02,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-04-14 00:01:02,040 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-04-14 00:01:02,040 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 232 flow [2025-04-14 00:01:02,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-04-14 00:01:02,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:02,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:02,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:01:02,040 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:02,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2044335074, now seen corresponding path program 1 times [2025-04-14 00:01:02,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:02,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626812169] [2025-04-14 00:01:02,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:02,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:01:02,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:01:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:02,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:02,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626812169] [2025-04-14 00:01:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626812169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:02,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:02,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:01:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846328636] [2025-04-14 00:01:02,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:02,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:02,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:02,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:02,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:02,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-04-14 00:01:02,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:02,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:02,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:03,159 INFO L116 PetriNetUnfolderBase]: 6184/8942 cut-off events. [2025-04-14 00:01:03,159 INFO L117 PetriNetUnfolderBase]: For 17225/17225 co-relation queries the response was YES. [2025-04-14 00:01:03,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27306 conditions, 8942 events. 6184/8942 cut-off events. For 17225/17225 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 47549 event pairs, 445 based on Foata normal form. 116/9052 useless extension candidates. Maximal degree in co-relation 27282. Up to 4585 conditions per place. [2025-04-14 00:01:03,191 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 84 selfloop transitions, 15 changer transitions 21/123 dead transitions. [2025-04-14 00:01:03,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 123 transitions, 852 flow [2025-04-14 00:01:03,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:01:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:01:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2025-04-14 00:01:03,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-14 00:01:03,196 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 232 flow. Second operand 7 states and 138 transitions. [2025-04-14 00:01:03,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 123 transitions, 852 flow [2025-04-14 00:01:03,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 790 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 00:01:03,211 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 352 flow [2025-04-14 00:01:03,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-04-14 00:01:03,213 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-04-14 00:01:03,213 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 352 flow [2025-04-14 00:01:03,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-04-14 00:01:03,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:03,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:03,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:01:03,214 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:03,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -422438766, now seen corresponding path program 2 times [2025-04-14 00:01:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:03,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913998389] [2025-04-14 00:01:03,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:01:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:03,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:01:03,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:01:03,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:01:03,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:03,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913998389] [2025-04-14 00:01:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913998389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:01:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747994025] [2025-04-14 00:01:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:03,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:01:03,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:03,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:01:03,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:01:03,343 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:03,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04-14 00:01:03,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:03,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:03,895 INFO L116 PetriNetUnfolderBase]: 5267/7847 cut-off events. [2025-04-14 00:01:03,896 INFO L117 PetriNetUnfolderBase]: For 13543/13546 co-relation queries the response was YES. [2025-04-14 00:01:03,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24336 conditions, 7847 events. 5267/7847 cut-off events. For 13543/13546 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 44296 event pairs, 776 based on Foata normal form. 411/8250 useless extension candidates. Maximal degree in co-relation 24309. Up to 4024 conditions per place. [2025-04-14 00:01:03,919 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 88 selfloop transitions, 5 changer transitions 5/101 dead transitions. [2025-04-14 00:01:03,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 774 flow [2025-04-14 00:01:03,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:01:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:01:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-14 00:01:03,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-04-14 00:01:03,920 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 352 flow. Second operand 4 states and 89 transitions. [2025-04-14 00:01:03,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 774 flow [2025-04-14 00:01:03,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 772 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:01:03,933 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 350 flow [2025-04-14 00:01:03,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2025-04-14 00:01:03,934 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-04-14 00:01:03,934 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 350 flow [2025-04-14 00:01:03,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04-14 00:01:03,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:03,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:03,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:01:03,934 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:03,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2086273795, now seen corresponding path program 1 times [2025-04-14 00:01:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:03,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421552964] [2025-04-14 00:01:03,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:03,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:01:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:01:03,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:03,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:04,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421552964] [2025-04-14 00:01:04,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421552964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:04,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:04,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424395728] [2025-04-14 00:01:04,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:04,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:01:04,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:04,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:01:04,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:01:04,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:04,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:04,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:04,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:04,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:04,445 INFO L116 PetriNetUnfolderBase]: 3181/4842 cut-off events. [2025-04-14 00:01:04,446 INFO L117 PetriNetUnfolderBase]: For 8604/8607 co-relation queries the response was YES. [2025-04-14 00:01:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15922 conditions, 4842 events. 3181/4842 cut-off events. For 8604/8607 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25388 event pairs, 435 based on Foata normal form. 294/5128 useless extension candidates. Maximal degree in co-relation 15892. Up to 1773 conditions per place. [2025-04-14 00:01:04,464 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 96 selfloop transitions, 8 changer transitions 5/112 dead transitions. [2025-04-14 00:01:04,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 112 transitions, 856 flow [2025-04-14 00:01:04,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:01:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:01:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-04-14 00:01:04,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-04-14 00:01:04,465 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 350 flow. Second operand 5 states and 114 transitions. [2025-04-14 00:01:04,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 112 transitions, 856 flow [2025-04-14 00:01:04,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 844 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:01:04,474 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 380 flow [2025-04-14 00:01:04,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2025-04-14 00:01:04,474 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-04-14 00:01:04,475 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 380 flow [2025-04-14 00:01:04,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:04,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:04,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:04,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:01:04,475 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:04,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1330419146, now seen corresponding path program 1 times [2025-04-14 00:01:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:04,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25612346] [2025-04-14 00:01:04,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:04,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:01:04,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:01:04,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:04,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:04,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25612346] [2025-04-14 00:01:04,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25612346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:04,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:04,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:01:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76098258] [2025-04-14 00:01:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:04,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:01:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:04,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:01:04,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:01:04,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:04,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:01:04,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:04,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:04,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:04,926 INFO L116 PetriNetUnfolderBase]: 2056/3143 cut-off events. [2025-04-14 00:01:04,926 INFO L117 PetriNetUnfolderBase]: For 6925/6928 co-relation queries the response was YES. [2025-04-14 00:01:04,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 3143 events. 2056/3143 cut-off events. For 6925/6928 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15423 event pairs, 348 based on Foata normal form. 108/3243 useless extension candidates. Maximal degree in co-relation 10710. Up to 1214 conditions per place. [2025-04-14 00:01:04,939 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 66 selfloop transitions, 11 changer transitions 23/103 dead transitions. [2025-04-14 00:01:04,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 801 flow [2025-04-14 00:01:04,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:01:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:01:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-04-14 00:01:04,940 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-04-14 00:01:04,940 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 380 flow. Second operand 6 states and 111 transitions. [2025-04-14 00:01:04,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 801 flow [2025-04-14 00:01:04,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 736 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-04-14 00:01:04,954 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 255 flow [2025-04-14 00:01:04,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2025-04-14 00:01:04,955 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-04-14 00:01:04,956 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 255 flow [2025-04-14 00:01:04,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:01:04,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:04,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:04,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:01:04,956 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:04,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1328772134, now seen corresponding path program 1 times [2025-04-14 00:01:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:04,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555168375] [2025-04-14 00:01:04,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:01:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:01:04,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:01:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:05,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555168375] [2025-04-14 00:01:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555168375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:01:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79223068] [2025-04-14 00:01:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:05,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:01:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:05,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:01:05,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:01:05,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:05,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-04-14 00:01:05,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:05,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:05,383 INFO L116 PetriNetUnfolderBase]: 1427/2256 cut-off events. [2025-04-14 00:01:05,384 INFO L117 PetriNetUnfolderBase]: For 4538/4538 co-relation queries the response was YES. [2025-04-14 00:01:05,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7621 conditions, 2256 events. 1427/2256 cut-off events. For 4538/4538 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10258 event pairs, 331 based on Foata normal form. 8/2261 useless extension candidates. Maximal degree in co-relation 7590. Up to 1348 conditions per place. [2025-04-14 00:01:05,392 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 47 selfloop transitions, 1 changer transitions 41/92 dead transitions. [2025-04-14 00:01:05,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 706 flow [2025-04-14 00:01:05,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:01:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:01:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-04-14 00:01:05,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-04-14 00:01:05,393 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 255 flow. Second operand 5 states and 94 transitions. [2025-04-14 00:01:05,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 706 flow [2025-04-14 00:01:05,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 525 flow, removed 39 selfloop flow, removed 16 redundant places. [2025-04-14 00:01:05,401 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 154 flow [2025-04-14 00:01:05,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-04-14 00:01:05,401 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-04-14 00:01:05,402 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 154 flow [2025-04-14 00:01:05,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-04-14 00:01:05,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:05,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:05,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:01:05,402 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:05,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1383737818, now seen corresponding path program 2 times [2025-04-14 00:01:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:05,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351456678] [2025-04-14 00:01:05,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:01:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:05,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:01:05,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:01:05,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:01:05,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:01:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:01:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:01:06,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351456678] [2025-04-14 00:01:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351456678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:01:06,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:01:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:01:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556937837] [2025-04-14 00:01:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:01:06,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:01:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:01:06,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:01:06,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:01:06,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:01:06,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 154 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:06,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:01:06,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:01:06,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:01:06,916 INFO L116 PetriNetUnfolderBase]: 1274/2054 cut-off events. [2025-04-14 00:01:06,916 INFO L117 PetriNetUnfolderBase]: For 1356/1356 co-relation queries the response was YES. [2025-04-14 00:01:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5514 conditions, 2054 events. 1274/2054 cut-off events. For 1356/1356 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9629 event pairs, 269 based on Foata normal form. 8/2059 useless extension candidates. Maximal degree in co-relation 5493. Up to 928 conditions per place. [2025-04-14 00:01:06,921 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 45 selfloop transitions, 3 changer transitions 48/99 dead transitions. [2025-04-14 00:01:06,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 554 flow [2025-04-14 00:01:06,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:01:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:01:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-04-14 00:01:06,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 00:01:06,922 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 154 flow. Second operand 8 states and 126 transitions. [2025-04-14 00:01:06,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 554 flow [2025-04-14 00:01:06,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 541 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-14 00:01:06,924 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 157 flow [2025-04-14 00:01:06,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2025-04-14 00:01:06,925 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-04-14 00:01:06,925 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 157 flow [2025-04-14 00:01:06,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:01:06,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:01:06,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:06,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:01:06,925 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:01:06,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:01:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -379158774, now seen corresponding path program 3 times [2025-04-14 00:01:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:01:06,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459725256] [2025-04-14 00:01:06,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:01:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:01:06,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:01:06,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:01:06,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:01:06,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:01:06,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:01:06,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:01:07,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:01:07,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:01:07,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:01:07,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:01:07,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:01:07,024 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:01:07,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:01:07,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:01:07,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:01:07,025 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:01:07,026 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:01:07,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:01:07,026 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-14 00:01:07,098 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:01:07,099 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:01:07,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:01:07 BasicIcfg [2025-04-14 00:01:07,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:01:07,104 INFO L158 Benchmark]: Toolchain (without parser) took 13282.91ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 108.7MB in the beginning and 363.3MB in the end (delta: -254.6MB). Peak memory consumption was 408.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,104 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:01:07,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.62ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 82.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.84ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,104 INFO L158 Benchmark]: Boogie Preprocessor took 55.27ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 76.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,104 INFO L158 Benchmark]: IcfgBuilder took 646.81ms. Allocated memory is still 155.2MB. Free memory was 76.4MB in the beginning and 87.1MB in the end (delta: -10.7MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,105 INFO L158 Benchmark]: TraceAbstraction took 12099.33ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 86.3MB in the beginning and 363.3MB in the end (delta: -277.0MB). Peak memory consumption was 384.3MB. Max. memory is 8.0GB. [2025-04-14 00:01:07,109 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.26ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 429.62ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 82.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.84ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.27ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 76.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 646.81ms. Allocated memory is still 155.2MB. Free memory was 76.4MB in the beginning and 87.1MB in the end (delta: -10.7MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12099.33ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 86.3MB in the beginning and 363.3MB in the end (delta: -277.0MB). Peak memory consumption was 384.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-2, t516=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-2, t516=-1, t517=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-2, t516=-1, t517=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-2, t516=-1, t517=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-2, t516=-1, t517=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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 7 procedures, 63 locations, 59 edges, 6 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: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 623 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 0 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=9, InterpolantAutomatonStates: 67, 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.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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-04-14 00:01:07,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...