./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:42:11,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:11,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:42:11,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:11,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:11,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:11,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:11,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:11,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:11,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:11,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:11,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:11,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:11,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:11,147 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:11,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:11,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:11,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:11,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:11,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:11,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:11,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:11,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-jdk21/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 -> 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 [2025-01-09 16:42:11,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:11,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:11,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:11,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:11,475 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:11,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-01-09 16:42:12,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4d07fd6a/fce336a9f04a4411afadde3f4fb0e8ff/FLAG43cbf13d5 [2025-01-09 16:42:12,940 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:12,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-01-09 16:42:12,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4d07fd6a/fce336a9f04a4411afadde3f4fb0e8ff/FLAG43cbf13d5 [2025-01-09 16:42:12,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4d07fd6a/fce336a9f04a4411afadde3f4fb0e8ff [2025-01-09 16:42:12,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:12,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:12,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:12,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:12,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:12,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:12" (1/1) ... [2025-01-09 16:42:12,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2efc453f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:12, skipping insertion in model container [2025-01-09 16:42:12,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:12" (1/1) ... [2025-01-09 16:42:12,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:13,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-01-09 16:42:13,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:13,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:13,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c[2331,2344] [2025-01-09 16:42:13,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:13,140 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:13,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13 WrapperNode [2025-01-09 16:42:13,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:13,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:13,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:13,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:13,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,162 INFO L138 Inliner]: procedures = 19, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 140 [2025-01-09 16:42:13,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:13,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:13,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:13,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:13,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:42:13,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:13,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:13,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:13,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:13,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (1/1) ... [2025-01-09 16:42:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:13,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:42:13,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:42:13,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:13,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:13,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:13,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:42:13,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:42:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:13,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:13,240 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:42:13,310 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:13,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:13,460 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:13,460 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:13,572 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:13,572 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:42:13,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:13 BoogieIcfgContainer [2025-01-09 16:42:13,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:13,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:13,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:13,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:13,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:12" (1/3) ... [2025-01-09 16:42:13,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c3d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:13, skipping insertion in model container [2025-01-09 16:42:13,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:13" (2/3) ... [2025-01-09 16:42:13,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c3d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:13, skipping insertion in model container [2025-01-09 16:42:13,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:13" (3/3) ... [2025-01-09 16:42:13,584 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-01-09 16:42:13,595 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:13,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:42:13,596 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:13,631 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:42:13,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 115 flow [2025-01-09 16:42:13,687 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-01-09 16:42:13,689 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:42:13,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 2/44 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-01-09 16:42:13,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 115 flow [2025-01-09 16:42:13,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 104 flow [2025-01-09 16:42:13,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:13,715 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;@16dd8865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:13,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:42:13,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:13,728 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-01-09 16:42:13,728 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:42:13,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:13,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:13,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 177276219, now seen corresponding path program 1 times [2025-01-09 16:42:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588412017] [2025-01-09 16:42:13,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:42:13,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:42:13,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:13,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588412017] [2025-01-09 16:42:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588412017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680897052] [2025-01-09 16:42:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:14,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:14,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:14,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-01-09 16:42:14,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-09 16:42:14,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:14,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-01-09 16:42:14,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:14,372 INFO L124 PetriNetUnfolderBase]: 1388/2193 cut-off events. [2025-01-09 16:42:14,373 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-09 16:42:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2193 events. 1388/2193 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11565 event pairs, 608 based on Foata normal form. 1/2086 useless extension candidates. Maximal degree in co-relation 3985. Up to 1117 conditions per place. [2025-01-09 16:42:14,385 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 44 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2025-01-09 16:42:14,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 256 flow [2025-01-09 16:42:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-01-09 16:42:14,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2025-01-09 16:42:14,398 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 104 flow. Second operand 3 states and 99 transitions. [2025-01-09 16:42:14,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 256 flow [2025-01-09 16:42:14,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:42:14,410 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 117 flow [2025-01-09 16:42:14,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-01-09 16:42:14,416 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-01-09 16:42:14,416 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 117 flow [2025-01-09 16:42:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-09 16:42:14,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:14,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:14,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:14,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1059488094, now seen corresponding path program 1 times [2025-01-09 16:42:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215366662] [2025-01-09 16:42:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:14,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:14,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:14,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:14,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215366662] [2025-01-09 16:42:14,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215366662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:14,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936845454] [2025-01-09 16:42:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:14,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:14,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:14,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:14,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2025-01-09 16:42:14,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-01-09 16:42:14,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:14,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2025-01-09 16:42:14,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:14,739 INFO L124 PetriNetUnfolderBase]: 2053/3190 cut-off events. [2025-01-09 16:42:14,740 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-09 16:42:14,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 3190 events. 2053/3190 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16553 event pairs, 1611 based on Foata normal form. 0/3146 useless extension candidates. Maximal degree in co-relation 4806. Up to 2732 conditions per place. [2025-01-09 16:42:14,754 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 43 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-01-09 16:42:14,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 251 flow [2025-01-09 16:42:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-01-09 16:42:14,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624113475177305 [2025-01-09 16:42:14,758 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 117 flow. Second operand 3 states and 88 transitions. [2025-01-09 16:42:14,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 251 flow [2025-01-09 16:42:14,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:14,760 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 156 flow [2025-01-09 16:42:14,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-01-09 16:42:14,761 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2025-01-09 16:42:14,761 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 156 flow [2025-01-09 16:42:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-01-09 16:42:14,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:14,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:14,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:14,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 708667368, now seen corresponding path program 1 times [2025-01-09 16:42:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:14,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979420029] [2025-01-09 16:42:14,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:14,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:14,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:14,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:14,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979420029] [2025-01-09 16:42:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979420029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711228743] [2025-01-09 16:42:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:14,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:14,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:14,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:14,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:14,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-01-09 16:42:14,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:14,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:14,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:15,437 INFO L124 PetriNetUnfolderBase]: 2102/3781 cut-off events. [2025-01-09 16:42:15,437 INFO L125 PetriNetUnfolderBase]: For 228/234 co-relation queries the response was YES. [2025-01-09 16:42:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7815 conditions, 3781 events. 2102/3781 cut-off events. For 228/234 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 25407 event pairs, 685 based on Foata normal form. 38/3753 useless extension candidates. Maximal degree in co-relation 5960. Up to 1318 conditions per place. [2025-01-09 16:42:15,456 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 56 selfloop transitions, 15 changer transitions 7/97 dead transitions. [2025-01-09 16:42:15,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 97 transitions, 420 flow [2025-01-09 16:42:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-01-09 16:42:15,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6978723404255319 [2025-01-09 16:42:15,459 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 156 flow. Second operand 5 states and 164 transitions. [2025-01-09 16:42:15,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 97 transitions, 420 flow [2025-01-09 16:42:15,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:15,467 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 227 flow [2025-01-09 16:42:15,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2025-01-09 16:42:15,468 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2025-01-09 16:42:15,468 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 227 flow [2025-01-09 16:42:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-01-09 16:42:15,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:15,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:15,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:15,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:15,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1191278576, now seen corresponding path program 2 times [2025-01-09 16:42:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:15,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804994818] [2025-01-09 16:42:15,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:15,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:15,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:15,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:15,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804994818] [2025-01-09 16:42:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804994818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543787732] [2025-01-09 16:42:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:15,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:15,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:15,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:15,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:15,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-01-09 16:42:15,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:15,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:15,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:15,966 INFO L124 PetriNetUnfolderBase]: 1967/3653 cut-off events. [2025-01-09 16:42:15,966 INFO L125 PetriNetUnfolderBase]: For 1803/1837 co-relation queries the response was YES. [2025-01-09 16:42:15,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9111 conditions, 3653 events. 1967/3653 cut-off events. For 1803/1837 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 25043 event pairs, 601 based on Foata normal form. 44/3624 useless extension candidates. Maximal degree in co-relation 6760. Up to 1183 conditions per place. [2025-01-09 16:42:15,984 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 56 selfloop transitions, 17 changer transitions 6/98 dead transitions. [2025-01-09 16:42:15,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 495 flow [2025-01-09 16:42:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:42:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:42:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-01-09 16:42:15,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6893617021276596 [2025-01-09 16:42:15,985 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 227 flow. Second operand 5 states and 162 transitions. [2025-01-09 16:42:15,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 495 flow [2025-01-09 16:42:15,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 495 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:42:15,988 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 291 flow [2025-01-09 16:42:15,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-01-09 16:42:15,988 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2025-01-09 16:42:15,991 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 291 flow [2025-01-09 16:42:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-01-09 16:42:15,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:15,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:15,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:42:15,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:15,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1187769804, now seen corresponding path program 3 times [2025-01-09 16:42:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494093458] [2025-01-09 16:42:15,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:42:15,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:16,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:16,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:16,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:42:16,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494093458] [2025-01-09 16:42:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494093458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:42:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930251101] [2025-01-09 16:42:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:42:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:16,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:42:16,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:42:16,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:16,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-09 16:42:16,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:16,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:16,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:16,457 INFO L124 PetriNetUnfolderBase]: 1390/2606 cut-off events. [2025-01-09 16:42:16,458 INFO L125 PetriNetUnfolderBase]: For 2740/2765 co-relation queries the response was YES. [2025-01-09 16:42:16,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 2606 events. 1390/2606 cut-off events. For 2740/2765 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16603 event pairs, 371 based on Foata normal form. 58/2604 useless extension candidates. Maximal degree in co-relation 6711. Up to 964 conditions per place. [2025-01-09 16:42:16,465 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 51 selfloop transitions, 24 changer transitions 26/118 dead transitions. [2025-01-09 16:42:16,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 712 flow [2025-01-09 16:42:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-01-09 16:42:16,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2025-01-09 16:42:16,467 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 291 flow. Second operand 6 states and 186 transitions. [2025-01-09 16:42:16,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 712 flow [2025-01-09 16:42:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 675 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:42:16,470 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 346 flow [2025-01-09 16:42:16,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-01-09 16:42:16,471 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-01-09 16:42:16,471 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 346 flow [2025-01-09 16:42:16,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-09 16:42:16,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:16,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:16,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:42:16,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -543593100, now seen corresponding path program 4 times [2025-01-09 16:42:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949478639] [2025-01-09 16:42:16,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:42:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:16,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:42:16,496 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:16,497 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:42:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949478639] [2025-01-09 16:42:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949478639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:16,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:16,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499395339] [2025-01-09 16:42:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:16,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:16,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:16,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:16,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:16,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:16,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:16,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:16,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:16,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:16,910 INFO L124 PetriNetUnfolderBase]: 638/1248 cut-off events. [2025-01-09 16:42:16,910 INFO L125 PetriNetUnfolderBase]: For 1459/1485 co-relation queries the response was YES. [2025-01-09 16:42:16,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1248 events. 638/1248 cut-off events. For 1459/1485 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6919 event pairs, 190 based on Foata normal form. 36/1246 useless extension candidates. Maximal degree in co-relation 1371. Up to 453 conditions per place. [2025-01-09 16:42:16,914 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 46 selfloop transitions, 20 changer transitions 18/101 dead transitions. [2025-01-09 16:42:16,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 639 flow [2025-01-09 16:42:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2025-01-09 16:42:16,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797872340425532 [2025-01-09 16:42:16,915 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 346 flow. Second operand 8 states and 218 transitions. [2025-01-09 16:42:16,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 639 flow [2025-01-09 16:42:16,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 617 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:16,918 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 335 flow [2025-01-09 16:42:16,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2025-01-09 16:42:16,919 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2025-01-09 16:42:16,919 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 335 flow [2025-01-09 16:42:16,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:16,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:16,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:16,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:42:16,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1050100122, now seen corresponding path program 5 times [2025-01-09 16:42:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527455171] [2025-01-09 16:42:16,920 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:16,926 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:16,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:16,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:16,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:17,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527455171] [2025-01-09 16:42:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527455171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513009230] [2025-01-09 16:42:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:17,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:17,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:17,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:17,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:17,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:17,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:17,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:17,207 INFO L124 PetriNetUnfolderBase]: 454/899 cut-off events. [2025-01-09 16:42:17,207 INFO L125 PetriNetUnfolderBase]: For 1788/1794 co-relation queries the response was YES. [2025-01-09 16:42:17,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 899 events. 454/899 cut-off events. For 1788/1794 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4574 event pairs, 131 based on Foata normal form. 20/887 useless extension candidates. Maximal degree in co-relation 1365. Up to 308 conditions per place. [2025-01-09 16:42:17,211 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 40 selfloop transitions, 14 changer transitions 24/92 dead transitions. [2025-01-09 16:42:17,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 92 transitions, 612 flow [2025-01-09 16:42:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2025-01-09 16:42:17,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664893617021277 [2025-01-09 16:42:17,212 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 335 flow. Second operand 8 states and 213 transitions. [2025-01-09 16:42:17,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 92 transitions, 612 flow [2025-01-09 16:42:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 554 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-01-09 16:42:17,216 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 256 flow [2025-01-09 16:42:17,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-01-09 16:42:17,217 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2025-01-09 16:42:17,217 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 256 flow [2025-01-09 16:42:17,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:17,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:17,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:17,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:42:17,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:42:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash -431181202, now seen corresponding path program 2 times [2025-01-09 16:42:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:17,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758254498] [2025-01-09 16:42:17,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:17,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:42:17,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:17,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:42:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:17,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758254498] [2025-01-09 16:42:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758254498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:42:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177826232] [2025-01-09 16:42:17,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:42:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:42:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:42:17,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-09 16:42:17,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:17,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:17,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-09 16:42:17,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:17,464 INFO L124 PetriNetUnfolderBase]: 153/325 cut-off events. [2025-01-09 16:42:17,465 INFO L125 PetriNetUnfolderBase]: For 426/432 co-relation queries the response was YES. [2025-01-09 16:42:17,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 325 events. 153/325 cut-off events. For 426/432 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1126 event pairs, 52 based on Foata normal form. 20/335 useless extension candidates. Maximal degree in co-relation 603. Up to 125 conditions per place. [2025-01-09 16:42:17,466 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 0 selfloop transitions, 0 changer transitions 64/64 dead transitions. [2025-01-09 16:42:17,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 398 flow [2025-01-09 16:42:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:42:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:42:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2025-01-09 16:42:17,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5132978723404256 [2025-01-09 16:42:17,467 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 256 flow. Second operand 8 states and 193 transitions. [2025-01-09 16:42:17,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 398 flow [2025-01-09 16:42:17,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 64 transitions, 335 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-01-09 16:42:17,473 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-01-09 16:42:17,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-01-09 16:42:17,473 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-01-09 16:42:17,473 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-01-09 16:42:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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-01-09 16:42:17,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:42:17,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:42:17,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:42:17,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-09 16:42:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:42:17,477 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2025-01-09 16:42:17,479 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:42:17,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:42:17,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:42:17 BasicIcfg [2025-01-09 16:42:17,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:42:17,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:42:17,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:42:17,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:42:17,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:13" (3/4) ... [2025-01-09 16:42:17,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:42:17,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 16:42:17,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 16:42:17,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 16:42:17,493 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2025-01-09 16:42:17,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 16:42:17,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 16:42:17,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:42:17,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:42:17,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:42:17,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:42:17,563 INFO L158 Benchmark]: Toolchain (without parser) took 4591.22ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.3MB in the beginning and 178.5MB in the end (delta: -66.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2025-01-09 16:42:17,563 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:17,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.67ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:17,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:17,564 INFO L158 Benchmark]: Boogie Preprocessor took 25.69ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:42:17,564 INFO L158 Benchmark]: RCFGBuilder took 382.40ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 68.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:42:17,565 INFO L158 Benchmark]: TraceAbstraction took 3906.53ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 67.4MB in the beginning and 184.6MB in the end (delta: -117.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:17,565 INFO L158 Benchmark]: Witness Printer took 77.74ms. Allocated memory is still 243.3MB. Free memory was 184.6MB in the beginning and 178.5MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:42:17,567 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 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.67ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.26ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.69ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 382.40ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 68.2MB in the end (delta: 29.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3906.53ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 67.4MB in the beginning and 184.6MB in the end (delta: -117.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.74ms. Allocated memory is still 243.3MB. Free memory was 184.6MB in the beginning and 178.5MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: 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 7 procedures, 73 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 11 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=5, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-01-09 16:42:17,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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