./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:44:25,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:44:25,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:44:25,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:44:25,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:44:25,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:44:25,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:44:25,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:44:25,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:44:25,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:44:25,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:44:25,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:44:25,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:44:25,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:44:25,247 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:44:25,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:44:25,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:44:25,247 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:44:25,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:44:25,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:44:25,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:44:25,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:44:25,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:44:25,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:44:25,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:44:25,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:44:25,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:44:25,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:44:25,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:44:25,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:44:25,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:44:25,251 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-03-14 00:44:25,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:44:25,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:44:25,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:44:25,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:44:25,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:44:25,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-03-14 00:44:26,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d83eb17/162c9fb1e9a94db5bf3a932b7369cfdc/FLAG102480795 [2025-03-14 00:44:26,958 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:44:26,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-03-14 00:44:26,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d83eb17/162c9fb1e9a94db5bf3a932b7369cfdc/FLAG102480795 [2025-03-14 00:44:27,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d83eb17/162c9fb1e9a94db5bf3a932b7369cfdc [2025-03-14 00:44:27,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:44:27,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:44:27,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:44:27,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:44:27,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:44:27,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f79748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27, skipping insertion in model container [2025-03-14 00:44:27,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:44:27,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2025-03-14 00:44:27,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:44:27,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:44:27,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2025-03-14 00:44:27,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:44:27,736 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:44:27,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27 WrapperNode [2025-03-14 00:44:27,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:44:27,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:44:27,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:44:27,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:44:27,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,778 INFO L138 Inliner]: procedures = 277, calls = 35, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 144 [2025-03-14 00:44:27,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:44:27,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:44:27,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:44:27,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:44:27,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,807 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-03-14 00:44:27,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:44:27,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:44:27,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:44:27,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:44:27,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (1/1) ... [2025-03-14 00:44:27,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:44:27,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:27,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:44:27,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:44:27,861 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 00:44:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 00:44:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:44:27,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:44:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:44:27,863 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:44:27,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:44:27,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:44:28,220 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-14 00:44:28,220 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem37#1; [2025-03-14 00:44:28,220 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret36#1; [2025-03-14 00:44:28,221 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:44:28,222 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:44:28,222 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:44:28,420 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:44:28,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:28 BoogieIcfgContainer [2025-03-14 00:44:28,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:44:28,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:44:28,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:44:28,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:44:28,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:44:27" (1/3) ... [2025-03-14 00:44:28,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddde656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:44:28, skipping insertion in model container [2025-03-14 00:44:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:44:27" (2/3) ... [2025-03-14 00:44:28,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddde656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:44:28, skipping insertion in model container [2025-03-14 00:44:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:28" (3/3) ... [2025-03-14 00:44:28,428 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-03-14 00:44:28,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:44:28,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 30 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-14 00:44:28,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:44:28,488 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:44:28,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 82 flow [2025-03-14 00:44:28,535 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-14 00:44:28,538 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:44:28,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 5/32 cut-off events. For 2/2 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/25 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-03-14 00:44:28,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 82 flow [2025-03-14 00:44:28,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 69 flow [2025-03-14 00:44:28,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:44:28,560 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;@3f8f2261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:44:28,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:44:28,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:44:28,571 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-14 00:44:28,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:44:28,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:28,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:28,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash -614144600, now seen corresponding path program 1 times [2025-03-14 00:44:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958826194] [2025-03-14 00:44:28,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:44:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:44:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958826194] [2025-03-14 00:44:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958826194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:28,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:44:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543060917] [2025-03-14 00:44:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:28,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:44:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:28,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:44:28,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:44:28,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-14 00:44:28,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:28,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:28,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-14 00:44:28,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:29,177 INFO L124 PetriNetUnfolderBase]: 307/564 cut-off events. [2025-03-14 00:44:29,177 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 00:44:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 564 events. 307/564 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2459 event pairs, 53 based on Foata normal form. 40/558 useless extension candidates. Maximal degree in co-relation 1043. Up to 358 conditions per place. [2025-03-14 00:44:29,184 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 41 selfloop transitions, 3 changer transitions 2/52 dead transitions. [2025-03-14 00:44:29,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 214 flow [2025-03-14 00:44:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:44:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:44:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-14 00:44:29,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2025-03-14 00:44:29,203 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 69 flow. Second operand 4 states and 83 transitions. [2025-03-14 00:44:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 214 flow [2025-03-14 00:44:29,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:44:29,211 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 82 flow [2025-03-14 00:44:29,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-03-14 00:44:29,216 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-03-14 00:44:29,216 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 82 flow [2025-03-14 00:44:29,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:29,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:29,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:29,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:44:29,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:29,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1559438173, now seen corresponding path program 1 times [2025-03-14 00:44:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173484545] [2025-03-14 00:44:29,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:29,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:44:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:44:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173484545] [2025-03-14 00:44:29,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173484545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:29,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852028925] [2025-03-14 00:44:29,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:29,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:29,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:44:29,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:44:29,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:44:29,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:29,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 00:44:29,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:29,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:29,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852028925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:29,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-14 00:44:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795309609] [2025-03-14 00:44:29,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:29,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:44:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:29,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:44:29,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:44:29,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:29,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 82 flow. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:29,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:29,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:30,391 INFO L124 PetriNetUnfolderBase]: 1257/2332 cut-off events. [2025-03-14 00:44:30,391 INFO L125 PetriNetUnfolderBase]: For 297/299 co-relation queries the response was YES. [2025-03-14 00:44:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 2332 events. 1257/2332 cut-off events. For 297/299 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12425 event pairs, 153 based on Foata normal form. 48/2272 useless extension candidates. Maximal degree in co-relation 4362. Up to 365 conditions per place. [2025-03-14 00:44:30,411 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 163 selfloop transitions, 32 changer transitions 4/204 dead transitions. [2025-03-14 00:44:30,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 204 transitions, 900 flow [2025-03-14 00:44:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:44:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:44:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 313 transitions. [2025-03-14 00:44:30,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6137254901960785 [2025-03-14 00:44:30,416 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 82 flow. Second operand 15 states and 313 transitions. [2025-03-14 00:44:30,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 204 transitions, 900 flow [2025-03-14 00:44:30,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 204 transitions, 896 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:44:30,422 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 329 flow [2025-03-14 00:44:30,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=329, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2025-03-14 00:44:30,423 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2025-03-14 00:44:30,423 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 329 flow [2025-03-14 00:44:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:30,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:30,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:30,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:44:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:30,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1831371690, now seen corresponding path program 1 times [2025-03-14 00:44:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234375612] [2025-03-14 00:44:30,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:30,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:44:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:44:30,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:30,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234375612] [2025-03-14 00:44:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234375612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:44:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292037314] [2025-03-14 00:44:30,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:30,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:44:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:30,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:44:30,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:44:30,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-14 00:44:30,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:30,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:30,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-14 00:44:30,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:30,908 INFO L124 PetriNetUnfolderBase]: 669/1351 cut-off events. [2025-03-14 00:44:30,908 INFO L125 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2025-03-14 00:44:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 1351 events. 669/1351 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6867 event pairs, 231 based on Foata normal form. 66/1398 useless extension candidates. Maximal degree in co-relation 2914. Up to 634 conditions per place. [2025-03-14 00:44:30,916 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 43 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-14 00:44:30,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 339 flow [2025-03-14 00:44:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:44:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:44:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-14 00:44:30,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-03-14 00:44:30,917 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 329 flow. Second operand 3 states and 58 transitions. [2025-03-14 00:44:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 339 flow [2025-03-14 00:44:30,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 307 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-14 00:44:30,924 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 198 flow [2025-03-14 00:44:30,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-03-14 00:44:30,924 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2025-03-14 00:44:30,924 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 198 flow [2025-03-14 00:44:30,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:30,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:30,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:30,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:44:30,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:30,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1401005569, now seen corresponding path program 1 times [2025-03-14 00:44:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908379986] [2025-03-14 00:44:30,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:44:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:44:30,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:30,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:31,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908379986] [2025-03-14 00:44:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908379986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:31,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:44:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:44:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471945405] [2025-03-14 00:44:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:31,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:44:31,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:31,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:44:31,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:44:31,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-14 00:44:31,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:31,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:31,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-14 00:44:31,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:31,726 INFO L124 PetriNetUnfolderBase]: 833/1677 cut-off events. [2025-03-14 00:44:31,727 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-03-14 00:44:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1677 events. 833/1677 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8778 event pairs, 255 based on Foata normal form. 0/1652 useless extension candidates. Maximal degree in co-relation 3447. Up to 977 conditions per place. [2025-03-14 00:44:31,738 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 7 changer transitions 5/82 dead transitions. [2025-03-14 00:44:31,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 438 flow [2025-03-14 00:44:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:44:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:44:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-14 00:44:31,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5647058823529412 [2025-03-14 00:44:31,740 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 198 flow. Second operand 5 states and 96 transitions. [2025-03-14 00:44:31,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 438 flow [2025-03-14 00:44:31,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:44:31,747 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 251 flow [2025-03-14 00:44:31,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-03-14 00:44:31,749 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2025-03-14 00:44:31,749 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 251 flow [2025-03-14 00:44:31,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:31,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:31,749 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:31,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:44:31,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:31,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -804365198, now seen corresponding path program 1 times [2025-03-14 00:44:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:31,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940877164] [2025-03-14 00:44:31,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:31,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:44:31,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:44:31,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:31,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:32,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940877164] [2025-03-14 00:44:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940877164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233099958] [2025-03-14 00:44:32,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:32,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:32,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:32,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:44:32,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:44:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:44:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:32,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-14 00:44:32,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:32,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:32,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-03-14 00:44:32,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 32 [2025-03-14 00:44:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:32,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:32,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2025-03-14 00:44:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233099958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:32,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:32,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-14 00:44:32,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885039730] [2025-03-14 00:44:32,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:32,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 00:44:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:32,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 00:44:32,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:44:32,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:32,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 251 flow. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:32,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:32,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:32,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:33,854 INFO L124 PetriNetUnfolderBase]: 1801/3573 cut-off events. [2025-03-14 00:44:33,855 INFO L125 PetriNetUnfolderBase]: For 1644/1644 co-relation queries the response was YES. [2025-03-14 00:44:33,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8116 conditions, 3573 events. 1801/3573 cut-off events. For 1644/1644 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 19802 event pairs, 357 based on Foata normal form. 14/3517 useless extension candidates. Maximal degree in co-relation 7036. Up to 584 conditions per place. [2025-03-14 00:44:33,876 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 204 selfloop transitions, 54 changer transitions 20/283 dead transitions. [2025-03-14 00:44:33,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 283 transitions, 1525 flow [2025-03-14 00:44:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 00:44:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 00:44:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 426 transitions. [2025-03-14 00:44:33,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447570332480819 [2025-03-14 00:44:33,878 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 251 flow. Second operand 23 states and 426 transitions. [2025-03-14 00:44:33,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 283 transitions, 1525 flow [2025-03-14 00:44:33,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 283 transitions, 1514 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 00:44:33,887 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 556 flow [2025-03-14 00:44:33,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=556, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2025-03-14 00:44:33,888 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2025-03-14 00:44:33,888 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 556 flow [2025-03-14 00:44:33,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:33,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:33,888 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:33,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:44:34,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:34,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:34,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1981300099, now seen corresponding path program 1 times [2025-03-14 00:44:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722509654] [2025-03-14 00:44:34,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:34,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:44:34,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:44:34,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:34,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722509654] [2025-03-14 00:44:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722509654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659237905] [2025-03-14 00:44:34,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:34,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:34,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:34,285 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:34,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:44:34,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:44:34,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:44:34,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:34,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 00:44:34,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:34,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:34,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:34,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 00:44:34,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659237905] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:34,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 00:44:34,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 12 [2025-03-14 00:44:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140468417] [2025-03-14 00:44:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:34,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:44:34,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:34,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:44:34,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:44:34,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:34,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:34,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:34,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:34,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:35,002 INFO L124 PetriNetUnfolderBase]: 2169/4327 cut-off events. [2025-03-14 00:44:35,003 INFO L125 PetriNetUnfolderBase]: For 3841/3841 co-relation queries the response was YES. [2025-03-14 00:44:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10385 conditions, 4327 events. 2169/4327 cut-off events. For 3841/3841 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 25623 event pairs, 463 based on Foata normal form. 24/4316 useless extension candidates. Maximal degree in co-relation 10022. Up to 1657 conditions per place. [2025-03-14 00:44:35,029 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 82 selfloop transitions, 52 changer transitions 2/141 dead transitions. [2025-03-14 00:44:35,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1024 flow [2025-03-14 00:44:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:44:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:44:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-14 00:44:35,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2025-03-14 00:44:35,031 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 556 flow. Second operand 6 states and 112 transitions. [2025-03-14 00:44:35,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1024 flow [2025-03-14 00:44:35,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 141 transitions, 990 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-03-14 00:44:35,050 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 771 flow [2025-03-14 00:44:35,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=771, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2025-03-14 00:44:35,051 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2025-03-14 00:44:35,052 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 771 flow [2025-03-14 00:44:35,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:35,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:35,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:35,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 00:44:35,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:35,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1139498936, now seen corresponding path program 1 times [2025-03-14 00:44:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081893687] [2025-03-14 00:44:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:35,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:44:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:44:35,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:35,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081893687] [2025-03-14 00:44:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081893687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990166664] [2025-03-14 00:44:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:44:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:35,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 00:44:35,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 00:44:35,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 00:44:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:44:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:35,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 00:44:35,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:35,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-14 00:44:36,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2025-03-14 00:44:36,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 94 [2025-03-14 00:44:36,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 43 [2025-03-14 00:44:36,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:36,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 57 [2025-03-14 00:44:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:36,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:37,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:37,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2025-03-14 00:44:37,061 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-14 00:44:37,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2025-03-14 00:44:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990166664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:37,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-14 00:44:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101317890] [2025-03-14 00:44:37,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 00:44:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:37,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 00:44:37,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-14 00:44:37,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:37,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 771 flow. Second operand has 17 states, 17 states have (on average 11.058823529411764) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:37,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:37,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:37,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:39,361 INFO L124 PetriNetUnfolderBase]: 3480/6886 cut-off events. [2025-03-14 00:44:39,362 INFO L125 PetriNetUnfolderBase]: For 9815/9815 co-relation queries the response was YES. [2025-03-14 00:44:39,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17416 conditions, 6886 events. 3480/6886 cut-off events. For 9815/9815 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 40701 event pairs, 583 based on Foata normal form. 49/6900 useless extension candidates. Maximal degree in co-relation 16567. Up to 1142 conditions per place. [2025-03-14 00:44:39,427 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 238 selfloop transitions, 106 changer transitions 40/389 dead transitions. [2025-03-14 00:44:39,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 389 transitions, 2731 flow [2025-03-14 00:44:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 00:44:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 00:44:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 486 transitions. [2025-03-14 00:44:39,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-14 00:44:39,429 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 771 flow. Second operand 27 states and 486 transitions. [2025-03-14 00:44:39,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 389 transitions, 2731 flow [2025-03-14 00:44:39,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 389 transitions, 2648 flow, removed 30 selfloop flow, removed 1 redundant places. [2025-03-14 00:44:39,468 INFO L231 Difference]: Finished difference. Result has 124 places, 152 transitions, 1496 flow [2025-03-14 00:44:39,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1496, PETRI_PLACES=124, PETRI_TRANSITIONS=152} [2025-03-14 00:44:39,470 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2025-03-14 00:44:39,470 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 1496 flow [2025-03-14 00:44:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.058823529411764) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:39,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:39,471 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-14 00:44:39,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 00:44:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:39,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1608716308, now seen corresponding path program 2 times [2025-03-14 00:44:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033026188] [2025-03-14 00:44:39,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:39,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:39,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-14 00:44:39,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 00:44:39,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:39,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033026188] [2025-03-14 00:44:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033026188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995302462] [2025-03-14 00:44:40,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:40,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:40,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:40,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 00:44:40,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-14 00:44:40,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 00:44:40,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:40,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:40,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 00:44:40,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:40,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:40,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:40,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:40,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-14 00:44:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:40,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:40,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995302462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:40,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-14 00:44:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343381642] [2025-03-14 00:44:40,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 00:44:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:40,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 00:44:40,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-14 00:44:40,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:40,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 152 transitions, 1496 flow. Second operand has 20 states, 20 states have (on average 10.6) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:40,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:40,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:40,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:42,641 INFO L124 PetriNetUnfolderBase]: 8818/17255 cut-off events. [2025-03-14 00:44:42,641 INFO L125 PetriNetUnfolderBase]: For 47901/47901 co-relation queries the response was YES. [2025-03-14 00:44:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48606 conditions, 17255 events. 8818/17255 cut-off events. For 47901/47901 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 121896 event pairs, 2039 based on Foata normal form. 449/17697 useless extension candidates. Maximal degree in co-relation 46729. Up to 2884 conditions per place. [2025-03-14 00:44:42,778 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 409 selfloop transitions, 295 changer transitions 2/711 dead transitions. [2025-03-14 00:44:42,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 711 transitions, 6460 flow [2025-03-14 00:44:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 00:44:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 00:44:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 743 transitions. [2025-03-14 00:44:42,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5203081232492998 [2025-03-14 00:44:42,780 INFO L175 Difference]: Start difference. First operand has 124 places, 152 transitions, 1496 flow. Second operand 42 states and 743 transitions. [2025-03-14 00:44:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 711 transitions, 6460 flow [2025-03-14 00:44:42,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 711 transitions, 6273 flow, removed 72 selfloop flow, removed 8 redundant places. [2025-03-14 00:44:42,977 INFO L231 Difference]: Finished difference. Result has 157 places, 357 transitions, 4270 flow [2025-03-14 00:44:42,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4270, PETRI_PLACES=157, PETRI_TRANSITIONS=357} [2025-03-14 00:44:42,978 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2025-03-14 00:44:42,979 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 357 transitions, 4270 flow [2025-03-14 00:44:42,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.6) internal successors, (212), 20 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:42,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:42,979 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-14 00:44:42,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 00:44:43,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:43,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:43,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1743029775, now seen corresponding path program 3 times [2025-03-14 00:44:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:43,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667360550] [2025-03-14 00:44:43,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:43,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-14 00:44:43,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 00:44:43,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-14 00:44:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667360550] [2025-03-14 00:44:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667360550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554631125] [2025-03-14 00:44:43,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:43,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:43,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:43,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 00:44:43,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-14 00:44:43,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 00:44:43,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-14 00:44:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:43,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 00:44:43,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:43,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 00:44:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554631125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:44:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 00:44:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2025-03-14 00:44:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377396038] [2025-03-14 00:44:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:44:43,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:44:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:43,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:44:43,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:44:43,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:43,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 357 transitions, 4270 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:43,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:43,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:44,854 INFO L124 PetriNetUnfolderBase]: 6849/12853 cut-off events. [2025-03-14 00:44:44,854 INFO L125 PetriNetUnfolderBase]: For 24875/24875 co-relation queries the response was YES. [2025-03-14 00:44:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34414 conditions, 12853 events. 6849/12853 cut-off events. For 24875/24875 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 87541 event pairs, 506 based on Foata normal form. 0/12225 useless extension candidates. Maximal degree in co-relation 33907. Up to 4257 conditions per place. [2025-03-14 00:44:44,913 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 250 selfloop transitions, 10 changer transitions 94/385 dead transitions. [2025-03-14 00:44:44,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 385 transitions, 4417 flow [2025-03-14 00:44:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 00:44:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 00:44:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2025-03-14 00:44:44,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6213235294117647 [2025-03-14 00:44:44,915 INFO L175 Difference]: Start difference. First operand has 157 places, 357 transitions, 4270 flow. Second operand 8 states and 169 transitions. [2025-03-14 00:44:44,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 385 transitions, 4417 flow [2025-03-14 00:44:45,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 385 transitions, 3867 flow, removed 121 selfloop flow, removed 24 redundant places. [2025-03-14 00:44:45,008 INFO L231 Difference]: Finished difference. Result has 128 places, 144 transitions, 1264 flow [2025-03-14 00:44:45,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1264, PETRI_PLACES=128, PETRI_TRANSITIONS=144} [2025-03-14 00:44:45,009 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2025-03-14 00:44:45,009 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 144 transitions, 1264 flow [2025-03-14 00:44:45,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:45,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:45,009 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:45,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 00:44:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:45,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:45,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:45,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1635453765, now seen corresponding path program 2 times [2025-03-14 00:44:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:45,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812612920] [2025-03-14 00:44:45,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:45,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-14 00:44:45,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 00:44:45,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 00:44:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812612920] [2025-03-14 00:44:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812612920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280207503] [2025-03-14 00:44:46,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:44:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:46,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:46,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 00:44:46,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-14 00:44:46,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 00:44:46,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:44:46,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:46,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 00:44:46,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:46,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 00:44:46,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-14 00:44:46,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-03-14 00:44:46,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-14 00:44:46,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2025-03-14 00:44:46,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:46,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2025-03-14 00:44:46,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:46,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 69 [2025-03-14 00:44:47,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:47,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 107 [2025-03-14 00:44:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:47,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280207503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:48,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-14 00:44:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463802110] [2025-03-14 00:44:48,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 00:44:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 00:44:48,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-14 00:44:48,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:48,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 144 transitions, 1264 flow. Second operand has 24 states, 24 states have (on average 11.125) internal successors, (267), 24 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:48,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:48,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:48,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:50,367 INFO L124 PetriNetUnfolderBase]: 4227/8426 cut-off events. [2025-03-14 00:44:50,367 INFO L125 PetriNetUnfolderBase]: For 22653/22967 co-relation queries the response was YES. [2025-03-14 00:44:50,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24055 conditions, 8426 events. 4227/8426 cut-off events. For 22653/22967 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 55158 event pairs, 622 based on Foata normal form. 185/8606 useless extension candidates. Maximal degree in co-relation 23591. Up to 1450 conditions per place. [2025-03-14 00:44:50,409 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 174 selfloop transitions, 49 changer transitions 192/419 dead transitions. [2025-03-14 00:44:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 419 transitions, 3233 flow [2025-03-14 00:44:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 00:44:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 00:44:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 438 transitions. [2025-03-14 00:44:50,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2025-03-14 00:44:50,411 INFO L175 Difference]: Start difference. First operand has 128 places, 144 transitions, 1264 flow. Second operand 27 states and 438 transitions. [2025-03-14 00:44:50,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 419 transitions, 3233 flow [2025-03-14 00:44:50,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 419 transitions, 3139 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-14 00:44:50,478 INFO L231 Difference]: Finished difference. Result has 142 places, 92 transitions, 791 flow [2025-03-14 00:44:50,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=791, PETRI_PLACES=142, PETRI_TRANSITIONS=92} [2025-03-14 00:44:50,479 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2025-03-14 00:44:50,479 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 92 transitions, 791 flow [2025-03-14 00:44:50,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.125) internal successors, (267), 24 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:50,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:50,480 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:50,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 00:44:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:50,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash -460819850, now seen corresponding path program 3 times [2025-03-14 00:44:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080809293] [2025-03-14 00:44:50,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:50,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-14 00:44:50,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 00:44:50,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:44:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:44:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080809293] [2025-03-14 00:44:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080809293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:44:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990975129] [2025-03-14 00:44:51,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:44:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:44:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:44:51,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:44:51,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 00:44:51,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-14 00:44:52,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 00:44:52,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 00:44:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:44:52,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-14 00:44:52,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:44:52,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 00:44:52,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-03-14 00:44:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2025-03-14 00:44:52,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2025-03-14 00:44:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2025-03-14 00:44:52,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2025-03-14 00:44:52,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2025-03-14 00:44:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 157 [2025-03-14 00:44:52,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2025-03-14 00:44:52,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 120 [2025-03-14 00:44:56,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:44:56,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 399 treesize of output 207 [2025-03-14 00:44:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:56,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:44:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:44:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990975129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:44:57,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:44:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2025-03-14 00:44:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268608881] [2025-03-14 00:44:57,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:44:57,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 00:44:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:44:57,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 00:44:57,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-03-14 00:44:57,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:44:57,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 92 transitions, 791 flow. Second operand has 30 states, 30 states have (on average 10.9) internal successors, (327), 30 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:57,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:44:57,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:44:57,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:44:59,677 INFO L124 PetriNetUnfolderBase]: 1869/4021 cut-off events. [2025-03-14 00:44:59,677 INFO L125 PetriNetUnfolderBase]: For 10493/10549 co-relation queries the response was YES. [2025-03-14 00:44:59,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 4021 events. 1869/4021 cut-off events. For 10493/10549 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 22998 event pairs, 196 based on Foata normal form. 39/4055 useless extension candidates. Maximal degree in co-relation 11190. Up to 721 conditions per place. [2025-03-14 00:44:59,693 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 108 selfloop transitions, 15 changer transitions 233/360 dead transitions. [2025-03-14 00:44:59,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 360 transitions, 2502 flow [2025-03-14 00:44:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 00:44:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 00:44:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 533 transitions. [2025-03-14 00:44:59,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44789915966386556 [2025-03-14 00:44:59,695 INFO L175 Difference]: Start difference. First operand has 142 places, 92 transitions, 791 flow. Second operand 35 states and 533 transitions. [2025-03-14 00:44:59,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 360 transitions, 2502 flow [2025-03-14 00:44:59,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 360 transitions, 2303 flow, removed 55 selfloop flow, removed 27 redundant places. [2025-03-14 00:44:59,714 INFO L231 Difference]: Finished difference. Result has 148 places, 44 transitions, 279 flow [2025-03-14 00:44:59,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=279, PETRI_PLACES=148, PETRI_TRANSITIONS=44} [2025-03-14 00:44:59,714 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2025-03-14 00:44:59,714 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 44 transitions, 279 flow [2025-03-14 00:44:59,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.9) internal successors, (327), 30 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:44:59,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:44:59,714 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:44:59,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 00:44:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 00:44:59,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:44:59,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:44:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1669381757, now seen corresponding path program 4 times [2025-03-14 00:44:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:44:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126153692] [2025-03-14 00:44:59,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:44:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:44:59,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-14 00:44:59,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:44:59,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:44:59,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 33 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:45:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126153692] [2025-03-14 00:45:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126153692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:45:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336308012] [2025-03-14 00:45:01,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:45:01,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:45:01,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:45:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 00:45:01,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-14 00:45:01,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 00:45:01,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:45:01,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:45:01,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-14 00:45:01,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:45:01,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 00:45:01,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-14 00:45:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-03-14 00:45:01,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-14 00:45:01,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2025-03-14 00:45:01,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:01,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2025-03-14 00:45:01,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 00:45:01,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2025-03-14 00:45:01,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 185 [2025-03-14 00:45:01,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:01,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2025-03-14 00:45:01,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 118 [2025-03-14 00:45:02,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 365 [2025-03-14 00:45:02,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:02,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2025-03-14 00:45:02,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 427 treesize of output 374 [2025-03-14 00:45:14,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:14,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 911 treesize of output 407 [2025-03-14 00:45:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:14,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:45:15,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:45:15,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2025-03-14 00:45:15,911 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-14 00:45:15,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 107 [2025-03-14 00:45:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:45:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336308012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:45:16,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:45:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-14 00:45:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755334065] [2025-03-14 00:45:16,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:45:16,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-14 00:45:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:45:16,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-14 00:45:16,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=962, Unknown=0, NotChecked=0, Total=1190 [2025-03-14 00:45:16,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-14 00:45:16,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 44 transitions, 279 flow. Second operand has 35 states, 35 states have (on average 11.542857142857143) internal successors, (404), 35 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:16,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:45:16,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-14 00:45:16,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:45:19,345 INFO L124 PetriNetUnfolderBase]: 451/973 cut-off events. [2025-03-14 00:45:19,345 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2025-03-14 00:45:19,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 973 events. 451/973 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3221 event pairs, 39 based on Foata normal form. 7/975 useless extension candidates. Maximal degree in co-relation 2652. Up to 162 conditions per place. [2025-03-14 00:45:19,347 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-03-14 00:45:19,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 762 flow [2025-03-14 00:45:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 00:45:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 00:45:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 245 transitions. [2025-03-14 00:45:19,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42387543252595156 [2025-03-14 00:45:19,348 INFO L175 Difference]: Start difference. First operand has 148 places, 44 transitions, 279 flow. Second operand 17 states and 245 transitions. [2025-03-14 00:45:19,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 762 flow [2025-03-14 00:45:19,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 640 flow, removed 12 selfloop flow, removed 49 redundant places. [2025-03-14 00:45:19,350 INFO L231 Difference]: Finished difference. Result has 70 places, 0 transitions, 0 flow [2025-03-14 00:45:19,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=0, PETRI_PLACES=70, PETRI_TRANSITIONS=0} [2025-03-14 00:45:19,352 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2025-03-14 00:45:19,353 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 0 transitions, 0 flow [2025-03-14 00:45:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 11.542857142857143) internal successors, (404), 35 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:45:19,355 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 00:45:19,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-03-14 00:45:19,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 00:45:19,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 00:45:19,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 00:45:19,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:45:19,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 00:45:19,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:45:19,557 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2025-03-14 00:45:19,561 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:45:19,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:45:19,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:45:19 BasicIcfg [2025-03-14 00:45:19,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:45:19,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:45:19,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:45:19,565 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:45:19,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:44:28" (3/4) ... [2025-03-14 00:45:19,567 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:45:19,569 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-14 00:45:19,569 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-14 00:45:19,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-03-14 00:45:19,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-14 00:45:19,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-14 00:45:19,571 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:45:19,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:45:19,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:45:19,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:45:19,624 INFO L158 Benchmark]: Toolchain (without parser) took 52357.71ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 110.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 352.9MB. Max. memory is 16.1GB. [2025-03-14 00:45:19,625 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:19,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.32ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 81.0MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:45:19,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.14ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:19,626 INFO L158 Benchmark]: Boogie Preprocessor took 33.51ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:45:19,626 INFO L158 Benchmark]: IcfgBuilder took 605.70ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 96.3MB in the end (delta: -19.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-14 00:45:19,626 INFO L158 Benchmark]: TraceAbstraction took 51141.81ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 95.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 329.9MB. Max. memory is 16.1GB. [2025-03-14 00:45:19,626 INFO L158 Benchmark]: Witness Printer took 57.83ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:45:19,627 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.32ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 81.0MB in the end (delta: 29.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.14ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 78.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.51ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 605.70ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 96.3MB in the end (delta: -19.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 51141.81ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 95.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 329.9MB. Max. memory is 16.1GB. * Witness Printer took 57.83ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 51.1s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3903 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3897 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6947 IncrementalHoareTripleChecker+Invalid, 7358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 2 mSDtfsCounter, 6947 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 555 SyntacticMatches, 2 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=8, InterpolantAutomatonStates: 212, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 975 ConstructedInterpolants, 11 QuantifiedInterpolants, 64178 SizeOfPredicates, 116 NumberOfNonLiveVariables, 2059 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 237/1093 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:45:19,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE