./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/bigshot_s.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/bigshot_s.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 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:42:45,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:42:45,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:42:45,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:42:45,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:42:45,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:42:45,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:42:45,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:42:45,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:42:45,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:42:45,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:42:45,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:42:45,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:42:45,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:42:45,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:42:45,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:42:45,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:42:45,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:42:45,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:42:45,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:42:45,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:42:45,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:42:45,215 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 -> 4d8c741fd238f074816319de9a9bd5d97cd9b35eb7f53a276be973ea0c31ecbe [2025-03-14 00:42:45,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:42:45,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:42:45,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:42:45,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:42:45,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:42:45,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/bigshot_s.i [2025-03-14 00:42:46,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9731b204/26c4e49c0dc44966a922f3009fc8ce09/FLAG9e9e8e2cf [2025-03-14 00:42:46,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:42:46,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/bigshot_s.i [2025-03-14 00:42:46,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9731b204/26c4e49c0dc44966a922f3009fc8ce09/FLAG9e9e8e2cf [2025-03-14 00:42:47,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9731b204/26c4e49c0dc44966a922f3009fc8ce09 [2025-03-14 00:42:47,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:42:47,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:42:47,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:42:47,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:42:47,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:42:47,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47, skipping insertion in model container [2025-03-14 00:42:47,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:42:47,455 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/bigshot_s.i[55202,55215] [2025-03-14 00:42:47,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:42:47,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:42:47,515 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/bigshot_s.i[55202,55215] [2025-03-14 00:42:47,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:42:47,561 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:42:47,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47 WrapperNode [2025-03-14 00:42:47,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:42:47,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:42:47,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:42:47,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:42:47,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,601 INFO L138 Inliner]: procedures = 322, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2025-03-14 00:42:47,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:42:47,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:42:47,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:42:47,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:42:47,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,626 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 9, 2]. 69 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-14 00:42:47,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:42:47,641 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:42:47,641 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:42:47,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:42:47,642 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (1/1) ... [2025-03-14 00:42:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:42:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:47,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:42:47,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:42:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-14 00:42:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 00:42:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 00:42:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 00:42:47,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:42:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:42:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:42:47,693 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:42:47,808 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:42:47,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:42:47,939 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:42:47,940 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:42:47,940 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:42:48,032 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:42:48,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:42:48 BoogieIcfgContainer [2025-03-14 00:42:48,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:42:48,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:42:48,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:42:48,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:42:48,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:42:47" (1/3) ... [2025-03-14 00:42:48,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3cb98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:42:48, skipping insertion in model container [2025-03-14 00:42:48,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:42:47" (2/3) ... [2025-03-14 00:42:48,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3cb98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:42:48, skipping insertion in model container [2025-03-14 00:42:48,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:42:48" (3/3) ... [2025-03-14 00:42:48,043 INFO L128 eAbstractionObserver]: Analyzing ICFG bigshot_s.i [2025-03-14 00:42:48,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:42:48,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bigshot_s.i that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-14 00:42:48,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:42:48,106 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:42:48,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-03-14 00:42:48,191 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-14 00:42:48,192 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-14 00:42:48,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-03-14 00:42:48,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 54 flow [2025-03-14 00:42:48,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:42:48,215 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;@6d1b32e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:42:48,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:42:48,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:42:48,229 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-14 00:42:48,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:48,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:42:48,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:42:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1058698205, now seen corresponding path program 1 times [2025-03-14 00:42:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-14 00:42:48,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:48,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:42:48,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:42:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499794235] [2025-03-14 00:42:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499794235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:42:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:42:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:42:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431427974] [2025-03-14 00:42:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:42:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:42:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:48,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:42:48,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:42:48,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-03-14 00:42:48,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:48,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:48,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-03-14 00:42:48,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:48,531 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-03-14 00:42:48,531 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 31 events. 7/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 4 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 23 conditions per place. [2025-03-14 00:42:48,532 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 15 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-03-14 00:42:48,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 84 flow [2025-03-14 00:42:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:42:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:42:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-14 00:42:48,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 00:42:48,543 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 3 states and 39 transitions. [2025-03-14 00:42:48,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 84 flow [2025-03-14 00:42:48,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 76 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:42:48,551 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 44 flow [2025-03-14 00:42:48,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2025-03-14 00:42:48,559 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-03-14 00:42:48,559 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 44 flow [2025-03-14 00:42:48,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:48,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:48,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:42:48,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:42:48,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:42:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 307843255, now seen corresponding path program 1 times [2025-03-14 00:42:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786367118] [2025-03-14 00:42:48,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:48,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:42:48,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:42:48,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786367118] [2025-03-14 00:42:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786367118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:42:49,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:42:49,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:42:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449379927] [2025-03-14 00:42:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:42:49,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:42:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:49,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:42:49,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:42:49,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-14 00:42:49,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 44 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:49,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:49,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-14 00:42:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:49,346 INFO L124 PetriNetUnfolderBase]: 12/49 cut-off events. [2025-03-14 00:42:49,348 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:42:49,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 49 events. 12/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 4 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 82. Up to 24 conditions per place. [2025-03-14 00:42:49,349 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 17 selfloop transitions, 6 changer transitions 4/30 dead transitions. [2025-03-14 00:42:49,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 121 flow [2025-03-14 00:42:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:42:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:42:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2025-03-14 00:42:49,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-03-14 00:42:49,351 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 44 flow. Second operand 8 states and 68 transitions. [2025-03-14 00:42:49,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 121 flow [2025-03-14 00:42:49,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:42:49,353 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 75 flow [2025-03-14 00:42:49,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2025-03-14 00:42:49,355 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-14 00:42:49,355 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 75 flow [2025-03-14 00:42:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:49,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:49,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:42:49,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:42:49,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:42:49,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 690857026, now seen corresponding path program 1 times [2025-03-14 00:42:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-03-14 00:42:49,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:49,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:42:49,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:42:49,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54815909] [2025-03-14 00:42:49,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54815909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:49,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095355847] [2025-03-14 00:42:49,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:49,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:49,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:42:49,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:42:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:42:49,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:42:49,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:49,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 00:42:49,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:49,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 00:42:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:49,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095355847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:49,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-14 00:42:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977039976] [2025-03-14 00:42:49,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 00:42:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 00:42:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:42:49,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-03-14 00:42:49,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 75 flow. Second operand has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:49,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:49,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-03-14 00:42:49,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:49,914 INFO L124 PetriNetUnfolderBase]: 14/50 cut-off events. [2025-03-14 00:42:49,915 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 00:42:49,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 50 events. 14/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 6 based on Foata normal form. 2/52 useless extension candidates. Maximal degree in co-relation 125. Up to 29 conditions per place. [2025-03-14 00:42:49,917 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 19 selfloop transitions, 6 changer transitions 1/29 dead transitions. [2025-03-14 00:42:49,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 145 flow [2025-03-14 00:42:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:42:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:42:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-03-14 00:42:49,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2025-03-14 00:42:49,918 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 75 flow. Second operand 7 states and 76 transitions. [2025-03-14 00:42:49,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 145 flow [2025-03-14 00:42:49,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 136 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-14 00:42:49,919 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2025-03-14 00:42:49,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-03-14 00:42:49,920 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-03-14 00:42:49,920 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2025-03-14 00:42:49,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:49,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:49,920 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:42:49,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 00:42:50,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:50,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:42:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1121459263, now seen corresponding path program 2 times [2025-03-14 00:42:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122883880] [2025-03-14 00:42:50,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:42:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:50,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 00:42:50,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 00:42:50,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:42:50,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122883880] [2025-03-14 00:42:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122883880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161290009] [2025-03-14 00:42:50,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:42:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:50,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:42:50,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:42:50,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 00:42:50,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 00:42:50,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:42:50,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:50,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 00:42:50,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:50,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 00:42:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:50,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161290009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:50,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-14 00:42:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733483572] [2025-03-14 00:42:50,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 00:42:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:50,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 00:42:50,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-14 00:42:50,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-03-14 00:42:50,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:50,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:50,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-03-14 00:42:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:50,853 INFO L124 PetriNetUnfolderBase]: 16/56 cut-off events. [2025-03-14 00:42:50,854 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 00:42:50,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 56 events. 16/56 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 6 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 150. Up to 29 conditions per place. [2025-03-14 00:42:50,854 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 21 selfloop transitions, 7 changer transitions 1/32 dead transitions. [2025-03-14 00:42:50,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 180 flow [2025-03-14 00:42:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:42:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:42:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2025-03-14 00:42:50,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2025-03-14 00:42:50,856 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 8 states and 86 transitions. [2025-03-14 00:42:50,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 180 flow [2025-03-14 00:42:50,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 168 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-14 00:42:50,858 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 120 flow [2025-03-14 00:42:50,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2025-03-14 00:42:50,862 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-03-14 00:42:50,862 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 120 flow [2025-03-14 00:42:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.882352941176471) internal successors, (168), 17 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:50,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:50,862 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:42:50,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 00:42:51,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 00:42:51,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 00:42:51,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -117049544, now seen corresponding path program 3 times [2025-03-14 00:42:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725832119] [2025-03-14 00:42:51,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:42:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:51,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-14 00:42:51,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 00:42:51,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:42:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725832119] [2025-03-14 00:42:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725832119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120472552] [2025-03-14 00:42:51,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:42:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:51,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:51,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:42:51,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:42:51,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-14 00:42:51,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 00:42:51,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:42:51,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:51,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 00:42:51,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:51,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 00:42:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:51,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:42:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120472552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:52,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2025-03-14 00:42:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211523493] [2025-03-14 00:42:52,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:52,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 00:42:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:52,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 00:42:52,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-14 00:42:52,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-14 00:42:52,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 120 flow. Second operand has 24 states, 24 states have (on average 6.541666666666667) internal successors, (157), 24 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:52,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-14 00:42:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:52,706 INFO L124 PetriNetUnfolderBase]: 17/57 cut-off events. [2025-03-14 00:42:52,707 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 00:42:52,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 57 events. 17/57 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 5/62 useless extension candidates. Maximal degree in co-relation 174. Up to 15 conditions per place. [2025-03-14 00:42:52,707 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2025-03-14 00:42:52,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 226 flow [2025-03-14 00:42:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:42:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:42:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2025-03-14 00:42:52,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25384615384615383 [2025-03-14 00:42:52,708 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 120 flow. Second operand 15 states and 99 transitions. [2025-03-14 00:42:52,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 226 flow [2025-03-14 00:42:52,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 206 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-14 00:42:52,710 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-03-14 00:42:52,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-03-14 00:42:52,710 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 22 predicate places. [2025-03-14 00:42:52,710 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-03-14 00:42:52,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.541666666666667) internal successors, (157), 24 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:42:52,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 00:42:52,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 00:42:52,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 00:42:52,719 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-14 00:42:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:52,916 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 00:42:52,919 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:42:52,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:42:52,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:42:52 BasicIcfg [2025-03-14 00:42:52,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:42:52,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:42:52,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:42:52,924 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:42:52,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:42:48" (3/4) ... [2025-03-14 00:42:52,926 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:42:52,929 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 00:42:52,929 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 00:42:52,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-03-14 00:42:52,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-14 00:42:52,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-14 00:42:52,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:42:52,932 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:42:52,988 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:42:52,988 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:42:52,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:42:52,989 INFO L158 Benchmark]: Toolchain (without parser) took 5826.08ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 112.1MB in the beginning and 201.9MB in the end (delta: -89.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,989 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.28ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 80.7MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.27ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,990 INFO L158 Benchmark]: Boogie Preprocessor took 37.77ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,990 INFO L158 Benchmark]: IcfgBuilder took 395.15ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 50.4MB in the end (delta: 26.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,990 INFO L158 Benchmark]: TraceAbstraction took 4885.48ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 49.6MB in the beginning and 206.9MB in the end (delta: -157.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,990 INFO L158 Benchmark]: Witness Printer took 64.53ms. Allocated memory is still 276.8MB. Free memory was 206.9MB in the beginning and 201.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,991 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.28ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 80.7MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.27ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.77ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 395.15ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 50.4MB in the end (delta: 26.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4885.48ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 49.6MB in the beginning and 206.9MB in the end (delta: -157.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 64.53ms. Allocated memory is still 276.8MB. Free memory was 206.9MB in the beginning and 201.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 3 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803 SizeOfPredicates, 12 NumberOfNonLiveVariables, 495 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 0/60 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:42:53,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE