./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:13:32,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:13:32,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:13:32,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:13:32,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:13:32,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:13:32,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:13:32,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:13:32,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:13:32,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:13:32,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:13:32,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:13:32,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:13:32,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:13:32,305 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:13:32,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:13:32,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:13:32,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:32,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:13:32,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:13:32,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:13:32,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:13:32,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:13:32,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-03-14 01:13:32,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:13:32,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:13:32,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:13:32,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:13:32,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:13:32,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-03-14 01:13:33,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a78b2e5/d7ed1c51649d4bc7a30145f545467f32/FLAGfd4860066 [2025-03-14 01:13:33,876 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:13:33,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-03-14 01:13:33,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a78b2e5/d7ed1c51649d4bc7a30145f545467f32/FLAGfd4860066 [2025-03-14 01:13:33,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a78b2e5/d7ed1c51649d4bc7a30145f545467f32 [2025-03-14 01:13:33,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:13:33,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:13:33,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:33,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:13:33,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:13:33,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:33" (1/1) ... [2025-03-14 01:13:33,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63eb79f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:33, skipping insertion in model container [2025-03-14 01:13:33,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:33" (1/1) ... [2025-03-14 01:13:33,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:13:34,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2025-03-14 01:13:34,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:34,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:13:34,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i[33026,33039] [2025-03-14 01:13:34,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:34,265 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:13:34,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34 WrapperNode [2025-03-14 01:13:34,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:34,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:34,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:13:34,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:13:34,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,295 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-14 01:13:34,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:34,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:13:34,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:13:34,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:13:34,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-14 01:13:34,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:13:34,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:13:34,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:13:34,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:13:34,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (1/1) ... [2025-03-14 01:13:34,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:34,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:13:34,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:13:34,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:13:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-14 01:13:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-14 01:13:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-14 01:13:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-14 01:13:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:13:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:13:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:13:34,367 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:13:34,479 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:13:34,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:13:34,619 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:13:34,620 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:13:34,620 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:13:34,702 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:13:34,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:34 BoogieIcfgContainer [2025-03-14 01:13:34,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:13:34,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:13:34,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:13:34,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:13:34,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:13:33" (1/3) ... [2025-03-14 01:13:34,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d21d403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:34, skipping insertion in model container [2025-03-14 01:13:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:34" (2/3) ... [2025-03-14 01:13:34,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d21d403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:34, skipping insertion in model container [2025-03-14 01:13:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:34" (3/3) ... [2025-03-14 01:13:34,712 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-03-14 01:13:34,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:13:34,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-14 01:13:34,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:13:34,757 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:13:34,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2025-03-14 01:13:34,799 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-03-14 01:13:34,802 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:13:34,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-14 01:13:34,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2025-03-14 01:13:34,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 49 flow [2025-03-14 01:13:34,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:13:34,820 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d7a4e40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:13:34,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:13:34,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:13:34,825 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-03-14 01:13:34,825 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:13:34,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:34,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:34,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:34,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -649076899, now seen corresponding path program 1 times [2025-03-14 01:13:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551875037] [2025-03-14 01:13:34,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:34,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 01:13:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 01:13:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551875037] [2025-03-14 01:13:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551875037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:13:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668381850] [2025-03-14 01:13:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:35,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:13:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:13:35,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:13:35,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:35,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 49 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:35,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:35,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:35,295 INFO L124 PetriNetUnfolderBase]: 203/358 cut-off events. [2025-03-14 01:13:35,296 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-14 01:13:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 358 events. 203/358 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1342 event pairs, 83 based on Foata normal form. 13/310 useless extension candidates. Maximal degree in co-relation 672. Up to 186 conditions per place. [2025-03-14 01:13:35,299 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 22 selfloop transitions, 3 changer transitions 21/47 dead transitions. [2025-03-14 01:13:35,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 47 transitions, 204 flow [2025-03-14 01:13:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:13:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:13:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-03-14 01:13:35,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-14 01:13:35,308 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 49 flow. Second operand 6 states and 66 transitions. [2025-03-14 01:13:35,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 47 transitions, 204 flow [2025-03-14 01:13:35,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 47 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:35,314 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 54 flow [2025-03-14 01:13:35,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=54, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2025-03-14 01:13:35,318 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2025-03-14 01:13:35,318 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 54 flow [2025-03-14 01:13:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:35,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:35,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:13:35,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:35,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1353421958, now seen corresponding path program 1 times [2025-03-14 01:13:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276927071] [2025-03-14 01:13:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:35,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 01:13:35,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 01:13:35,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:35,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276927071] [2025-03-14 01:13:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276927071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:13:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552207703] [2025-03-14 01:13:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:13:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:35,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:13:35,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:13:35,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-14 01:13:35,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:35,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-14 01:13:35,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:35,477 INFO L124 PetriNetUnfolderBase]: 53/117 cut-off events. [2025-03-14 01:13:35,477 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-14 01:13:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 117 events. 53/117 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 318 event pairs, 18 based on Foata normal form. 13/119 useless extension candidates. Maximal degree in co-relation 261. Up to 55 conditions per place. [2025-03-14 01:13:35,479 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 16 selfloop transitions, 3 changer transitions 10/31 dead transitions. [2025-03-14 01:13:35,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 144 flow [2025-03-14 01:13:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:13:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:13:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-14 01:13:35,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-14 01:13:35,480 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 54 flow. Second operand 5 states and 55 transitions. [2025-03-14 01:13:35,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 144 flow [2025-03-14 01:13:35,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 135 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:35,481 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 61 flow [2025-03-14 01:13:35,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2025-03-14 01:13:35,481 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2025-03-14 01:13:35,482 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 61 flow [2025-03-14 01:13:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:35,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:35,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:13:35,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:35,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1607046882, now seen corresponding path program 1 times [2025-03-14 01:13:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408347493] [2025-03-14 01:13:35,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:35,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:35,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:35,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:35,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:35,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408347493] [2025-03-14 01:13:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408347493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979603169] [2025-03-14 01:13:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:35,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:35,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:35,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:35,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:13:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:35,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:35,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:35,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:13:35,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:35,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979603169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:35,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:35,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-14 01:13:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359510856] [2025-03-14 01:13:35,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:35,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:13:35,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:35,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:13:35,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:13:35,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:35,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 61 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:35,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:35,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:35,934 INFO L124 PetriNetUnfolderBase]: 59/125 cut-off events. [2025-03-14 01:13:35,935 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:13:35,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 125 events. 59/125 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 282 event pairs, 18 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 240. Up to 54 conditions per place. [2025-03-14 01:13:35,940 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 27 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2025-03-14 01:13:35,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 179 flow [2025-03-14 01:13:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:13:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:13:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2025-03-14 01:13:35,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-03-14 01:13:35,941 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 61 flow. Second operand 8 states and 62 transitions. [2025-03-14 01:13:35,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 179 flow [2025-03-14 01:13:35,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 169 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-14 01:13:35,942 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 93 flow [2025-03-14 01:13:35,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2025-03-14 01:13:35,942 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-03-14 01:13:35,943 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 93 flow [2025-03-14 01:13:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:35,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:35,943 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:35,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:13:36,143 WARN L453 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-03-14 01:13:36,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash -497225279, now seen corresponding path program 2 times [2025-03-14 01:13:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801535895] [2025-03-14 01:13:36,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:36,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:13:36,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:13:36,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801535895] [2025-03-14 01:13:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801535895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:36,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864236912] [2025-03-14 01:13:36,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:36,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:36,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:36,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:36,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:13:36,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:13:36,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:13:36,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:36,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:36,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-14 01:13:36,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:36,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864236912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:36,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-14 01:13:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584111352] [2025-03-14 01:13:36,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:13:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:36,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:13:36,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:13:36,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:36,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 93 flow. Second operand has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:36,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:36,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:36,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:36,799 INFO L124 PetriNetUnfolderBase]: 89/185 cut-off events. [2025-03-14 01:13:36,800 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-03-14 01:13:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 185 events. 89/185 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 423 event pairs, 18 based on Foata normal form. 30/211 useless extension candidates. Maximal degree in co-relation 470. Up to 61 conditions per place. [2025-03-14 01:13:36,801 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2025-03-14 01:13:36,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 325 flow [2025-03-14 01:13:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:13:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:13:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2025-03-14 01:13:36,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2025-03-14 01:13:36,803 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 93 flow. Second operand 14 states and 107 transitions. [2025-03-14 01:13:36,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 325 flow [2025-03-14 01:13:36,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 302 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-14 01:13:36,805 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 160 flow [2025-03-14 01:13:36,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2025-03-14 01:13:36,805 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2025-03-14 01:13:36,805 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 160 flow [2025-03-14 01:13:36,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:36,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:36,806 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:36,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:13:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 01:13:37,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash 703475233, now seen corresponding path program 3 times [2025-03-14 01:13:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644818464] [2025-03-14 01:13:37,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:37,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-03-14 01:13:37,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 21 statements. [2025-03-14 01:13:37,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:13:37,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:13:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644818464] [2025-03-14 01:13:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644818464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982349547] [2025-03-14 01:13:37,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:37,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:37,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:13:37,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-03-14 01:13:37,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 21 statements. [2025-03-14 01:13:37,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:13:37,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:13:37,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:13:37,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:13:37,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982349547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:37,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:37,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-14 01:13:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485248002] [2025-03-14 01:13:37,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:37,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:13:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:37,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:13:37,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:13:37,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:37,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:37,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:37,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:37,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:37,327 INFO L124 PetriNetUnfolderBase]: 156/321 cut-off events. [2025-03-14 01:13:37,327 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-03-14 01:13:37,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 321 events. 156/321 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1025 event pairs, 54 based on Foata normal form. 5/322 useless extension candidates. Maximal degree in co-relation 1045. Up to 151 conditions per place. [2025-03-14 01:13:37,334 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 25 selfloop transitions, 2 changer transitions 26/54 dead transitions. [2025-03-14 01:13:37,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 420 flow [2025-03-14 01:13:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:13:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:13:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-03-14 01:13:37,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2025-03-14 01:13:37,335 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 160 flow. Second operand 6 states and 53 transitions. [2025-03-14 01:13:37,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 420 flow [2025-03-14 01:13:37,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 318 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-03-14 01:13:37,342 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 115 flow [2025-03-14 01:13:37,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2025-03-14 01:13:37,346 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2025-03-14 01:13:37,346 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 115 flow [2025-03-14 01:13:37,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:37,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:37,346 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:37,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:13:37,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:37,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1700492865, now seen corresponding path program 1 times [2025-03-14 01:13:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:37,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851065318] [2025-03-14 01:13:37,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:37,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:13:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:13:37,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:37,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851065318] [2025-03-14 01:13:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851065318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394540278] [2025-03-14 01:13:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:37,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:37,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:13:37,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:13:37,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:13:37,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:13:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:38,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394540278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:38,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:38,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-14 01:13:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742909193] [2025-03-14 01:13:38,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:38,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-14 01:13:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:38,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-14 01:13:38,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-03-14 01:13:38,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:38,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 115 flow. Second operand has 40 states, 40 states have (on average 4.325) internal successors, (173), 40 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:38,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:38,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:38,945 INFO L124 PetriNetUnfolderBase]: 142/294 cut-off events. [2025-03-14 01:13:38,947 INFO L125 PetriNetUnfolderBase]: For 3055/3055 co-relation queries the response was YES. [2025-03-14 01:13:38,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 294 events. 142/294 cut-off events. For 3055/3055 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 666 event pairs, 15 based on Foata normal form. 60/354 useless extension candidates. Maximal degree in co-relation 832. Up to 76 conditions per place. [2025-03-14 01:13:38,950 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 80 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-03-14 01:13:38,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 559 flow [2025-03-14 01:13:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 01:13:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 01:13:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 195 transitions. [2025-03-14 01:13:38,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-03-14 01:13:38,953 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 115 flow. Second operand 26 states and 195 transitions. [2025-03-14 01:13:38,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 559 flow [2025-03-14 01:13:38,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 545 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-14 01:13:38,956 INFO L231 Difference]: Finished difference. Result has 76 places, 37 transitions, 273 flow [2025-03-14 01:13:38,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=273, PETRI_PLACES=76, PETRI_TRANSITIONS=37} [2025-03-14 01:13:38,957 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 52 predicate places. [2025-03-14 01:13:38,957 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 37 transitions, 273 flow [2025-03-14 01:13:38,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.325) internal successors, (173), 40 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:38,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:38,957 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:38,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:13:39,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:39,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1406428929, now seen corresponding path program 2 times [2025-03-14 01:13:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420792983] [2025-03-14 01:13:39,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:39,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-14 01:13:39,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:13:39,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:39,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420792983] [2025-03-14 01:13:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420792983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121818949] [2025-03-14 01:13:39,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:39,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:39,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:13:39,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-14 01:13:39,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:13:39,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:39,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-14 01:13:39,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:40,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121818949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:41,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-03-14 01:13:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522103461] [2025-03-14 01:13:41,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:41,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-14 01:13:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:41,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-14 01:13:41,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-03-14 01:13:41,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:41,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 37 transitions, 273 flow. Second operand has 76 states, 76 states have (on average 4.171052631578948) internal successors, (317), 76 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:41,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:41,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:41,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:42,815 INFO L124 PetriNetUnfolderBase]: 262/534 cut-off events. [2025-03-14 01:13:42,816 INFO L125 PetriNetUnfolderBase]: For 26284/26284 co-relation queries the response was YES. [2025-03-14 01:13:42,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 534 events. 262/534 cut-off events. For 26284/26284 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1225 event pairs, 15 based on Foata normal form. 120/654 useless extension candidates. Maximal degree in co-relation 1856. Up to 196 conditions per place. [2025-03-14 01:13:42,819 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 152 selfloop transitions, 49 changer transitions 0/202 dead transitions. [2025-03-14 01:13:42,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 202 transitions, 1197 flow [2025-03-14 01:13:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-14 01:13:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-14 01:13:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 375 transitions. [2025-03-14 01:13:42,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-03-14 01:13:42,824 INFO L175 Difference]: Start difference. First operand has 76 places, 37 transitions, 273 flow. Second operand 50 states and 375 transitions. [2025-03-14 01:13:42,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 202 transitions, 1197 flow [2025-03-14 01:13:42,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 202 transitions, 1049 flow, removed 61 selfloop flow, removed 13 redundant places. [2025-03-14 01:13:42,836 INFO L231 Difference]: Finished difference. Result has 136 places, 61 transitions, 513 flow [2025-03-14 01:13:42,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=513, PETRI_PLACES=136, PETRI_TRANSITIONS=61} [2025-03-14 01:13:42,838 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 112 predicate places. [2025-03-14 01:13:42,838 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 61 transitions, 513 flow [2025-03-14 01:13:42,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.171052631578948) internal successors, (317), 76 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:42,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:42,838 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:42,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:13:43,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:43,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:43,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2039277697, now seen corresponding path program 3 times [2025-03-14 01:13:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81436784] [2025-03-14 01:13:43,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:43,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 24 equivalence classes. [2025-03-14 01:13:43,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:13:43,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-03-14 01:13:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81436784] [2025-03-14 01:13:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81436784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637569030] [2025-03-14 01:13:44,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:44,131 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-03-14 01:13:44,132 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-03-14 01:13:44,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 24 equivalence classes. [2025-03-14 01:13:44,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:13:44,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-03-14 01:13:44,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:44,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-14 01:13:44,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:45,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637569030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:48,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-03-14 01:13:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869753726] [2025-03-14 01:13:48,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-03-14 01:13:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:48,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-03-14 01:13:48,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-03-14 01:13:48,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:13:48,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 61 transitions, 513 flow. Second operand has 148 states, 148 states have (on average 4.087837837837838) internal successors, (605), 148 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:48,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:48,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:13:48,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:53,731 INFO L124 PetriNetUnfolderBase]: 502/1014 cut-off events. [2025-03-14 01:13:53,731 INFO L125 PetriNetUnfolderBase]: For 242560/242560 co-relation queries the response was YES. [2025-03-14 01:13:53,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1014 events. 502/1014 cut-off events. For 242560/242560 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2346 event pairs, 15 based on Foata normal form. 240/1254 useless extension candidates. Maximal degree in co-relation 3656. Up to 376 conditions per place. [2025-03-14 01:13:53,740 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 296 selfloop transitions, 97 changer transitions 0/394 dead transitions. [2025-03-14 01:13:53,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 394 transitions, 2349 flow [2025-03-14 01:13:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-14 01:13:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-03-14 01:13:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 735 transitions. [2025-03-14 01:13:53,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-03-14 01:13:53,745 INFO L175 Difference]: Start difference. First operand has 136 places, 61 transitions, 513 flow. Second operand 98 states and 735 transitions. [2025-03-14 01:13:53,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 394 transitions, 2349 flow [2025-03-14 01:13:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 394 transitions, 2057 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-03-14 01:13:53,785 INFO L231 Difference]: Finished difference. Result has 256 places, 109 transitions, 993 flow [2025-03-14 01:13:53,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=993, PETRI_PLACES=256, PETRI_TRANSITIONS=109} [2025-03-14 01:13:53,787 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 232 predicate places. [2025-03-14 01:13:53,787 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 109 transitions, 993 flow [2025-03-14 01:13:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 4.087837837837838) internal successors, (605), 148 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:53,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:53,788 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:53,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:13:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:53,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1465412481, now seen corresponding path program 4 times [2025-03-14 01:13:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:53,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234073653] [2025-03-14 01:13:53,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:13:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:54,004 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes. [2025-03-14 01:13:54,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:13:54,045 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:13:54,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:57,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:57,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234073653] [2025-03-14 01:13:57,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234073653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:57,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957255779] [2025-03-14 01:13:57,561 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:13:57,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:57,563 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-03-14 01:13:57,564 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-03-14 01:13:57,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes. [2025-03-14 01:13:57,632 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-14 01:13:57,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:13:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-14 01:13:57,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:14:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:14:03,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:14:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:14:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957255779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:14:11,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:14:11,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2025-03-14 01:14:11,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130007286] [2025-03-14 01:14:11,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:14:11,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2025-03-14 01:14:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:14:11,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2025-03-14 01:14:11,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19087, Invalid=65885, Unknown=0, NotChecked=0, Total=84972 [2025-03-14 01:14:11,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-03-14 01:14:11,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 109 transitions, 993 flow. Second operand has 292 states, 292 states have (on average 4.044520547945205) internal successors, (1181), 292 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:14:11,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:14:11,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-03-14 01:14:11,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:14:19,720 INFO L124 PetriNetUnfolderBase]: 537/1084 cut-off events. [2025-03-14 01:14:19,720 INFO L125 PetriNetUnfolderBase]: For 170993/170993 co-relation queries the response was YES. [2025-03-14 01:14:19,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 1084 events. 537/1084 cut-off events. For 170993/170993 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2510 event pairs, 15 based on Foata normal form. 35/1119 useless extension candidates. Maximal degree in co-relation 4141. Up to 291 conditions per place. [2025-03-14 01:14:19,726 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 317 selfloop transitions, 104 changer transitions 0/422 dead transitions. [2025-03-14 01:14:19,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 422 transitions, 2606 flow [2025-03-14 01:14:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-03-14 01:14:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-03-14 01:14:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 743 transitions. [2025-03-14 01:14:19,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29484126984126985 [2025-03-14 01:14:19,729 INFO L175 Difference]: Start difference. First operand has 256 places, 109 transitions, 993 flow. Second operand 105 states and 743 transitions. [2025-03-14 01:14:19,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 422 transitions, 2606 flow [2025-03-14 01:14:19,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 422 transitions, 2204 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-03-14 01:14:19,837 INFO L231 Difference]: Finished difference. Result has 318 places, 116 transitions, 885 flow [2025-03-14 01:14:19,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=885, PETRI_PLACES=318, PETRI_TRANSITIONS=116} [2025-03-14 01:14:19,837 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 294 predicate places. [2025-03-14 01:14:19,837 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 116 transitions, 885 flow [2025-03-14 01:14:19,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 4.044520547945205) internal successors, (1181), 292 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:14:19,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:14:19,838 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:14:19,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:14:20,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:14:20,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:14:20,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:14:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1972579458, now seen corresponding path program 5 times [2025-03-14 01:14:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:14:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579697811] [2025-03-14 01:14:20,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:14:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:14:20,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 52 equivalence classes. [2025-03-14 01:14:20,126 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 112 of 112 statements. [2025-03-14 01:14:20,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-03-14 01:14:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:14:20,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:14:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-14 01:14:20,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-14 01:14:20,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:14:20,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:14:20,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:14:20,203 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:14:20,204 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 01:14:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 01:14:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 01:14:20,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 01:14:20,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:14:20,205 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-03-14 01:14:20,294 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:14:20,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:14:20,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:14:20 BasicIcfg [2025-03-14 01:14:20,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:14:20,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:14:20,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:14:20,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:14:20,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:34" (3/4) ... [2025-03-14 01:14:20,300 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:14:20,375 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 109. [2025-03-14 01:14:20,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:14:20,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:14:20,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:14:20,453 INFO L158 Benchmark]: Toolchain (without parser) took 46555.50ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 103.2MB in the beginning and 226.7MB in the end (delta: -123.5MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2025-03-14 01:14:20,453 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:14:20,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.00ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 83.1MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:14:20,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.89ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:14:20,454 INFO L158 Benchmark]: Boogie Preprocessor took 22.27ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.4MB in the end (delta: 926.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:14:20,454 INFO L158 Benchmark]: IcfgBuilder took 383.70ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 59.9MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:14:20,454 INFO L158 Benchmark]: TraceAbstraction took 45594.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 59.9MB in the beginning and 247.8MB in the end (delta: -187.9MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-03-14 01:14:20,454 INFO L158 Benchmark]: Witness Printer took 153.96ms. Allocated memory is still 394.3MB. Free memory was 247.8MB in the beginning and 226.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:14:20,455 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.00ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 83.1MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.89ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.27ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 80.4MB in the end (delta: 926.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 383.70ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 59.9MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45594.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 59.9MB in the beginning and 247.8MB in the end (delta: -187.9MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. * Witness Printer took 153.96ms. Allocated memory is still 394.3MB. Free memory was 247.8MB in the beginning and 226.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 locations, 4 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: 45.4s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6679 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6675 mSDsluCounter, 859 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3253 IncrementalHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 6 mSDtfsCounter, 3253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1019 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 879 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50406 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=8, InterpolantAutomatonStates: 318, 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.3s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 657 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3724 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1080 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 136/17761 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-14 01:14:20,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE