./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/bigshot_s2.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_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:42:45,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:42:45,116 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,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:42:45,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:42:45,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:42:45,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:42:45,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:42:45,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:42:45,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:42:45,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:42:45,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:42:45,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:42:45,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:42:45,147 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:42:45,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:42:45,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:42:45,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:42:45,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:42:45,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:42:45,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:42:45,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:42:45,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:42:45,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:42:45,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:42:45,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:42:45,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:42:45,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:42:45,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:42:45,150 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb [2025-03-14 00:42:45,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:42:45,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:42:45,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:42:45,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:42:45,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:42:45,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/bigshot_s2.i [2025-03-14 00:42:46,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a92d9d5/7f0d9434c02c43b2a9ee84bcd8775581/FLAGbbb3557cb [2025-03-14 00:42:46,929 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:42:46,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/bigshot_s2.i [2025-03-14 00:42:46,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a92d9d5/7f0d9434c02c43b2a9ee84bcd8775581/FLAGbbb3557cb [2025-03-14 00:42:47,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a92d9d5/7f0d9434c02c43b2a9ee84bcd8775581 [2025-03-14 00:42:47,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:42:47,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:42:47,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:42:47,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:42:47,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:42:47,172 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,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734c2873 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,173 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,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:42:47,419 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_s2.i[55203,55216] [2025-03-14 00:42:47,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:42:47,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:42:47,487 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_s2.i[55203,55216] [2025-03-14 00:42:47,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:42:47,527 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:42:47,528 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,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:42:47,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:42:47,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:42:47,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:42:47,533 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,542 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,556 INFO L138 Inliner]: procedures = 322, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-03-14 00:42:47,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:42:47,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:42:47,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:42:47,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:42:47,562 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,562 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,563 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,573 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,574 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,575 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,578 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,579 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,583 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,584 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,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:42:47,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:42:47,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:42:47,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:42:47,587 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,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:42:47,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:47,609 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,613 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,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 00:42:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 00:42:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 00:42:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:42:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:42:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:42:47,628 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,731 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:42:47,732 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:42:47,857 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:42:47,858 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:42:47,858 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:42:47,942 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:42:47,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:42:47 BoogieIcfgContainer [2025-03-14 00:42:47,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:42:47,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:42:47,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:42:47,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:42:47,948 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:47,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d01cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:42:47, skipping insertion in model container [2025-03-14 00:42:47,949 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:47,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d01cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:42:47, skipping insertion in model container [2025-03-14 00:42:47,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:42:47" (3/3) ... [2025-03-14 00:42:47,950 INFO L128 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2025-03-14 00:42:47,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:42:47,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bigshot_s2.i that has 3 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-14 00:42:47,960 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:42:47,991 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:42:48,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-03-14 00:42:48,043 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-14 00:42:48,046 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,048 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 18 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,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-03-14 00:42:48,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 21 transitions, 54 flow [2025-03-14 00:42:48,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:42:48,077 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;@1903f828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:42:48,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 00:42:48,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:42:48,087 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-14 00:42:48,087 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:48,088 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,088 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,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1783823921, now seen corresponding path program 1 times [2025-03-14 00:42:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905622400] [2025-03-14 00:42:48,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:48,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:42:48,204 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,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:48,305 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,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:48,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905622400] [2025-03-14 00:42:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905622400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:42:48,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:42:48,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:42:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188968542] [2025-03-14 00:42:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:42:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:42:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:42:48,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:42:48,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-03-14 00:42:48,349 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,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:48,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-03-14 00:42:48,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:48,411 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-03-14 00:42:48,411 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:42:48,411 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 19 event pairs, 4 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 46. Up to 23 conditions per place. [2025-03-14 00:42:48,417 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 15 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-03-14 00:42:48,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 84 flow [2025-03-14 00:42:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:42:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:42:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-14 00:42:48,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 00:42:48,434 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,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 84 flow [2025-03-14 00:42:48,438 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,439 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 44 flow [2025-03-14 00:42:48,441 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,444 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-03-14 00:42:48,444 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 44 flow [2025-03-14 00:42:48,445 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,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:48,445 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,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:42:48,446 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,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1859118155, now seen corresponding path program 1 times [2025-03-14 00:42:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:48,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578292194] [2025-03-14 00:42:48,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:48,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:42:48,489 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,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:48,972 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,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578292194] [2025-03-14 00:42:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578292194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:42:48,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:42:48,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:42:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978224095] [2025-03-14 00:42:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:42:48,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:42:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:48,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:42:48,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:42:48,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2025-03-14 00:42:48,988 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:48,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:48,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2025-03-14 00:42:48,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:49,123 INFO L124 PetriNetUnfolderBase]: 12/49 cut-off events. [2025-03-14 00:42:49,124 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:42:49,124 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 79 event pairs, 5 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 82. Up to 27 conditions per place. [2025-03-14 00:42:49,125 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 17 selfloop transitions, 5 changer transitions 4/29 dead transitions. [2025-03-14 00:42:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 117 flow [2025-03-14 00:42:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:42:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:42:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2025-03-14 00:42:49,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34065934065934067 [2025-03-14 00:42:49,128 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 44 flow. Second operand 7 states and 62 transitions. [2025-03-14 00:42:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 117 flow [2025-03-14 00:42:49,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:42:49,130 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 73 flow [2025-03-14 00:42:49,131 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=73, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-03-14 00:42:49,132 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-03-14 00:42:49,132 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 73 flow [2025-03-14 00:42:49,132 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,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:49,133 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,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:42:49,134 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,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1298235136, now seen corresponding path program 1 times [2025-03-14 00:42:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104955534] [2025-03-14 00:42:49,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:42:49,148 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,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:49,268 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,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104955534] [2025-03-14 00:42:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104955534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975432236] [2025-03-14 00:42:49,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:42:49,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:49,271 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,273 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,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:42:49,339 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,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:42:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:49,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 00:42:49,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:49,452 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,463 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,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:49,523 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,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975432236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:49,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-14 00:42:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256060395] [2025-03-14 00:42:49,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:49,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 00:42:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:49,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 00:42:49,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:42:49,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-03-14 00:42:49,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 73 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,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:49,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-03-14 00:42:49,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:49,679 INFO L124 PetriNetUnfolderBase]: 14/50 cut-off events. [2025-03-14 00:42:49,681 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 00:42:49,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 50 events. 14/50 cut-off events. For 3/3 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/51 useless extension candidates. Maximal degree in co-relation 123. Up to 29 conditions per place. [2025-03-14 00:42:49,682 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 19 selfloop transitions, 6 changer transitions 1/29 dead transitions. [2025-03-14 00:42:49,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 143 flow [2025-03-14 00:42:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:42:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:42:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-03-14 00:42:49,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2025-03-14 00:42:49,685 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 73 flow. Second operand 7 states and 76 transitions. [2025-03-14 00:42:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 143 flow [2025-03-14 00:42:49,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 136 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 00:42:49,686 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 96 flow [2025-03-14 00:42:49,686 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,687 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-03-14 00:42:49,687 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 96 flow [2025-03-14 00:42:49,687 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,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:49,687 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,699 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:49,887 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:49,888 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:49,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1548493249, now seen corresponding path program 2 times [2025-03-14 00:42:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:49,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360688483] [2025-03-14 00:42:49,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:42:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:49,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 00:42:49,902 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:49,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:42:49,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:50,150 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:50,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360688483] [2025-03-14 00:42:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360688483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219611682] [2025-03-14 00:42:50,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:42:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:50,153 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,155 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,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-14 00:42:50,221 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,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:42:50,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:50,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-14 00:42:50,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:50,331 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,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,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:50,421 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,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219611682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:50,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-14 00:42:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927016748] [2025-03-14 00:42:50,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:50,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 00:42:50,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:50,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 00:42:50,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-14 00:42:50,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-03-14 00:42:50,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 96 flow. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 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:50,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:50,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-03-14 00:42:50,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:50,636 INFO L124 PetriNetUnfolderBase]: 16/56 cut-off events. [2025-03-14 00:42:50,637 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 00:42:50,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 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 56 event pairs, 6 based on Foata normal form. 2/57 useless extension candidates. Maximal degree in co-relation 148. Up to 29 conditions per place. [2025-03-14 00:42:50,637 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 21 selfloop transitions, 7 changer transitions 1/32 dead transitions. [2025-03-14 00:42:50,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 180 flow [2025-03-14 00:42:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:42:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:42:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2025-03-14 00:42:50,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-14 00:42:50,642 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 96 flow. Second operand 8 states and 78 transitions. [2025-03-14 00:42:50,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 180 flow [2025-03-14 00:42:50,643 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,644 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 120 flow [2025-03-14 00:42:50,645 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,645 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-03-14 00:42:50,646 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 120 flow [2025-03-14 00:42:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 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:50,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:42:50,647 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,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:42:50,847 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:50,848 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:50,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:42:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash -23408100, now seen corresponding path program 3 times [2025-03-14 00:42:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:42:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872038438] [2025-03-14 00:42:50,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:42:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:42:50,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-14 00:42:50,870 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:50,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:42:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:51,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:42:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872038438] [2025-03-14 00:42:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872038438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:42:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253202172] [2025-03-14 00:42:51,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:42:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:42:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:42:51,471 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,474 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,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-14 00:42:51,536 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,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:42:51,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:42:51,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 00:42:51,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:42:51,681 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,695 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,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:42:51,803 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,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253202172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:42:51,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:42:51,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2025-03-14 00:42:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277829118] [2025-03-14 00:42:51,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:42:51,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 00:42:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:42:51,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 00:42:51,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-14 00:42:51,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2025-03-14 00:42:51,843 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:51,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:42:51,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2025-03-14 00:42:51,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:42:52,344 INFO L124 PetriNetUnfolderBase]: 17/57 cut-off events. [2025-03-14 00:42:52,344 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 00:42:52,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 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 54 event pairs, 1 based on Foata normal form. 5/61 useless extension candidates. Maximal degree in co-relation 174. Up to 15 conditions per place. [2025-03-14 00:42:52,345 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2025-03-14 00:42:52,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 222 flow [2025-03-14 00:42:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:42:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:42:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2025-03-14 00:42:52,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25824175824175827 [2025-03-14 00:42:52,347 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 120 flow. Second operand 14 states and 94 transitions. [2025-03-14 00:42:52,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 222 flow [2025-03-14 00:42:52,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 202 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-14 00:42:52,349 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2025-03-14 00:42:52,349 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=14, PETRI_FLOW=0, PETRI_PLACES=46, PETRI_TRANSITIONS=0} [2025-03-14 00:42:52,349 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 21 predicate places. [2025-03-14 00:42:52,350 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2025-03-14 00:42:52,350 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,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 00:42:52,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 00:42:52,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 00:42:52,359 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,553 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,553 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 00:42:52,556 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:42:52,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:42:52,561 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,561 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:42:52,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:42:52,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:42:52,562 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:42:52,562 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:47" (3/4) ... [2025-03-14 00:42:52,564 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:42:52,566 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 00:42:52,566 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 00:42:52,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-03-14 00:42:52,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-14 00:42:52,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-14 00:42:52,570 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:42:52,570 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:42:52,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:42:52,635 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:42:52,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:42:52,636 INFO L158 Benchmark]: Toolchain (without parser) took 5468.26ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.7MB in the beginning and 83.7MB in the end (delta: 27.0MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,638 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.31ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 78.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.49ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,639 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 74.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,639 INFO L158 Benchmark]: IcfgBuilder took 357.54ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 49.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,639 INFO L158 Benchmark]: TraceAbstraction took 4616.19ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 88.6MB in the end (delta: -39.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:42:52,640 INFO L158 Benchmark]: Witness Printer took 73.74ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 83.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:42:52,641 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.31ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 78.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.49ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 76.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 74.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.54ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 49.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4616.19ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 88.6MB in the end (delta: -39.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.74ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 83.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. 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.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 893 IncrementalHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 5 mSDtfsCounter, 893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 39, 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.2s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1689 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:52,655 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 Result: TRUE