./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.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/unwind3-1.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:13:38,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:13:38,599 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:38,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:13:38,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:13:38,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:13:38,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:13:38,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:13:38,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:13:38,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:13:38,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:13:38,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:13:38,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:13:38,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:13:38,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:13:38,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:13:38,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:13:38,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:38,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:13:38,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:13:38,622 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-03-14 01:13:38,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:13:38,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:13:38,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:13:38,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:13:38,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:13:38,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-14 01:13:39,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46cd28f/950327b55f41445a8d6d2d8c443fcd26/FLAG3e68ab7af [2025-03-14 01:13:40,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:13:40,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-14 01:13:40,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46cd28f/950327b55f41445a8d6d2d8c443fcd26/FLAG3e68ab7af [2025-03-14 01:13:40,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46cd28f/950327b55f41445a8d6d2d8c443fcd26 [2025-03-14 01:13:40,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:13:40,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:13:40,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:40,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:13:40,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:13:40,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:40" (1/1) ... [2025-03-14 01:13:40,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6ebb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:40, skipping insertion in model container [2025-03-14 01:13:40,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:13:40" (1/1) ... [2025-03-14 01:13:40,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:13:40,784 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/unwind3-1.i[33026,33039] [2025-03-14 01:13:40,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:40,809 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:13:40,838 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/unwind3-1.i[33026,33039] [2025-03-14 01:13:40,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:13:40,869 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:13:40,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:40 WrapperNode [2025-03-14 01:13:40,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:13:40,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:40,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:13:40,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:13:40,877 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:40" (1/1) ... [2025-03-14 01:13:40,888 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:40" (1/1) ... [2025-03-14 01:13:40,902 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-03-14 01:13:40,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:13:40,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:13:40,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:13:40,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:13:40,910 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:40" (1/1) ... [2025-03-14 01:13:40,910 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:40" (1/1) ... [2025-03-14 01:13:40,911 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:40" (1/1) ... [2025-03-14 01:13:40,919 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:40,919 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:40" (1/1) ... [2025-03-14 01:13:40,920 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:40" (1/1) ... [2025-03-14 01:13:40,922 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:40" (1/1) ... [2025-03-14 01:13:40,923 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:40" (1/1) ... [2025-03-14 01:13:40,923 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:40" (1/1) ... [2025-03-14 01:13:40,924 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:40" (1/1) ... [2025-03-14 01:13:40,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:13:40,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:13:40,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:13:40,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:13:40,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:40" (1/1) ... [2025-03-14 01:13:40,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:13:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:40,949 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:40,951 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:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:13:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-14 01:13:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-14 01:13:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-14 01:13:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-14 01:13:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:13:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:13:40,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:13:40,968 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:41,048 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:13:41,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:13:41,142 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:13:41,143 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:13:41,143 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:13:41,224 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:13:41,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:41 BoogieIcfgContainer [2025-03-14 01:13:41,224 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:13:41,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:13:41,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:13:41,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:13:41,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:13:40" (1/3) ... [2025-03-14 01:13:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2df339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:41, skipping insertion in model container [2025-03-14 01:13:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:13:40" (2/3) ... [2025-03-14 01:13:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2df339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:13:41, skipping insertion in model container [2025-03-14 01:13:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:13:41" (3/3) ... [2025-03-14 01:13:41,231 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-03-14 01:13:41,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:13:41,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 01:13:41,242 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:13:41,283 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:13:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2025-03-14 01:13:41,330 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-14 01:13:41,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:13:41,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2025-03-14 01:13:41,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2025-03-14 01:13:41,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2025-03-14 01:13:41,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:13:41,352 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;@5f018fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:13:41,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:13:41,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:13:41,362 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2025-03-14 01:13:41,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:13:41,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:41,364 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:41,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 01:13:41,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1858627319, now seen corresponding path program 1 times [2025-03-14 01:13:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887143052] [2025-03-14 01:13:41,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:41,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 01:13:41,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 01:13:41,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:41,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:41,634 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:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887143052] [2025-03-14 01:13:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887143052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:13:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124904358] [2025-03-14 01:13:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:41,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:13:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:41,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:13:41,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:13:41,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-14 01:13:41,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:41,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:41,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-14 01:13:41,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:41,755 INFO L124 PetriNetUnfolderBase]: 44/111 cut-off events. [2025-03-14 01:13:41,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:13:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 111 events. 44/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 349 event pairs, 10 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 174. Up to 78 conditions per place. [2025-03-14 01:13:41,757 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 17 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2025-03-14 01:13:41,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 98 flow [2025-03-14 01:13:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:13:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:13:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-14 01:13:41,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-14 01:13:41,766 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 43 flow. Second operand 5 states and 48 transitions. [2025-03-14 01:13:41,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 98 flow [2025-03-14 01:13:41,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:13:41,770 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 54 flow [2025-03-14 01:13:41,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2025-03-14 01:13:41,774 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-14 01:13:41,774 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 54 flow [2025-03-14 01:13:41,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:41,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:41,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:13:41,775 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:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1752143098, now seen corresponding path program 1 times [2025-03-14 01:13:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739210067] [2025-03-14 01:13:41,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:41,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 01:13:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 01:13:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:41,856 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:41,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739210067] [2025-03-14 01:13:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739210067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:13:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909153714] [2025-03-14 01:13:41,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:41,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:13:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:41,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:13:41,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:13:41,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-03-14 01:13:41,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 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:41,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:41,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-03-14 01:13:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:41,914 INFO L124 PetriNetUnfolderBase]: 40/96 cut-off events. [2025-03-14 01:13:41,915 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:13:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 96 events. 40/96 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 247 event pairs, 8 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 186. Up to 74 conditions per place. [2025-03-14 01:13:41,916 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 15 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2025-03-14 01:13:41,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 92 flow [2025-03-14 01:13:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:13:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:13:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2025-03-14 01:13:41,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-03-14 01:13:41,917 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 54 flow. Second operand 4 states and 39 transitions. [2025-03-14 01:13:41,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 92 flow [2025-03-14 01:13:41,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:41,918 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 50 flow [2025-03-14 01:13:41,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2025-03-14 01:13:41,918 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-14 01:13:41,918 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 50 flow [2025-03-14 01:13:41,918 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:41,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:41,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:41,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:13:41,919 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:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1939156273, now seen corresponding path program 1 times [2025-03-14 01:13:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161880602] [2025-03-14 01:13:41,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:41,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 01:13:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 01:13:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:42,031 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:42,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:42,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161880602] [2025-03-14 01:13:42,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161880602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:42,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:42,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:13:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743275862] [2025-03-14 01:13:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:42,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:13:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:42,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:13:42,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:13:42,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2025-03-14 01:13:42,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:42,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2025-03-14 01:13:42,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:42,106 INFO L124 PetriNetUnfolderBase]: 70/142 cut-off events. [2025-03-14 01:13:42,106 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:13:42,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 142 events. 70/142 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 400 event pairs, 42 based on Foata normal form. 8/134 useless extension candidates. Maximal degree in co-relation 286. Up to 97 conditions per place. [2025-03-14 01:13:42,107 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 17 selfloop transitions, 3 changer transitions 5/27 dead transitions. [2025-03-14 01:13:42,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 120 flow [2025-03-14 01:13:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:13:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:13:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-03-14 01:13:42,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-03-14 01:13:42,111 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 50 flow. Second operand 5 states and 46 transitions. [2025-03-14 01:13:42,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 120 flow [2025-03-14 01:13:42,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:42,112 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 60 flow [2025-03-14 01:13:42,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2025-03-14 01:13:42,113 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2025-03-14 01:13:42,113 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 60 flow [2025-03-14 01:13:42,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:42,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:42,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:13:42,113 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:42,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 15667029, now seen corresponding path program 1 times [2025-03-14 01:13:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114165776] [2025-03-14 01:13:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 01:13:42,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 01:13:42,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:42,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:42,212 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:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:42,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114165776] [2025-03-14 01:13:42,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114165776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:42,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119413594] [2025-03-14 01:13:42,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:42,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:42,214 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:42,215 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:42,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 01:13:42,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 01:13:42,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:42,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:42,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:13:42,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:42,380 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:42,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:42,420 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:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119413594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:42,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:42,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:13:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861007551] [2025-03-14 01:13:42,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:42,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:13:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:42,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:13:42,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:13:42,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2025-03-14 01:13:42,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 60 flow. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:42,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2025-03-14 01:13:42,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:42,511 INFO L124 PetriNetUnfolderBase]: 80/160 cut-off events. [2025-03-14 01:13:42,511 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:13:42,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 160 events. 80/160 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 449 event pairs, 42 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 382. Up to 97 conditions per place. [2025-03-14 01:13:42,512 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 21 selfloop transitions, 4 changer transitions 5/32 dead transitions. [2025-03-14 01:13:42,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 152 flow [2025-03-14 01:13:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:13:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:13:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-03-14 01:13:42,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-14 01:13:42,513 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 60 flow. Second operand 6 states and 55 transitions. [2025-03-14 01:13:42,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 152 flow [2025-03-14 01:13:42,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 144 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:13:42,514 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 72 flow [2025-03-14 01:13:42,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2025-03-14 01:13:42,515 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2025-03-14 01:13:42,515 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 72 flow [2025-03-14 01:13:42,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:42,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:42,526 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:42,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:42,716 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:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash 485647247, now seen corresponding path program 2 times [2025-03-14 01:13:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123065539] [2025-03-14 01:13:42,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:42,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-14 01:13:42,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 01:13:42,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:42,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:42,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:42,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123065539] [2025-03-14 01:13:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123065539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721980173] [2025-03-14 01:13:42,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:42,791 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:42,792 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:42,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-14 01:13:42,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 01:13:42,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:42,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:42,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:13:42,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:42,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:13:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721980173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:13:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-14 01:13:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337068869] [2025-03-14 01:13:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:42,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:13:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:42,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:13:42,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:13:42,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-03-14 01:13:42,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:42,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:42,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-03-14 01:13:42,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:42,985 INFO L124 PetriNetUnfolderBase]: 48/112 cut-off events. [2025-03-14 01:13:42,985 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-14 01:13:42,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 112 events. 48/112 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 288 event pairs, 12 based on Foata normal form. 8/116 useless extension candidates. Maximal degree in co-relation 283. Up to 54 conditions per place. [2025-03-14 01:13:42,988 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 18 selfloop transitions, 2 changer transitions 13/36 dead transitions. [2025-03-14 01:13:42,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 188 flow [2025-03-14 01:13:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:13:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:13:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-03-14 01:13:42,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2025-03-14 01:13:42,991 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 72 flow. Second operand 8 states and 81 transitions. [2025-03-14 01:13:42,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 188 flow [2025-03-14 01:13:42,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 172 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-14 01:13:42,992 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 76 flow [2025-03-14 01:13:42,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=76, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2025-03-14 01:13:42,994 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2025-03-14 01:13:42,994 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 76 flow [2025-03-14 01:13:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:42,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:42,995 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:43,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:13:43,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:43,196 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:43,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -409636692, now seen corresponding path program 1 times [2025-03-14 01:13:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629430360] [2025-03-14 01:13:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:43,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:13:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:13:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:13:43,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:13:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:13:43,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:13:43,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:43,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:13:43,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:13:43,229 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:13:43,230 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 01:13:43,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 01:13:43,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 01:13:43,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 01:13:43,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:13:43,232 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-14 01:13:43,256 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:13:43,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:13:43,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:13:43 BasicIcfg [2025-03-14 01:13:43,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:13:43,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:13:43,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:13:43,265 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:13:43,266 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:41" (3/4) ... [2025-03-14 01:13:43,266 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:13:43,301 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-14 01:13:43,337 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:13:43,337 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:13:43,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:13:43,337 INFO L158 Benchmark]: Toolchain (without parser) took 2766.58ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 50.0MB in the end (delta: 53.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2025-03-14 01:13:43,338 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:43,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 83.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:13:43,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.09ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 82.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:43,339 INFO L158 Benchmark]: Boogie Preprocessor took 20.53ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:13:43,340 INFO L158 Benchmark]: IcfgBuilder took 298.46ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 59.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:13:43,340 INFO L158 Benchmark]: TraceAbstraction took 2038.41ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2025-03-14 01:13:43,341 INFO L158 Benchmark]: Witness Printer took 72.02ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 50.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:13:43,342 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 83.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.09ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 82.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.53ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 79.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.46ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 59.5MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2038.41ms. Allocated memory is still 142.6MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 72.02ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 50.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. 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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=1, arg={0:0}, expression=0, l=1, limit=2] - 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. - UnprovableResult [Line: 778]: 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, 33 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: 1.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 6 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 5 NumberOfNonLiveVariables, 161 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 5/9 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:13:43,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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