/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:23:09,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:23:09,079 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-13 20:23:09,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:23:09,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:23:09,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:23:09,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:23:09,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:23:09,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:23:09,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:23:09,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:23:09,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:23:09,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:09,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:09,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:09,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:23:09,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:23:09,106 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 [2025-04-13 20:23:09,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:23:09,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:23:09,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:23:09,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:23:09,325 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:23:09,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 20:23:10,588 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a637c26d/1dfaef1cc22b4e3c9bb8ab716984b2d9/FLAG255fc62a6 [2025-04-13 20:23:10,771 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:23:10,772 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 20:23:10,801 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a637c26d/1dfaef1cc22b4e3c9bb8ab716984b2d9/FLAG255fc62a6 [2025-04-13 20:23:11,590 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a637c26d/1dfaef1cc22b4e3c9bb8ab716984b2d9 [2025-04-13 20:23:11,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:23:11,593 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:23:11,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:11,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:23:11,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:23:11,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c53aa41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11, skipping insertion in model container [2025-04-13 20:23:11,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:23:11,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 20:23:11,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:11,748 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:23:11,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 20:23:11,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:23:11,780 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:23:11,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11 WrapperNode [2025-04-13 20:23:11,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:23:11,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:11,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:23:11,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:23:11,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,805 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-04-13 20:23:11,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:23:11,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:23:11,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:23:11,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:23:11,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,829 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-13 20:23:11,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:23:11,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:23:11,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:23:11,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:23:11,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (1/1) ... [2025-04-13 20:23:11,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:23:11,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:11,865 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-13 20:23:11,867 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-13 20:23:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:23:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:23:11,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:23:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:23:11,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:23:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:23:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:23:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:23:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:23:11,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:23:11,885 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:23:11,950 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:23:11,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:23:12,069 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:23:12,070 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:23:12,070 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:23:12,180 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:23:12,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:12 BoogieIcfgContainer [2025-04-13 20:23:12,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:23:12,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:23:12,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:23:12,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:23:12,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:23:11" (1/3) ... [2025-04-13 20:23:12,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e15aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:12, skipping insertion in model container [2025-04-13 20:23:12,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:23:11" (2/3) ... [2025-04-13 20:23:12,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e15aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:23:12, skipping insertion in model container [2025-04-13 20:23:12,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:23:12" (3/3) ... [2025-04-13 20:23:12,189 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-04-13 20:23:12,198 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:23:12,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 23 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:23:12,199 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:23:12,239 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:23:12,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2025-04-13 20:23:12,293 INFO L116 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-04-13 20:23:12,296 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:23:12,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-13 20:23:12,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2025-04-13 20:23:12,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-13 20:23:12,311 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:23:12,319 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;@a96ae0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:23:12,319 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:23:12,326 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:23:12,326 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-13 20:23:12,326 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:23:12,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:12,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:12,327 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:12,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -666883249, now seen corresponding path program 1 times [2025-04-13 20:23:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:12,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309656087] [2025-04-13 20:23:12,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:12,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:23:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:23:12,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:12,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-13 20:23:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:12,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309656087] [2025-04-13 20:23:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309656087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:12,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:12,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:23:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115337599] [2025-04-13 20:23:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:12,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:23:12,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:12,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:23:12,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:23:12,744 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 24 [2025-04-13 20:23:12,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 20:23:12,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:12,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 24 [2025-04-13 20:23:12,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:12,867 INFO L116 PetriNetUnfolderBase]: 91/187 cut-off events. [2025-04-13 20:23:12,867 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 20:23:12,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 187 events. 91/187 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 712 event pairs, 16 based on Foata normal form. 14/196 useless extension candidates. Maximal degree in co-relation 330. Up to 77 conditions per place. [2025-04-13 20:23:12,870 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 27 selfloop transitions, 5 changer transitions 2/40 dead transitions. [2025-04-13 20:23:12,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 163 flow [2025-04-13 20:23:12,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:23:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:23:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-13 20:23:12,881 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-04-13 20:23:12,882 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 5 states and 76 transitions. [2025-04-13 20:23:12,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 163 flow [2025-04-13 20:23:12,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:23:12,887 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 83 flow [2025-04-13 20:23:12,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-04-13 20:23:12,891 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2025-04-13 20:23:12,891 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 83 flow [2025-04-13 20:23:12,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 20:23:12,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:12,892 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-13 20:23:12,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:23:12,892 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:12,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1839175152, now seen corresponding path program 1 times [2025-04-13 20:23:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:12,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76703505] [2025-04-13 20:23:12,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:12,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:23:12,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:23:12,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:12,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:13,592 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-13 20:23:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:13,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76703505] [2025-04-13 20:23:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76703505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:23:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064289159] [2025-04-13 20:23:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:13,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:23:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:23:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:23:13,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-13 20:23:13,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 83 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-13 20:23:13,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:13,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-13 20:23:13,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:14,106 INFO L116 PetriNetUnfolderBase]: 206/400 cut-off events. [2025-04-13 20:23:14,106 INFO L117 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-04-13 20:23:14,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 400 events. 206/400 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1587 event pairs, 17 based on Foata normal form. 6/406 useless extension candidates. Maximal degree in co-relation 355. Up to 217 conditions per place. [2025-04-13 20:23:14,109 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 39 selfloop transitions, 22 changer transitions 16/81 dead transitions. [2025-04-13 20:23:14,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 81 transitions, 395 flow [2025-04-13 20:23:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:23:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:23:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2025-04-13 20:23:14,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2025-04-13 20:23:14,110 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 83 flow. Second operand 15 states and 169 transitions. [2025-04-13 20:23:14,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 81 transitions, 395 flow [2025-04-13 20:23:14,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:14,113 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 238 flow [2025-04-13 20:23:14,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=238, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-04-13 20:23:14,113 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2025-04-13 20:23:14,113 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 238 flow [2025-04-13 20:23:14,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-13 20:23:14,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:14,114 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] [2025-04-13 20:23:14,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:23:14,114 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:14,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash -975104234, now seen corresponding path program 1 times [2025-04-13 20:23:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:14,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695276400] [2025-04-13 20:23:14,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:23:14,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:14,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:14,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:14,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695276400] [2025-04-13 20:23:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695276400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:14,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339452711] [2025-04-13 20:23:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:23:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:14,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:23:14,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:23:14,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:23:14,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:14,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:23:14,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:14,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:23:14,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:14,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339452711] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:14,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2025-04-13 20:23:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476282377] [2025-04-13 20:23:14,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:14,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:23:14,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:14,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:23:14,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:23:14,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-13 20:23:14,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 238 flow. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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-13 20:23:14,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:14,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-13 20:23:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:14,809 INFO L116 PetriNetUnfolderBase]: 528/1036 cut-off events. [2025-04-13 20:23:14,810 INFO L117 PetriNetUnfolderBase]: For 1643/1649 co-relation queries the response was YES. [2025-04-13 20:23:14,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1036 events. 528/1036 cut-off events. For 1643/1649 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5365 event pairs, 28 based on Foata normal form. 18/1036 useless extension candidates. Maximal degree in co-relation 2518. Up to 216 conditions per place. [2025-04-13 20:23:14,818 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 85 selfloop transitions, 42 changer transitions 1/137 dead transitions. [2025-04-13 20:23:14,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 137 transitions, 900 flow [2025-04-13 20:23:14,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:23:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:23:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 206 transitions. [2025-04-13 20:23:14,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-04-13 20:23:14,823 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 238 flow. Second operand 15 states and 206 transitions. [2025-04-13 20:23:14,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 137 transitions, 900 flow [2025-04-13 20:23:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 137 transitions, 859 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-04-13 20:23:14,837 INFO L231 Difference]: Finished difference. Result has 65 places, 76 transitions, 481 flow [2025-04-13 20:23:14,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=481, PETRI_PLACES=65, PETRI_TRANSITIONS=76} [2025-04-13 20:23:14,838 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-04-13 20:23:14,838 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 481 flow [2025-04-13 20:23:14,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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-13 20:23:14,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:14,838 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] [2025-04-13 20:23:14,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:23:15,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:15,043 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:15,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash -450079094, now seen corresponding path program 2 times [2025-04-13 20:23:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:15,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426032144] [2025-04-13 20:23:15,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:15,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:23:15,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:15,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:15,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:15,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426032144] [2025-04-13 20:23:15,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426032144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:15,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607532921] [2025-04-13 20:23:15,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:15,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:15,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:23:15,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:23:15,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:23:15,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:23:15,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:23:15,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:15,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:23:15,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:16,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607532921] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:16,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-13 20:23:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911488621] [2025-04-13 20:23:16,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:16,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:23:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:16,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:23:16,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:23:16,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-13 20:23:16,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 481 flow. Second operand has 20 states, 20 states have (on average 9.0) internal successors, (180), 20 states have internal predecessors, (180), 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-13 20:23:16,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:16,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-13 20:23:16,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:19,071 INFO L116 PetriNetUnfolderBase]: 1252/2536 cut-off events. [2025-04-13 20:23:19,071 INFO L117 PetriNetUnfolderBase]: For 6501/6583 co-relation queries the response was YES. [2025-04-13 20:23:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9278 conditions, 2536 events. 1252/2536 cut-off events. For 6501/6583 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17124 event pairs, 50 based on Foata normal form. 41/2538 useless extension candidates. Maximal degree in co-relation 6421. Up to 605 conditions per place. [2025-04-13 20:23:19,089 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 148 selfloop transitions, 127 changer transitions 69/353 dead transitions. [2025-04-13 20:23:19,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 353 transitions, 2737 flow [2025-04-13 20:23:19,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:23:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:23:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 539 transitions. [2025-04-13 20:23:19,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5222868217054264 [2025-04-13 20:23:19,092 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 481 flow. Second operand 43 states and 539 transitions. [2025-04-13 20:23:19,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 353 transitions, 2737 flow [2025-04-13 20:23:19,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 353 transitions, 2653 flow, removed 34 selfloop flow, removed 4 redundant places. [2025-04-13 20:23:19,110 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 1698 flow [2025-04-13 20:23:19,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1698, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2025-04-13 20:23:19,112 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 96 predicate places. [2025-04-13 20:23:19,112 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 1698 flow [2025-04-13 20:23:19,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.0) internal successors, (180), 20 states have internal predecessors, (180), 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-13 20:23:19,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:19,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:19,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:23:19,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 20:23:19,313 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:19,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash 185416525, now seen corresponding path program 2 times [2025-04-13 20:23:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:19,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727912554] [2025-04-13 20:23:19,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:23:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:19,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:23:19,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-13 20:23:19,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:23:19,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:23:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:19,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727912554] [2025-04-13 20:23:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727912554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:23:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360863252] [2025-04-13 20:23:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:19,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:23:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:19,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:23:19,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:23:19,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-13 20:23:19,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 1698 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-13 20:23:19,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:19,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-13 20:23:19,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:19,837 INFO L116 PetriNetUnfolderBase]: 1614/3113 cut-off events. [2025-04-13 20:23:19,837 INFO L117 PetriNetUnfolderBase]: For 12047/12129 co-relation queries the response was YES. [2025-04-13 20:23:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13349 conditions, 3113 events. 1614/3113 cut-off events. For 12047/12129 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20754 event pairs, 212 based on Foata normal form. 14/3077 useless extension candidates. Maximal degree in co-relation 13172. Up to 883 conditions per place. [2025-04-13 20:23:19,861 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 245 selfloop transitions, 127 changer transitions 0/387 dead transitions. [2025-04-13 20:23:19,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 387 transitions, 4249 flow [2025-04-13 20:23:19,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:23:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:23:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-04-13 20:23:19,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-04-13 20:23:19,862 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 1698 flow. Second operand 7 states and 100 transitions. [2025-04-13 20:23:19,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 387 transitions, 4249 flow [2025-04-13 20:23:19,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 387 transitions, 3966 flow, removed 114 selfloop flow, removed 17 redundant places. [2025-04-13 20:23:19,945 INFO L231 Difference]: Finished difference. Result has 104 places, 272 transitions, 2792 flow [2025-04-13 20:23:19,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2792, PETRI_PLACES=104, PETRI_TRANSITIONS=272} [2025-04-13 20:23:19,946 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 78 predicate places. [2025-04-13 20:23:19,946 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 272 transitions, 2792 flow [2025-04-13 20:23:19,946 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-13 20:23:19,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:19,947 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:19,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:23:19,947 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:19,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 67288203, now seen corresponding path program 3 times [2025-04-13 20:23:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:19,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058357147] [2025-04-13 20:23:19,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:19,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:23:19,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-13 20:23:19,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:23:19,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:23:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:20,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058357147] [2025-04-13 20:23:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058357147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:23:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519556470] [2025-04-13 20:23:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:20,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:23:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:23:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:23:20,078 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-13 20:23:20,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 272 transitions, 2792 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-13 20:23:20,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:20,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-13 20:23:20,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:20,504 INFO L116 PetriNetUnfolderBase]: 1641/3191 cut-off events. [2025-04-13 20:23:20,505 INFO L117 PetriNetUnfolderBase]: For 14774/14858 co-relation queries the response was YES. [2025-04-13 20:23:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15154 conditions, 3191 events. 1641/3191 cut-off events. For 14774/14858 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21442 event pairs, 307 based on Foata normal form. 16/3178 useless extension candidates. Maximal degree in co-relation 14214. Up to 938 conditions per place. [2025-04-13 20:23:20,533 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 209 selfloop transitions, 129 changer transitions 0/353 dead transitions. [2025-04-13 20:23:20,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 353 transitions, 4093 flow [2025-04-13 20:23:20,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:23:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:23:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-04-13 20:23:20,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-04-13 20:23:20,534 INFO L175 Difference]: Start difference. First operand has 104 places, 272 transitions, 2792 flow. Second operand 7 states and 100 transitions. [2025-04-13 20:23:20,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 353 transitions, 4093 flow [2025-04-13 20:23:20,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 353 transitions, 4047 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-04-13 20:23:20,596 INFO L231 Difference]: Finished difference. Result has 114 places, 277 transitions, 3170 flow [2025-04-13 20:23:20,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3170, PETRI_PLACES=114, PETRI_TRANSITIONS=277} [2025-04-13 20:23:20,597 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 88 predicate places. [2025-04-13 20:23:20,597 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 277 transitions, 3170 flow [2025-04-13 20:23:20,597 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-13 20:23:20,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:20,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:20,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:23:20,597 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:20,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1303948427, now seen corresponding path program 4 times [2025-04-13 20:23:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:20,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609339439] [2025-04-13 20:23:20,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:20,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:23:20,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:23:20,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:20,709 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-13 20:23:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:20,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609339439] [2025-04-13 20:23:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609339439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:23:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:23:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:23:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325845052] [2025-04-13 20:23:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:23:20,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:23:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:20,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:23:20,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:23:20,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-13 20:23:20,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 277 transitions, 3170 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 20:23:20,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:20,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-13 20:23:20,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:21,236 INFO L116 PetriNetUnfolderBase]: 2564/4556 cut-off events. [2025-04-13 20:23:21,236 INFO L117 PetriNetUnfolderBase]: For 27017/27156 co-relation queries the response was YES. [2025-04-13 20:23:21,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22725 conditions, 4556 events. 2564/4556 cut-off events. For 27017/27156 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 29076 event pairs, 187 based on Foata normal form. 70/4622 useless extension candidates. Maximal degree in co-relation 21394. Up to 1257 conditions per place. [2025-04-13 20:23:21,265 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 372 selfloop transitions, 191 changer transitions 1/578 dead transitions. [2025-04-13 20:23:21,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 578 transitions, 7682 flow [2025-04-13 20:23:21,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:23:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:23:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2025-04-13 20:23:21,266 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-13 20:23:21,267 INFO L175 Difference]: Start difference. First operand has 114 places, 277 transitions, 3170 flow. Second operand 7 states and 88 transitions. [2025-04-13 20:23:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 578 transitions, 7682 flow [2025-04-13 20:23:21,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 578 transitions, 7423 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-04-13 20:23:21,338 INFO L231 Difference]: Finished difference. Result has 122 places, 388 transitions, 5378 flow [2025-04-13 20:23:21,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2994, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5378, PETRI_PLACES=122, PETRI_TRANSITIONS=388} [2025-04-13 20:23:21,339 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 96 predicate places. [2025-04-13 20:23:21,339 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 5378 flow [2025-04-13 20:23:21,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-13 20:23:21,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:21,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:23:21,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:23:21,340 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:21,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -592243006, now seen corresponding path program 3 times [2025-04-13 20:23:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:21,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425512227] [2025-04-13 20:23:21,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:21,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:21,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:21,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:23:21,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:21,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:21,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425512227] [2025-04-13 20:23:21,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425512227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:21,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428031192] [2025-04-13 20:23:21,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:23:21,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:21,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:23:21,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:23:21,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:23:22,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:23:22,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:23:22,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:22,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:23:22,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:30,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:23:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428031192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:31,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-13 20:23:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188083571] [2025-04-13 20:23:31,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:31,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:23:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:31,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:23:31,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=398, Unknown=2, NotChecked=0, Total=506 [2025-04-13 20:23:35,810 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:39,861 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:39,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-13 20:23:39,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 5378 flow. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 23 states have internal predecessors, (170), 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-13 20:23:39,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:39,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-13 20:23:39,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:48,248 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:23:57,113 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 48 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:24:00,185 INFO L116 PetriNetUnfolderBase]: 4832/8635 cut-off events. [2025-04-13 20:24:00,186 INFO L117 PetriNetUnfolderBase]: For 64839/64871 co-relation queries the response was YES. [2025-04-13 20:24:00,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48563 conditions, 8635 events. 4832/8635 cut-off events. For 64839/64871 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 61605 event pairs, 84 based on Foata normal form. 46/8680 useless extension candidates. Maximal degree in co-relation 46204. Up to 3141 conditions per place. [2025-04-13 20:24:00,240 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 551 selfloop transitions, 323 changer transitions 88/967 dead transitions. [2025-04-13 20:24:00,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 967 transitions, 13773 flow [2025-04-13 20:24:00,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:24:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:24:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 519 transitions. [2025-04-13 20:24:00,244 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4701086956521739 [2025-04-13 20:24:00,244 INFO L175 Difference]: Start difference. First operand has 122 places, 388 transitions, 5378 flow. Second operand 46 states and 519 transitions. [2025-04-13 20:24:00,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 967 transitions, 13773 flow [2025-04-13 20:24:00,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 967 transitions, 13715 flow, removed 29 selfloop flow, removed 0 redundant places. [2025-04-13 20:24:00,455 INFO L231 Difference]: Finished difference. Result has 189 places, 641 transitions, 10126 flow [2025-04-13 20:24:00,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5366, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=10126, PETRI_PLACES=189, PETRI_TRANSITIONS=641} [2025-04-13 20:24:00,456 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 163 predicate places. [2025-04-13 20:24:00,456 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 641 transitions, 10126 flow [2025-04-13 20:24:00,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 23 states have internal predecessors, (170), 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-13 20:24:00,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:00,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:00,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:24:00,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:00,656 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:24:00,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -62215798, now seen corresponding path program 4 times [2025-04-13 20:24:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:00,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401331825] [2025-04-13 20:24:00,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:24:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:00,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:24:00,670 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:24:00,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:24:00,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:01,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401331825] [2025-04-13 20:24:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401331825] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:01,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537405749] [2025-04-13 20:24:01,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:24:01,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:01,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:01,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:01,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:24:01,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:24:02,002 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:24:02,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:24:02,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:02,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:24:02,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:02,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537405749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:05,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-04-13 20:24:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852770748] [2025-04-13 20:24:05,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:05,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:24:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:05,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:24:05,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:24:05,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-13 20:24:05,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 641 transitions, 10126 flow. Second operand has 25 states, 25 states have (on average 9.28) internal successors, (232), 25 states have internal predecessors, (232), 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-13 20:24:05,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:05,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-13 20:24:05,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:15,310 INFO L116 PetriNetUnfolderBase]: 5106/9825 cut-off events. [2025-04-13 20:24:15,310 INFO L117 PetriNetUnfolderBase]: For 103471/104225 co-relation queries the response was YES. [2025-04-13 20:24:15,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61819 conditions, 9825 events. 5106/9825 cut-off events. For 103471/104225 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 78202 event pairs, 80 based on Foata normal form. 590/10380 useless extension candidates. Maximal degree in co-relation 61677. Up to 3642 conditions per place. [2025-04-13 20:24:15,395 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 611 selfloop transitions, 382 changer transitions 97/1109 dead transitions. [2025-04-13 20:24:15,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1109 transitions, 18312 flow [2025-04-13 20:24:15,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:24:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:24:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 563 transitions. [2025-04-13 20:24:15,397 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.509963768115942 [2025-04-13 20:24:15,398 INFO L175 Difference]: Start difference. First operand has 189 places, 641 transitions, 10126 flow. Second operand 46 states and 563 transitions. [2025-04-13 20:24:15,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1109 transitions, 18312 flow [2025-04-13 20:24:15,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1109 transitions, 18011 flow, removed 120 selfloop flow, removed 9 redundant places. [2025-04-13 20:24:15,851 INFO L231 Difference]: Finished difference. Result has 240 places, 836 transitions, 14470 flow [2025-04-13 20:24:15,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9891, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=14470, PETRI_PLACES=240, PETRI_TRANSITIONS=836} [2025-04-13 20:24:15,852 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 214 predicate places. [2025-04-13 20:24:15,852 INFO L485 AbstractCegarLoop]: Abstraction has has 240 places, 836 transitions, 14470 flow [2025-04-13 20:24:15,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.28) internal successors, (232), 25 states have internal predecessors, (232), 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-13 20:24:15,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:15,852 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:15,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:24:16,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:16,053 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:24:16,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1382807036, now seen corresponding path program 5 times [2025-04-13 20:24:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:16,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602884100] [2025-04-13 20:24:16,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:24:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:16,056 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 20:24:16,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:24:16,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:24:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:16,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602884100] [2025-04-13 20:24:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602884100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:16,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777975982] [2025-04-13 20:24:16,571 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:24:16,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:16,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:16,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:24:16,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 20:24:16,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:24:16,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 20:24:16,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:16,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:24:16,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:17,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:17,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777975982] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:17,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:17,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2025-04-13 20:24:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694426116] [2025-04-13 20:24:17,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:17,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:24:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:24:17,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:24:17,854 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-13 20:24:17,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 836 transitions, 14470 flow. Second operand has 34 states, 34 states have (on average 6.117647058823529) internal successors, (208), 34 states have internal predecessors, (208), 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-13 20:24:17,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:17,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-13 20:24:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:29,307 INFO L116 PetriNetUnfolderBase]: 10825/18332 cut-off events. [2025-04-13 20:24:29,307 INFO L117 PetriNetUnfolderBase]: For 226109/226109 co-relation queries the response was YES. [2025-04-13 20:24:29,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125037 conditions, 18332 events. 10825/18332 cut-off events. For 226109/226109 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 133647 event pairs, 161 based on Foata normal form. 21/18353 useless extension candidates. Maximal degree in co-relation 124827. Up to 4040 conditions per place. [2025-04-13 20:24:29,462 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 864 selfloop transitions, 1337 changer transitions 121/2324 dead transitions. [2025-04-13 20:24:29,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 2324 transitions, 41349 flow [2025-04-13 20:24:29,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-04-13 20:24:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-04-13 20:24:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 974 transitions. [2025-04-13 20:24:29,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3656156156156156 [2025-04-13 20:24:29,465 INFO L175 Difference]: Start difference. First operand has 240 places, 836 transitions, 14470 flow. Second operand 111 states and 974 transitions. [2025-04-13 20:24:29,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 2324 transitions, 41349 flow [2025-04-13 20:24:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 2324 transitions, 40713 flow, removed 267 selfloop flow, removed 16 redundant places. [2025-04-13 20:24:30,682 INFO L231 Difference]: Finished difference. Result has 385 places, 1707 transitions, 33675 flow [2025-04-13 20:24:30,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=14105, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=559, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=33675, PETRI_PLACES=385, PETRI_TRANSITIONS=1707} [2025-04-13 20:24:30,684 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 359 predicate places. [2025-04-13 20:24:30,684 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 1707 transitions, 33675 flow [2025-04-13 20:24:30,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.117647058823529) internal successors, (208), 34 states have internal predecessors, (208), 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-13 20:24:30,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:24:30,684 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:24:30,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:24:30,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:24:30,885 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:24:30,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:24:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash -55387982, now seen corresponding path program 5 times [2025-04-13 20:24:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:24:30,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459165759] [2025-04-13 20:24:30,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:24:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:24:30,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:24:30,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:24:30,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:24:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:24:31,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459165759] [2025-04-13 20:24:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459165759] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:24:31,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616753140] [2025-04-13 20:24:31,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:24:31,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:24:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:24:31,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:24:31,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:24:31,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:24:31,710 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:24:31,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:24:31,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:24:31,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:24:31,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:24:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:32,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:24:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:24:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616753140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:24:33,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:24:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-04-13 20:24:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063973349] [2025-04-13 20:24:33,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:24:33,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:24:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:24:33,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:24:33,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:24:33,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-13 20:24:33,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1707 transitions, 33675 flow. Second operand has 26 states, 26 states have (on average 9.115384615384615) internal successors, (237), 26 states have internal predecessors, (237), 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-13 20:24:33,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:24:33,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-13 20:24:33,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:24:45,522 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:24:58,494 INFO L116 PetriNetUnfolderBase]: 9384/18086 cut-off events. [2025-04-13 20:24:58,494 INFO L117 PetriNetUnfolderBase]: For 520225/521421 co-relation queries the response was YES. [2025-04-13 20:24:58,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164038 conditions, 18086 events. 9384/18086 cut-off events. For 520225/521421 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 157563 event pairs, 98 based on Foata normal form. 917/18966 useless extension candidates. Maximal degree in co-relation 163793. Up to 7229 conditions per place. [2025-04-13 20:24:58,698 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 1453 selfloop transitions, 893 changer transitions 105/2510 dead transitions. [2025-04-13 20:24:58,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 2510 transitions, 52256 flow [2025-04-13 20:24:58,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 20:24:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 20:24:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 771 transitions. [2025-04-13 20:24:58,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5266393442622951 [2025-04-13 20:24:58,701 INFO L175 Difference]: Start difference. First operand has 385 places, 1707 transitions, 33675 flow. Second operand 61 states and 771 transitions. [2025-04-13 20:24:58,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 2510 transitions, 52256 flow [2025-04-13 20:25:03,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 2510 transitions, 49125 flow, removed 1535 selfloop flow, removed 21 redundant places. [2025-04-13 20:25:03,946 INFO L231 Difference]: Finished difference. Result has 446 places, 2076 transitions, 42216 flow [2025-04-13 20:25:03,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=31488, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=42216, PETRI_PLACES=446, PETRI_TRANSITIONS=2076} [2025-04-13 20:25:03,947 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 420 predicate places. [2025-04-13 20:25:03,947 INFO L485 AbstractCegarLoop]: Abstraction has has 446 places, 2076 transitions, 42216 flow [2025-04-13 20:25:03,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.115384615384615) internal successors, (237), 26 states have internal predecessors, (237), 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-13 20:25:03,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:03,948 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:03,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:25:04,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:04,148 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:25:04,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -979901810, now seen corresponding path program 6 times [2025-04-13 20:25:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:04,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797438840] [2025-04-13 20:25:04,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:25:04,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:04,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:25:04,164 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:25:04,164 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:25:04,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:12,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797438840] [2025-04-13 20:25:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797438840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:12,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578020574] [2025-04-13 20:25:12,819 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:25:12,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:12,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:12,821 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:25:12,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:25:12,844 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:25:12,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:25:12,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:25:12,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:12,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:25:12,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:45,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578020574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:25:46,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:25:46,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-04-13 20:25:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207208592] [2025-04-13 20:25:46,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:25:46,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 20:25:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:46,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 20:25:46,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=694, Unknown=8, NotChecked=0, Total=870 [2025-04-13 20:25:50,685 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:25:54,716 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:25:54,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-13 20:25:54,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 2076 transitions, 42216 flow. Second operand has 30 states, 30 states have (on average 7.066666666666666) internal successors, (212), 30 states have internal predecessors, (212), 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-13 20:25:54,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:54,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-13 20:25:54,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:14,872 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 56 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:26:32,327 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:26:45,149 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:26:47,235 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:27:12,014 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 45 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:27:50,238 WARN L286 SmtUtils]: Spent 33.55s on a formula simplification. DAG size of input: 63 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:28:01,635 WARN L286 SmtUtils]: Spent 10.91s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:28:14,396 INFO L116 PetriNetUnfolderBase]: 12629/22468 cut-off events. [2025-04-13 20:28:14,397 INFO L117 PetriNetUnfolderBase]: For 587577/587709 co-relation queries the response was YES. [2025-04-13 20:28:14,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203459 conditions, 22468 events. 12629/22468 cut-off events. For 587577/587709 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 183304 event pairs, 116 based on Foata normal form. 119/22584 useless extension candidates. Maximal degree in co-relation 203127. Up to 10082 conditions per place. [2025-04-13 20:28:14,698 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 1756 selfloop transitions, 1053 changer transitions 135/2964 dead transitions. [2025-04-13 20:28:14,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 2964 transitions, 63080 flow [2025-04-13 20:28:14,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 20:28:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-04-13 20:28:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 767 transitions. [2025-04-13 20:28:14,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45011737089201875 [2025-04-13 20:28:14,701 INFO L175 Difference]: Start difference. First operand has 446 places, 2076 transitions, 42216 flow. Second operand 71 states and 767 transitions. [2025-04-13 20:28:14,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 2964 transitions, 63080 flow [2025-04-13 20:28:21,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 2964 transitions, 61126 flow, removed 485 selfloop flow, removed 17 redundant places. [2025-04-13 20:28:21,065 INFO L231 Difference]: Finished difference. Result has 519 places, 2400 transitions, 51385 flow [2025-04-13 20:28:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=40551, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=751, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=51385, PETRI_PLACES=519, PETRI_TRANSITIONS=2400} [2025-04-13 20:28:21,067 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 493 predicate places. [2025-04-13 20:28:21,067 INFO L485 AbstractCegarLoop]: Abstraction has has 519 places, 2400 transitions, 51385 flow [2025-04-13 20:28:21,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.066666666666666) internal successors, (212), 30 states have internal predecessors, (212), 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-13 20:28:21,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:21,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:21,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:28:21,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:21,268 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:28:21,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 731566248, now seen corresponding path program 7 times [2025-04-13 20:28:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:21,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003511483] [2025-04-13 20:28:21,269 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:28:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:21,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:28:21,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:28:21,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:28:21,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:22,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003511483] [2025-04-13 20:28:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003511483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:22,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006150026] [2025-04-13 20:28:22,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:28:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:22,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:28:22,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:28:22,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:28:22,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:28:22,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:28:22,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:22,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:28:22,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:27,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006150026] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:30,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2025-04-13 20:29:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536346971] [2025-04-13 20:29:30,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:30,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:29:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:30,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:29:30,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=882, Unknown=15, NotChecked=0, Total=1122 [2025-04-13 20:29:34,887 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:38,904 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:42,923 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:42,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-13 20:29:42,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 2400 transitions, 51385 flow. Second operand has 34 states, 34 states have (on average 6.823529411764706) internal successors, (232), 34 states have internal predecessors, (232), 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-13 20:29:42,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:42,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-13 20:29:42,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:47,012 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:51,024 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:57,588 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:04,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:14,369 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:18,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:23,746 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:27,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:42,900 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:46,910 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:50,914 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:55,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:59,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:03,454 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:07,459 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:11,465 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:15,468 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:19,480 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:23,495 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:27,519 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:40,410 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:44,421 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:48,425 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:31:52,429 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:08,548 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:12,561 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:16,565 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:20,569 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:24,573 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:28,580 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:32,589 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:36,594 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:40,598 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:45,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:49,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:53,228 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:32:57,650 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:01,669 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:05,673 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:09,678 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:13,746 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:17,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:21,762 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:25,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:29,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:34,072 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:33:54,903 WARN L286 SmtUtils]: Spent 12.78s on a formula simplification. DAG size of input: 60 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:33:58,918 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:02,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:06,931 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:11,451 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:15,455 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:19,742 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:23,752 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:27,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:31,760 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:35,780 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:39,792 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:43,809 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:34:47,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:06,406 WARN L286 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 68 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:35:10,423 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:14,434 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:18,659 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:22,668 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:26,672 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:27,956 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:32,119 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:36,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:40,149 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:44,158 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:48,195 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:52,209 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:35:56,228 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:08,932 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:12,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:16,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:20,973 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:25,001 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:29,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:33,027 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:37,551 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:41,565 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:45,579 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:49,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:53,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:36:57,617 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:37:01,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:37:07,836 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:37:24,426 WARN L286 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 85 DAG size of output: 63 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:37:31,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 20:37:39,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:37:39,339 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:37:40,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:37:40,546 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:37:40,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:37:40,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 20:37:40,558 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:37:40,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:37:40,558 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:37:40,560 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:37:40,560 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:37:40,560 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1] [2025-04-13 20:37:40,562 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:37:40,562 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:37:40,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:37:40 BasicIcfg [2025-04-13 20:37:40,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:37:40,565 INFO L158 Benchmark]: Toolchain (without parser) took 868972.59ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 113.0MB in the beginning and 714.2MB in the end (delta: -601.2MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 20:37:40,565 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:40,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.47ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 98.1MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:37:40,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.85ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:40,566 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 155.2MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:37:40,566 INFO L158 Benchmark]: RCFGBuilder took 343.47ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 68.8MB in the end (delta: 26.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:37:40,566 INFO L158 Benchmark]: TraceAbstraction took 868382.71ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 68.2MB in the beginning and 714.2MB in the end (delta: -646.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 20:37:40,567 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.47ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 98.1MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.85ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 155.2MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 343.47ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 68.8MB in the end (delta: 26.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 868382.71ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 68.2MB in the beginning and 714.2MB in the end (delta: -646.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 868.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 732.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 92 mSolverCounterUnknown, 2720 SdHoareTripleChecker+Valid, 399.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2672 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 397.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 379 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11684 IncrementalHoareTripleChecker+Invalid, 12155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 379 mSolverCounterUnsat, 25 mSDtfsCounter, 11684 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 279 SyntacticMatches, 10 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13395 ImplicationChecksByTransitivity, 411.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51385occurred in iteration=12, InterpolantAutomatonStates: 434, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 133.7s InterpolantComputationTime, 492 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 17303 SizeOfPredicates, 54 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 9/114 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 could not prove your program: Timeout Completed graceful shutdown