./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/unwind2-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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:54:45,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:54:45,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:54:45,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:54:45,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:54:45,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:54:45,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:54:45,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:54:45,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:54:45,962 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:54:45,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:54:45,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:54:45,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:54:45,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:54:45,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:54:45,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:54:45,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:54:45,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:54:45,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:54:45,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:54:45,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:54:45,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:54:45,966 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2025-03-13 21:54:46,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:54:46,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:54:46,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:54:46,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:54:46,292 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:54:46,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-13 21:54:47,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00aea61/3bb441dcc3cd46d29d2fed39b588981a/FLAG04ba6ff89 [2025-03-13 21:54:47,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:54:47,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-13 21:54:47,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00aea61/3bb441dcc3cd46d29d2fed39b588981a/FLAG04ba6ff89 [2025-03-13 21:54:47,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc00aea61/3bb441dcc3cd46d29d2fed39b588981a [2025-03-13 21:54:47,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:54:47,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:54:47,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:54:47,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:54:47,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:54:47,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:47,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dddc639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47, skipping insertion in model container [2025-03-13 21:54:47,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:47,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:54:47,902 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/unwind2-1.i[33026,33039] [2025-03-13 21:54:47,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:54:47,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:54:47,952 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/unwind2-1.i[33026,33039] [2025-03-13 21:54:47,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:54:47,977 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:54:47,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47 WrapperNode [2025-03-13 21:54:47,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:54:47,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:54:47,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:54:47,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:54:47,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:47,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,007 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-03-13 21:54:48,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:54:48,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:54:48,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:54:48,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:54:48,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,023 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-13 21:54:48,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:54:48,030 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:54:48,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:54:48,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:54:48,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (1/1) ... [2025-03-13 21:54:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:54:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:48,054 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-13 21:54:48,056 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-13 21:54:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:54:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-13 21:54:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-13 21:54:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-13 21:54:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-13 21:54:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:54:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:54:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:54:48,073 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:54:48,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:54:48,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:54:48,305 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:54:48,305 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:54:48,306 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:54:48,388 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:54:48,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:54:48 BoogieIcfgContainer [2025-03-13 21:54:48,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:54:48,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:54:48,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:54:48,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:54:48,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:54:47" (1/3) ... [2025-03-13 21:54:48,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8a0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:54:48, skipping insertion in model container [2025-03-13 21:54:48,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:54:47" (2/3) ... [2025-03-13 21:54:48,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8a0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:54:48, skipping insertion in model container [2025-03-13 21:54:48,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:54:48" (3/3) ... [2025-03-13 21:54:48,398 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-03-13 21:54:48,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:54:48,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-13 21:54:48,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:54:48,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:54:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-03-13 21:54:48,500 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:54:48,502 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:54:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-13 21:54:48,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-03-13 21:54:48,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2025-03-13 21:54:48,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:54:48,530 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;@745116a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:54:48,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:54:48,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:54:48,539 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-13 21:54:48,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:54:48,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:48,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:48,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:48,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1583119239, now seen corresponding path program 1 times [2025-03-13 21:54:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856428304] [2025-03-13 21:54:48,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:48,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-13 21:54:48,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-13 21:54:48,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:48,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:48,773 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-13 21:54:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856428304] [2025-03-13 21:54:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856428304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:54:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:54:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:54:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401572649] [2025-03-13 21:54:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:54:48,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:54:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:48,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:54:48,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:54:48,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:48,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:54:48,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:48,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:49,022 INFO L124 PetriNetUnfolderBase]: 211/450 cut-off events. [2025-03-13 21:54:49,023 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:54:49,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 450 events. 211/450 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2207 event pairs, 26 based on Foata normal form. 48/420 useless extension candidates. Maximal degree in co-relation 780. Up to 153 conditions per place. [2025-03-13 21:54:49,027 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-03-13 21:54:49,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 63 transitions, 261 flow [2025-03-13 21:54:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:54:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:54:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-03-13 21:54:49,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-13 21:54:49,036 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 7 states and 122 transitions. [2025-03-13 21:54:49,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 63 transitions, 261 flow [2025-03-13 21:54:49,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 63 transitions, 251 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:54:49,043 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 101 flow [2025-03-13 21:54:49,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-13 21:54:49,047 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-03-13 21:54:49,048 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 101 flow [2025-03-13 21:54:49,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:54:49,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:49,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:54:49,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1832025527, now seen corresponding path program 1 times [2025-03-13 21:54:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871625816] [2025-03-13 21:54:49,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:49,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:54:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:54:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:49,207 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-13 21:54:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871625816] [2025-03-13 21:54:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871625816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:54:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005578972] [2025-03-13 21:54:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:49,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:49,209 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-13 21:54:49,210 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-13 21:54:49,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-13 21:54:49,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-13 21:54:49,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:49,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:49,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:54:49,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:54:49,315 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-13 21:54:49,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:54:49,348 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-13 21:54:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005578972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:54:49,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:54:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-13 21:54:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345421734] [2025-03-13 21:54:49,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:54:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:54:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:49,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:54:49,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:54:49,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-03-13 21:54:49,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-13 21:54:49,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:49,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-03-13 21:54:49,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:49,692 INFO L124 PetriNetUnfolderBase]: 477/882 cut-off events. [2025-03-13 21:54:49,692 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-13 21:54:49,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 882 events. 477/882 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4531 event pairs, 56 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1928. Up to 338 conditions per place. [2025-03-13 21:54:49,699 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 68 selfloop transitions, 14 changer transitions 3/89 dead transitions. [2025-03-13 21:54:49,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 89 transitions, 432 flow [2025-03-13 21:54:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:54:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:54:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-03-13 21:54:49,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-13 21:54:49,701 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 101 flow. Second operand 9 states and 136 transitions. [2025-03-13 21:54:49,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 89 transitions, 432 flow [2025-03-13 21:54:49,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 418 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:54:49,704 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 160 flow [2025-03-13 21:54:49,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-13 21:54:49,705 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-03-13 21:54:49,705 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 160 flow [2025-03-13 21:54:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-13 21:54:49,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:49,705 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:49,712 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-13 21:54:49,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:49,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:49,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 958185863, now seen corresponding path program 2 times [2025-03-13 21:54:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289660274] [2025-03-13 21:54:49,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:54:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:49,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-13 21:54:49,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:54:49,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:49,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:49,991 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-13 21:54:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289660274] [2025-03-13 21:54:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289660274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:54:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554217324] [2025-03-13 21:54:49,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:54:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:49,995 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-13 21:54:49,996 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-13 21:54:50,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-13 21:54:50,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:54:50,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:50,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:50,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:54:50,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:54:50,075 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-13 21:54:50,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:54:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554217324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:54:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:54:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-13 21:54:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241935350] [2025-03-13 21:54:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:54:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:54:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:50,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:54:50,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:54:50,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:50,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-13 21:54:50,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:50,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:50,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:50,290 INFO L124 PetriNetUnfolderBase]: 309/663 cut-off events. [2025-03-13 21:54:50,290 INFO L125 PetriNetUnfolderBase]: For 420/428 co-relation queries the response was YES. [2025-03-13 21:54:50,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 663 events. 309/663 cut-off events. For 420/428 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3614 event pairs, 64 based on Foata normal form. 22/621 useless extension candidates. Maximal degree in co-relation 1640. Up to 248 conditions per place. [2025-03-13 21:54:50,292 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 60 selfloop transitions, 12 changer transitions 6/86 dead transitions. [2025-03-13 21:54:50,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 458 flow [2025-03-13 21:54:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:54:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:54:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2025-03-13 21:54:50,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-13 21:54:50,294 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 160 flow. Second operand 10 states and 154 transitions. [2025-03-13 21:54:50,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 86 transitions, 458 flow [2025-03-13 21:54:50,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 438 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-13 21:54:50,298 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 204 flow [2025-03-13 21:54:50,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-03-13 21:54:50,299 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2025-03-13 21:54:50,299 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 204 flow [2025-03-13 21:54:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-13 21:54:50,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:50,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:50,306 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-13 21:54:50,504 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,SelfDestructingSolverStorable2 [2025-03-13 21:54:50,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -225954777, now seen corresponding path program 1 times [2025-03-13 21:54:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496840037] [2025-03-13 21:54:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:50,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-13 21:54:50,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-13 21:54:50,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:50,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:50,566 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-13 21:54:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496840037] [2025-03-13 21:54:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496840037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:54:50,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:54:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:54:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727609867] [2025-03-13 21:54:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:54:50,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:54:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:50,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:54:50,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:54:50,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:50,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-13 21:54:50,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:50,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:50,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:50,709 INFO L124 PetriNetUnfolderBase]: 373/812 cut-off events. [2025-03-13 21:54:50,710 INFO L125 PetriNetUnfolderBase]: For 804/818 co-relation queries the response was YES. [2025-03-13 21:54:50,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 812 events. 373/812 cut-off events. For 804/818 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4671 event pairs, 94 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 1908. Up to 351 conditions per place. [2025-03-13 21:54:50,715 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 57 selfloop transitions, 12 changer transitions 1/78 dead transitions. [2025-03-13 21:54:50,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 544 flow [2025-03-13 21:54:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:54:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:54:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-03-13 21:54:50,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-13 21:54:50,718 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 204 flow. Second operand 7 states and 112 transitions. [2025-03-13 21:54:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 544 flow [2025-03-13 21:54:50,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 527 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-13 21:54:50,723 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 252 flow [2025-03-13 21:54:50,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-03-13 21:54:50,724 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-03-13 21:54:50,724 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 252 flow [2025-03-13 21:54:50,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-13 21:54:50,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:50,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:50,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:54:50,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1585305889, now seen corresponding path program 1 times [2025-03-13 21:54:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439237551] [2025-03-13 21:54:50,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:50,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:54:50,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:54:50,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:50,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:50,796 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-13 21:54:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439237551] [2025-03-13 21:54:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439237551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:54:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797801512] [2025-03-13 21:54:50,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:50,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:50,798 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-13 21:54:50,800 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-13 21:54:50,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:54:50,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:54:50,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:50,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:50,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 21:54:50,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:54:50,882 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-13 21:54:50,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:54:50,912 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-13 21:54:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797801512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:54:50,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:54:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-13 21:54:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984054464] [2025-03-13 21:54:50,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:54:50,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:54:50,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:50,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:54:50,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:54:50,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:50,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 252 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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-13 21:54:50,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:50,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:50,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:51,133 INFO L124 PetriNetUnfolderBase]: 437/919 cut-off events. [2025-03-13 21:54:51,134 INFO L125 PetriNetUnfolderBase]: For 1164/1182 co-relation queries the response was YES. [2025-03-13 21:54:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 919 events. 437/919 cut-off events. For 1164/1182 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5285 event pairs, 108 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 2667. Up to 351 conditions per place. [2025-03-13 21:54:51,140 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 76 selfloop transitions, 15 changer transitions 1/100 dead transitions. [2025-03-13 21:54:51,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 761 flow [2025-03-13 21:54:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:54:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:54:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-13 21:54:51,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-13 21:54:51,142 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 252 flow. Second operand 9 states and 144 transitions. [2025-03-13 21:54:51,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 761 flow [2025-03-13 21:54:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 745 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:54:51,148 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 302 flow [2025-03-13 21:54:51,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=302, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-03-13 21:54:51,151 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2025-03-13 21:54:51,152 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 302 flow [2025-03-13 21:54:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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-13 21:54:51,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:51,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:51,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:54:51,352 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-13 21:54:51,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1446818242, now seen corresponding path program 1 times [2025-03-13 21:54:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757584861] [2025-03-13 21:54:51,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:51,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:54:51,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:54:51,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:51,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:51,393 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-13 21:54:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:51,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757584861] [2025-03-13 21:54:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757584861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:54:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:54:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:54:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618455940] [2025-03-13 21:54:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:54:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:54:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:51,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:54:51,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:54:51,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:51,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 21:54:51,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:51,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:51,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:51,512 INFO L124 PetriNetUnfolderBase]: 395/833 cut-off events. [2025-03-13 21:54:51,512 INFO L125 PetriNetUnfolderBase]: For 1457/1473 co-relation queries the response was YES. [2025-03-13 21:54:51,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 833 events. 395/833 cut-off events. For 1457/1473 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4534 event pairs, 115 based on Foata normal form. 12/772 useless extension candidates. Maximal degree in co-relation 2690. Up to 417 conditions per place. [2025-03-13 21:54:51,516 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 47 selfloop transitions, 12 changer transitions 1/67 dead transitions. [2025-03-13 21:54:51,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 547 flow [2025-03-13 21:54:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:54:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:54:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-03-13 21:54:51,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-13 21:54:51,517 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 302 flow. Second operand 6 states and 93 transitions. [2025-03-13 21:54:51,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 547 flow [2025-03-13 21:54:51,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 498 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-13 21:54:51,522 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 283 flow [2025-03-13 21:54:51,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-13 21:54:51,523 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2025-03-13 21:54:51,523 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 283 flow [2025-03-13 21:54:51,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 21:54:51,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:51,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:54:51,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:51,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2029517924, now seen corresponding path program 1 times [2025-03-13 21:54:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772575088] [2025-03-13 21:54:51,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:51,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-13 21:54:51,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:54:51,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:51,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:51,565 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-13 21:54:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772575088] [2025-03-13 21:54:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772575088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:54:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:54:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:54:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035835136] [2025-03-13 21:54:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:54:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:54:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:51,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:54:51,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:54:51,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2025-03-13 21:54:51,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 21:54:51,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:51,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2025-03-13 21:54:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:51,732 INFO L124 PetriNetUnfolderBase]: 409/878 cut-off events. [2025-03-13 21:54:51,733 INFO L125 PetriNetUnfolderBase]: For 1545/1569 co-relation queries the response was YES. [2025-03-13 21:54:51,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 878 events. 409/878 cut-off events. For 1545/1569 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4924 event pairs, 114 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 2819. Up to 439 conditions per place. [2025-03-13 21:54:51,736 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 51 selfloop transitions, 12 changer transitions 2/72 dead transitions. [2025-03-13 21:54:51,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 555 flow [2025-03-13 21:54:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:54:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:54:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-13 21:54:51,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-03-13 21:54:51,737 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 283 flow. Second operand 6 states and 97 transitions. [2025-03-13 21:54:51,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 555 flow [2025-03-13 21:54:51,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 526 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-13 21:54:51,741 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 300 flow [2025-03-13 21:54:51,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-03-13 21:54:51,742 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 37 predicate places. [2025-03-13 21:54:51,742 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 300 flow [2025-03-13 21:54:51,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-13 21:54:51,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:51,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:51,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:54:51,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:51,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1899811687, now seen corresponding path program 2 times [2025-03-13 21:54:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539639696] [2025-03-13 21:54:51,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:54:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:51,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-13 21:54:51,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:54:51,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:54:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539639696] [2025-03-13 21:54:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539639696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:54:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938467639] [2025-03-13 21:54:51,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:54:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:51,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:51,856 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-13 21:54:51,858 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-13 21:54:51,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-13 21:54:51,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-13 21:54:51,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:51,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:51,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:54:51,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:54:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:54:52,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:54:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:54:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938467639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:54:52,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:54:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-13 21:54:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833541697] [2025-03-13 21:54:52,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:54:52,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:54:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:54:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:54:52,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2025-03-13 21:54:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 300 flow. Second operand has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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-13 21:54:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2025-03-13 21:54:52,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:52,637 INFO L124 PetriNetUnfolderBase]: 751/1392 cut-off events. [2025-03-13 21:54:52,637 INFO L125 PetriNetUnfolderBase]: For 3039/3091 co-relation queries the response was YES. [2025-03-13 21:54:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 1392 events. 751/1392 cut-off events. For 3039/3091 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7656 event pairs, 127 based on Foata normal form. 0/1264 useless extension candidates. Maximal degree in co-relation 4103. Up to 375 conditions per place. [2025-03-13 21:54:52,644 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 106 selfloop transitions, 22 changer transitions 31/164 dead transitions. [2025-03-13 21:54:52,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 164 transitions, 1335 flow [2025-03-13 21:54:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:54:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:54:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2025-03-13 21:54:52,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-13 21:54:52,646 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 300 flow. Second operand 15 states and 216 transitions. [2025-03-13 21:54:52,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 164 transitions, 1335 flow [2025-03-13 21:54:52,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 164 transitions, 1282 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-13 21:54:52,654 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 404 flow [2025-03-13 21:54:52,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=404, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2025-03-13 21:54:52,655 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-03-13 21:54:52,655 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 404 flow [2025-03-13 21:54:52,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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-13 21:54:52,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:52,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:52,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:54:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:52,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 21:54:52,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1084475970, now seen corresponding path program 1 times [2025-03-13 21:54:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828824409] [2025-03-13 21:54:52,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:54:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:52,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:54:52,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:54:52,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:52,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:54:52,864 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:54:52,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:54:52,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:54:52,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:54:52,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:54:52,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:54:52,880 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:54:52,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-13 21:54:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-03-13 21:54:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-13 21:54:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-13 21:54:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-13 21:54:52,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:54:52,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:54:52,883 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-13 21:54:52,906 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:54:52,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:54:52,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:54:52 BasicIcfg [2025-03-13 21:54:52,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:54:52,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:54:52,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:54:52,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:54:52,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:54:48" (3/4) ... [2025-03-13 21:54:52,912 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:54:52,952 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-03-13 21:54:52,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:54:52,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:54:52,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:54:52,989 INFO L158 Benchmark]: Toolchain (without parser) took 5355.61ms. Allocated memory is still 201.3MB. Free memory was 153.1MB in the beginning and 108.6MB in the end (delta: 44.5MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-03-13 21:54:52,989 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:54:52,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.46ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.0MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:54:52,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.72ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 131.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:54:52,991 INFO L158 Benchmark]: Boogie Preprocessor took 20.78ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 129.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:54:52,991 INFO L158 Benchmark]: IcfgBuilder took 360.11ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 108.2MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:54:52,991 INFO L158 Benchmark]: TraceAbstraction took 4518.51ms. Allocated memory is still 201.3MB. Free memory was 107.5MB in the beginning and 114.7MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:54:52,992 INFO L158 Benchmark]: Witness Printer took 76.68ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 108.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:54:52,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.46ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.0MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.72ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 131.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.78ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 129.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.11ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 108.2MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4518.51ms. Allocated memory is still 201.3MB. Free memory was 107.5MB in the beginning and 114.7MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 76.68ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 108.6MB in the end (delta: 6.1MB). 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; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=1, expression=0, limit=1] [L753] 2 reach_error() VAL [\old(expression)=0, _N=1, expression=0, limit=1] - 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. - UnprovableResult [Line: 779]: 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: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 792 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1555 IncrementalHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 6 mSDtfsCounter, 1555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=8, InterpolantAutomatonStates: 69, 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, 1.1s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 18 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 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-13 21:54:53,010 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