./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_longest-2.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 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:01:25,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:01:26,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:01:26,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:01:26,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:01:26,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:01:26,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:01:26,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:01:26,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:01:26,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:01:26,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:01:26,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:01:26,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:01:26,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:01:26,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:01:26,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:01:26,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:01:26,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:01:26,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:01:26,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:01:26,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:01:26,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:01:26,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:01:26,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:01:26,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:01:26,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:01:26,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:26,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:01:26,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:01:26,070 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 -> 5773bc320dd9dee5d943610df8c4ec3040864edddf388dd42a51d37167245e47 [2025-03-04 02:01:26,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:01:26,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:01:26,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:01:26,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:01:26,317 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:01:26,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-04 02:01:27,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113d45ba/ed28a4d7177e4772a1aebe57f22398b4/FLAGe6f27bc89 [2025-03-04 02:01:27,931 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:01:27,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-2.i [2025-03-04 02:01:27,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113d45ba/ed28a4d7177e4772a1aebe57f22398b4/FLAGe6f27bc89 [2025-03-04 02:01:28,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113d45ba/ed28a4d7177e4772a1aebe57f22398b4 [2025-03-04 02:01:28,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:01:28,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:01:28,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:28,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:01:28,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:01:28,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d64f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28, skipping insertion in model container [2025-03-04 02:01:28,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:01:28,497 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_longest-2.i[41530,41543] [2025-03-04 02:01:28,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:28,547 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:01:28,587 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_longest-2.i[41530,41543] [2025-03-04 02:01:28,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:28,688 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:01:28,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28 WrapperNode [2025-03-04 02:01:28,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:28,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:28,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:01:28,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:01:28,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,802 INFO L138 Inliner]: procedures = 277, calls = 830, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 939 [2025-03-04 02:01:28,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:28,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:01:28,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:01:28,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:01:28,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,856 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 02:01:28,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:01:28,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:01:28,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:01:28,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:01:28,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (1/1) ... [2025-03-04 02:01:28,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:28,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:28,929 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-04 02:01:28,936 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-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:01:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:01:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:01:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:01:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:01:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:01:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:01:28,954 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:01:29,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:01:29,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:01:30,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-04 02:01:30,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-03-04 02:01:30,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-03-04 02:01:30,041 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:01:30,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:01:39,993 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:01:39,994 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:01:39,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:39 BoogieIcfgContainer [2025-03-04 02:01:39,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:01:39,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:01:39,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:01:39,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:01:39,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:01:28" (1/3) ... [2025-03-04 02:01:40,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692a1c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:39, skipping insertion in model container [2025-03-04 02:01:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:28" (2/3) ... [2025-03-04 02:01:40,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692a1c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:40, skipping insertion in model container [2025-03-04 02:01:40,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:39" (3/3) ... [2025-03-04 02:01:40,003 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-03-04 02:01:40,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:01:40,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 30 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 02:01:40,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:01:40,100 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:01:40,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 82 flow [2025-03-04 02:01:40,183 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-04 02:01:40,187 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:01:40,194 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 5. Compared 64 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-04 02:01:40,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 82 flow [2025-03-04 02:01:40,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 69 flow [2025-03-04 02:01:40,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:01:40,226 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;@78eeb8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:01:40,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:01:40,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:01:40,260 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-04 02:01:40,260 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:01:40,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:40,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:40,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1317435824, now seen corresponding path program 1 times [2025-03-04 02:01:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:40,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207475393] [2025-03-04 02:01:40,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:40,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:01:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:01:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:41,013 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-04 02:01:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207475393] [2025-03-04 02:01:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207475393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:41,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345830542] [2025-03-04 02:01:41,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:01:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:41,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:01:41,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:01:41,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 02:01:41,051 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-04 02:01:41,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:41,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 02:01:41,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:41,255 INFO L124 PetriNetUnfolderBase]: 307/564 cut-off events. [2025-03-04 02:01:41,256 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 02:01:41,257 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 2467 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-04 02:01:41,264 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 41 selfloop transitions, 3 changer transitions 2/52 dead transitions. [2025-03-04 02:01:41,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 214 flow [2025-03-04 02:01:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:01:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:01:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 02:01:41,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2025-03-04 02:01:41,277 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 69 flow. Second operand 4 states and 83 transitions. [2025-03-04 02:01:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 214 flow [2025-03-04 02:01:41,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:01:41,286 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 82 flow [2025-03-04 02:01:41,288 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-04 02:01:41,293 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-03-04 02:01:41,293 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 82 flow [2025-03-04 02:01:41,293 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-04 02:01:41,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:41,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:01:41,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 780898027, now seen corresponding path program 1 times [2025-03-04 02:01:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22493093] [2025-03-04 02:01:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:41,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:01:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:01:41,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:41,839 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-04 02:01:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22493093] [2025-03-04 02:01:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22493093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689950411] [2025-03-04 02:01:41,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:41,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:41,842 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-04 02:01:41,844 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-04 02:01:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:01:42,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:01:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:42,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:42,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:01:42,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:42,194 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-04 02:01:42,266 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-04 02:01:42,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:42,332 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-04 02:01:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689950411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:42,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 02:01:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394931977] [2025-03-04 02:01:42,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:01:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:42,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:01:42,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:01:42,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:42,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 82 flow. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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-04 02:01:42,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:42,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:42,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:43,187 INFO L124 PetriNetUnfolderBase]: 1257/2332 cut-off events. [2025-03-04 02:01:43,188 INFO L125 PetriNetUnfolderBase]: For 297/299 co-relation queries the response was YES. [2025-03-04 02:01:43,197 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 76. Compared 12417 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-04 02:01:43,208 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 163 selfloop transitions, 32 changer transitions 4/204 dead transitions. [2025-03-04 02:01:43,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 204 transitions, 900 flow [2025-03-04 02:01:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:01:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:01:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 313 transitions. [2025-03-04 02:01:43,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6137254901960785 [2025-03-04 02:01:43,214 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 82 flow. Second operand 15 states and 313 transitions. [2025-03-04 02:01:43,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 204 transitions, 900 flow [2025-03-04 02:01:43,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 204 transitions, 896 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:43,219 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 329 flow [2025-03-04 02:01:43,220 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-04 02:01:43,220 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2025-03-04 02:01:43,220 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 329 flow [2025-03-04 02:01:43,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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-04 02:01:43,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:43,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:43,230 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-04 02:01:43,421 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-04 02:01:43,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1405512292, now seen corresponding path program 1 times [2025-03-04 02:01:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257519183] [2025-03-04 02:01:43,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:43,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:43,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:43,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:43,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:43,730 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-04 02:01:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257519183] [2025-03-04 02:01:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257519183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132194078] [2025-03-04 02:01:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:43,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:43,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:43,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 02:01:43,732 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-04 02:01:43,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:43,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 02:01:43,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:43,929 INFO L124 PetriNetUnfolderBase]: 669/1351 cut-off events. [2025-03-04 02:01:43,929 INFO L125 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2025-03-04 02:01:43,934 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 6852 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-04 02:01:43,938 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 43 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 02:01:43,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 339 flow [2025-03-04 02:01:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 02:01:43,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-03-04 02:01:43,941 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 329 flow. Second operand 3 states and 58 transitions. [2025-03-04 02:01:43,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 339 flow [2025-03-04 02:01:43,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 307 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-04 02:01:43,952 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 198 flow [2025-03-04 02:01:43,952 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-04 02:01:43,953 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2025-03-04 02:01:43,953 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 198 flow [2025-03-04 02:01:43,954 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-04 02:01:43,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:43,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:01:43,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 461484055, now seen corresponding path program 1 times [2025-03-04 02:01:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778886926] [2025-03-04 02:01:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:43,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:01:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:01:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:45,255 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-04 02:01:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778886926] [2025-03-04 02:01:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778886926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:01:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876654192] [2025-03-04 02:01:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:01:45,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 02:01:45,259 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-04 02:01:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 02:01:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:45,492 INFO L124 PetriNetUnfolderBase]: 840/1690 cut-off events. [2025-03-04 02:01:45,492 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2025-03-04 02:01:45,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1690 events. 840/1690 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8849 event pairs, 260 based on Foata normal form. 0/1665 useless extension candidates. Maximal degree in co-relation 3491. Up to 971 conditions per place. [2025-03-04 02:01:45,501 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 61 selfloop transitions, 7 changer transitions 4/84 dead transitions. [2025-03-04 02:01:45,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 451 flow [2025-03-04 02:01:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:01:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:01:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-04 02:01:45,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5705882352941176 [2025-03-04 02:01:45,502 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 198 flow. Second operand 5 states and 97 transitions. [2025-03-04 02:01:45,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 451 flow [2025-03-04 02:01:45,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:45,507 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 254 flow [2025-03-04 02:01:45,507 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=254, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-03-04 02:01:45,507 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2025-03-04 02:01:45,507 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 254 flow [2025-03-04 02:01:45,508 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-04 02:01:45,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:45,508 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-04 02:01:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:01:45,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:45,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1338312732, now seen corresponding path program 1 times [2025-03-04 02:01:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052842708] [2025-03-04 02:01:45,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:45,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:01:45,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:01:45,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:45,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:46,374 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-04 02:01:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052842708] [2025-03-04 02:01:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052842708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044085220] [2025-03-04 02:01:46,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:46,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:46,377 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-04 02:01:46,378 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-04 02:01:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:01:46,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:01:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:46,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:01:46,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:46,696 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-04 02:01:46,758 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-04 02:01:46,837 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-04 02:01:46,892 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-04 02:01:46,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:47,207 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-04 02:01:47,253 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-04 02:01:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044085220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:47,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 02:01:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108495451] [2025-03-04 02:01:47,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:47,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:01:47,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:47,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:01:47,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:01:47,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:47,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 254 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-04 02:01:47,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:47,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:47,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:48,800 INFO L124 PetriNetUnfolderBase]: 2548/5013 cut-off events. [2025-03-04 02:01:48,800 INFO L125 PetriNetUnfolderBase]: For 2221/2221 co-relation queries the response was YES. [2025-03-04 02:01:48,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11325 conditions, 5013 events. 2548/5013 cut-off events. For 2221/2221 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 30583 event pairs, 382 based on Foata normal form. 0/4908 useless extension candidates. Maximal degree in co-relation 10240. Up to 821 conditions per place. [2025-03-04 02:01:48,839 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 287 selfloop transitions, 79 changer transitions 38/409 dead transitions. [2025-03-04 02:01:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 409 transitions, 2192 flow [2025-03-04 02:01:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:01:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:01:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 621 transitions. [2025-03-04 02:01:48,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53719723183391 [2025-03-04 02:01:48,842 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 254 flow. Second operand 34 states and 621 transitions. [2025-03-04 02:01:48,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 409 transitions, 2192 flow [2025-03-04 02:01:48,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 409 transitions, 2183 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:48,860 INFO L231 Difference]: Finished difference. Result has 96 places, 116 transitions, 752 flow [2025-03-04 02:01:48,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=752, PETRI_PLACES=96, PETRI_TRANSITIONS=116} [2025-03-04 02:01:48,863 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2025-03-04 02:01:48,863 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 752 flow [2025-03-04 02:01:48,863 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-04 02:01:48,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:48,864 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-04 02:01:48,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:49,064 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-04 02:01:49,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1470961805, now seen corresponding path program 1 times [2025-03-04 02:01:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277014799] [2025-03-04 02:01:49,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:49,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:01:49,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:01:49,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:49,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,554 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-04 02:01:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277014799] [2025-03-04 02:01:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277014799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162884926] [2025-03-04 02:01:49,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:49,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:49,557 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-04 02:01:49,558 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-04 02:01:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:01:49,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:01:49,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:49,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:49,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1791 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:01:49,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:49,851 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-04 02:01:49,893 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-04 02:01:50,045 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-04 02:01:50,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162884926] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:01:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 12 [2025-03-04 02:01:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154332240] [2025-03-04 02:01:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:50,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:50,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:50,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:01:50,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:50,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 752 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-04 02:01:50,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:50,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:50,789 INFO L124 PetriNetUnfolderBase]: 2955/5869 cut-off events. [2025-03-04 02:01:50,789 INFO L125 PetriNetUnfolderBase]: For 5390/5390 co-relation queries the response was YES. [2025-03-04 02:01:50,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13983 conditions, 5869 events. 2955/5869 cut-off events. For 5390/5390 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 37488 event pairs, 840 based on Foata normal form. 24/5851 useless extension candidates. Maximal degree in co-relation 13582. Up to 1930 conditions per place. [2025-03-04 02:01:50,830 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 87 selfloop transitions, 73 changer transitions 2/167 dead transitions. [2025-03-04 02:01:50,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 167 transitions, 1285 flow [2025-03-04 02:01:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:01:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:01:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-04 02:01:50,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2025-03-04 02:01:50,832 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 752 flow. Second operand 6 states and 112 transitions. [2025-03-04 02:01:50,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 167 transitions, 1285 flow [2025-03-04 02:01:50,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 167 transitions, 1231 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-04 02:01:50,854 INFO L231 Difference]: Finished difference. Result has 103 places, 130 transitions, 1013 flow [2025-03-04 02:01:50,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1013, PETRI_PLACES=103, PETRI_TRANSITIONS=130} [2025-03-04 02:01:50,856 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2025-03-04 02:01:50,856 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 130 transitions, 1013 flow [2025-03-04 02:01:50,857 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-04 02:01:50,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:50,857 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-04 02:01:50,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:51,057 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-04 02:01:51,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:51,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1363535238, now seen corresponding path program 1 times [2025-03-04 02:01:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:51,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349752060] [2025-03-04 02:01:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:51,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:01:51,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:01:51,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:51,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:52,353 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-04 02:01:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349752060] [2025-03-04 02:01:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349752060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978343124] [2025-03-04 02:01:52,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:52,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:52,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:52,357 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-04 02:01:52,360 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-04 02:01:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:01:52,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:01:52,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:52,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:01:52,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:52,721 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-04 02:01:52,805 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 50 treesize of output 19 [2025-03-04 02:01:52,960 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 56 treesize of output 32 [2025-03-04 02:01:52,996 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-04 02:01:52,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:53,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:53,499 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 18 treesize of output 14 [2025-03-04 02:01:53,526 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-04 02:01:53,526 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 78 treesize of output 65 [2025-03-04 02:01:53,585 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-04 02:01:53,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978343124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:53,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 02:01:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259140089] [2025-03-04 02:01:53,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:53,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:01:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:53,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:01:53,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:01:53,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:53,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 130 transitions, 1013 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-04 02:01:53,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:53,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:53,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:55,724 INFO L124 PetriNetUnfolderBase]: 5209/10323 cut-off events. [2025-03-04 02:01:55,724 INFO L125 PetriNetUnfolderBase]: For 15780/15780 co-relation queries the response was YES. [2025-03-04 02:01:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25821 conditions, 10323 events. 5209/10323 cut-off events. For 15780/15780 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 69478 event pairs, 1211 based on Foata normal form. 105/10386 useless extension candidates. Maximal degree in co-relation 25020. Up to 1715 conditions per place. [2025-03-04 02:01:55,797 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 262 selfloop transitions, 165 changer transitions 46/478 dead transitions. [2025-03-04 02:01:55,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 478 transitions, 3518 flow [2025-03-04 02:01:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:01:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 02:01:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 541 transitions. [2025-03-04 02:01:55,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303921568627451 [2025-03-04 02:01:55,800 INFO L175 Difference]: Start difference. First operand has 103 places, 130 transitions, 1013 flow. Second operand 30 states and 541 transitions. [2025-03-04 02:01:55,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 478 transitions, 3518 flow [2025-03-04 02:01:55,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 478 transitions, 3417 flow, removed 31 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:55,850 INFO L231 Difference]: Finished difference. Result has 138 places, 215 transitions, 2150 flow [2025-03-04 02:01:55,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2150, PETRI_PLACES=138, PETRI_TRANSITIONS=215} [2025-03-04 02:01:55,852 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 106 predicate places. [2025-03-04 02:01:55,852 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 215 transitions, 2150 flow [2025-03-04 02:01:55,852 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-04 02:01:55,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:55,853 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 02:01:55,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:01:56,053 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-04 02:01:56,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:01:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 738917660, now seen corresponding path program 2 times [2025-03-04 02:01:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:56,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101584004] [2025-03-04 02:01:56,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:56,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:01:56,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:01:56,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:56,492 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-04 02:01:56,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101584004] [2025-03-04 02:01:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101584004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849075734] [2025-03-04 02:01:56,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:56,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:56,495 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-04 02:01:56,497 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-04 02:01:56,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:01:56,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 02:01:56,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:56,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1800 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:01:56,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:56,758 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-04 02:01:56,796 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-04 02:01:56,830 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-04 02:01:56,881 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-04 02:01:56,914 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-04 02:01:56,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:57,001 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-04 02:01:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849075734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:57,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2025-03-04 02:01:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915683412] [2025-03-04 02:01:57,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:57,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:01:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:57,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:01:57,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:01:57,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:57,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 215 transitions, 2150 flow. Second operand has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 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-04 02:01:57,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:57,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:57,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:59,851 INFO L124 PetriNetUnfolderBase]: 11634/22754 cut-off events. [2025-03-04 02:01:59,852 INFO L125 PetriNetUnfolderBase]: For 61080/61080 co-relation queries the response was YES. [2025-03-04 02:01:59,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63131 conditions, 22754 events. 11634/22754 cut-off events. For 61080/61080 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 172551 event pairs, 2273 based on Foata normal form. 296/23043 useless extension candidates. Maximal degree in co-relation 61171. Up to 3768 conditions per place. [2025-03-04 02:02:00,062 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 562 selfloop transitions, 414 changer transitions 20/1001 dead transitions. [2025-03-04 02:02:00,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 1001 transitions, 9036 flow [2025-03-04 02:02:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 02:02:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-03-04 02:02:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 1043 transitions. [2025-03-04 02:02:00,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289046653144016 [2025-03-04 02:02:00,069 INFO L175 Difference]: Start difference. First operand has 138 places, 215 transitions, 2150 flow. Second operand 58 states and 1043 transitions. [2025-03-04 02:02:00,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 1001 transitions, 9036 flow [2025-03-04 02:02:00,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1001 transitions, 8764 flow, removed 131 selfloop flow, removed 3 redundant places. [2025-03-04 02:02:00,366 INFO L231 Difference]: Finished difference. Result has 207 places, 499 transitions, 6074 flow [2025-03-04 02:02:00,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=6074, PETRI_PLACES=207, PETRI_TRANSITIONS=499} [2025-03-04 02:02:00,368 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2025-03-04 02:02:00,368 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 499 transitions, 6074 flow [2025-03-04 02:02:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 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-04 02:02:00,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:00,369 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-04 02:02:00,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:02:00,569 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-04 02:02:00,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1323272759, now seen corresponding path program 2 times [2025-03-04 02:02:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211610078] [2025-03-04 02:02:00,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:00,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 02:02:00,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:02:00,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:00,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211610078] [2025-03-04 02:02:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211610078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381135951] [2025-03-04 02:02:02,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:02:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:02,794 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-04 02:02:02,796 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-04 02:02:02,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 02:02:03,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:02:03,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:02:03,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 02:02:03,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:03,147 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-04 02:02:03,206 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 34 treesize of output 14 [2025-03-04 02:02:03,308 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 34 treesize of output 14 [2025-03-04 02:02:03,513 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 56 treesize of output 32 [2025-03-04 02:02:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:03,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381135951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:04,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2025-03-04 02:02:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543200376] [2025-03-04 02:02:04,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:04,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:02:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:04,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:02:04,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:02:04,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:02:04,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 499 transitions, 6074 flow. Second operand has 26 states, 26 states have (on average 10.807692307692308) internal successors, (281), 26 states have internal predecessors, (281), 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-04 02:02:04,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:04,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:02:04,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:09,735 INFO L124 PetriNetUnfolderBase]: 15802/30878 cut-off events. [2025-03-04 02:02:09,736 INFO L125 PetriNetUnfolderBase]: For 140758/140758 co-relation queries the response was YES. [2025-03-04 02:02:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93156 conditions, 30878 events. 15802/30878 cut-off events. For 140758/140758 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 244070 event pairs, 2914 based on Foata normal form. 504/31375 useless extension candidates. Maximal degree in co-relation 90994. Up to 5175 conditions per place. [2025-03-04 02:02:10,082 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 394 selfloop transitions, 563 changer transitions 28/990 dead transitions. [2025-03-04 02:02:10,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 990 transitions, 11842 flow [2025-03-04 02:02:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 02:02:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 02:02:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 600 transitions. [2025-03-04 02:02:10,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2025-03-04 02:02:10,086 INFO L175 Difference]: Start difference. First operand has 207 places, 499 transitions, 6074 flow. Second operand 35 states and 600 transitions. [2025-03-04 02:02:10,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 990 transitions, 11842 flow [2025-03-04 02:02:10,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 990 transitions, 10897 flow, removed 441 selfloop flow, removed 3 redundant places. [2025-03-04 02:02:10,994 INFO L231 Difference]: Finished difference. Result has 246 places, 688 transitions, 9373 flow [2025-03-04 02:02:10,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5052, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9373, PETRI_PLACES=246, PETRI_TRANSITIONS=688} [2025-03-04 02:02:10,995 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2025-03-04 02:02:10,996 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 688 transitions, 9373 flow [2025-03-04 02:02:10,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.807692307692308) internal successors, (281), 26 states have internal predecessors, (281), 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-04 02:02:10,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:10,996 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:11,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:02:11,196 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-04 02:02:11,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1455211480, now seen corresponding path program 1 times [2025-03-04 02:02:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908992389] [2025-03-04 02:02:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:02:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:02:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:02:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908992389] [2025-03-04 02:02:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908992389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385079652] [2025-03-04 02:02:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:12,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:12,009 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-04 02:02:12,011 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-04 02:02:12,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:02:12,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:02:12,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:12,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:02:12,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:12,280 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-04 02:02:12,307 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-04 02:02:12,335 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-04 02:02:12,363 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-04 02:02:12,390 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-04 02:02:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:12,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 34 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:02:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385079652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:12,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 20 [2025-03-04 02:02:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136470420] [2025-03-04 02:02:12,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:12,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:02:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:12,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:02:12,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:02:12,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:02:12,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 688 transitions, 9373 flow. Second operand has 20 states, 20 states have (on average 12.75) internal successors, (255), 20 states have internal predecessors, (255), 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-04 02:02:12,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:12,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:02:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:26,108 INFO L124 PetriNetUnfolderBase]: 36609/71379 cut-off events. [2025-03-04 02:02:26,108 INFO L125 PetriNetUnfolderBase]: For 544010/544010 co-relation queries the response was YES. [2025-03-04 02:02:27,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235658 conditions, 71379 events. 36609/71379 cut-off events. For 544010/544010 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 600619 event pairs, 4677 based on Foata normal form. 708/72068 useless extension candidates. Maximal degree in co-relation 233526. Up to 11925 conditions per place. [2025-03-04 02:02:27,456 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 681 selfloop transitions, 1498 changer transitions 30/2214 dead transitions. [2025-03-04 02:02:27,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 2214 transitions, 29409 flow [2025-03-04 02:02:27,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 02:02:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-04 02:02:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 1142 transitions. [2025-03-04 02:02:27,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5167420814479639 [2025-03-04 02:02:27,459 INFO L175 Difference]: Start difference. First operand has 246 places, 688 transitions, 9373 flow. Second operand 65 states and 1142 transitions. [2025-03-04 02:02:27,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 2214 transitions, 29409 flow [2025-03-04 02:02:36,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2214 transitions, 27079 flow, removed 945 selfloop flow, removed 4 redundant places. [2025-03-04 02:02:36,694 INFO L231 Difference]: Finished difference. Result has 319 places, 1641 transitions, 24185 flow [2025-03-04 02:02:36,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8681, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=24185, PETRI_PLACES=319, PETRI_TRANSITIONS=1641} [2025-03-04 02:02:36,695 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 287 predicate places. [2025-03-04 02:02:36,695 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 1641 transitions, 24185 flow [2025-03-04 02:02:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.75) internal successors, (255), 20 states have internal predecessors, (255), 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-04 02:02:36,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:36,695 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-04 02:02:36,704 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-04 02:02:36,895 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-04 02:02:36,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 02:02:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1951356356, now seen corresponding path program 3 times [2025-03-04 02:02:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969223039] [2025-03-04 02:02:36,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:36,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-04 02:02:37,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:02:37,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:37,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969223039] [2025-03-04 02:02:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969223039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389973473] [2025-03-04 02:02:39,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:39,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:39,314 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-04 02:02:39,315 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-04 02:02:39,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-04 02:02:39,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:02:39,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:39,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 02:02:39,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:39,891 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-04 02:02:39,934 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 34 treesize of output 14 [2025-03-04 02:02:39,977 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 34 treesize of output 14 [2025-03-04 02:02:40,023 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 34 treesize of output 14 [2025-03-04 02:02:40,192 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 56 treesize of output 32 [2025-03-04 02:02:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:40,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389973473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:40,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 02:02:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603721179] [2025-03-04 02:02:40,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 02:02:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:40,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 02:02:40,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 02:02:40,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:02:40,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1641 transitions, 24185 flow. Second operand has 31 states, 31 states have (on average 11.161290322580646) internal successors, (346), 31 states have internal predecessors, (346), 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-04 02:02:40,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:40,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:02:40,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand