./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack_longer-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_longer-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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:01:22,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:01:22,812 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:22,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:01:22,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:01:22,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:01:22,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:01:22,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:01:22,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:01:22,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:01:22,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:01:22,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:01:22,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:01:22,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:01:22,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:01:22,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:01:22,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:01:22,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:22,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:01:22,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:01:22,839 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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2025-03-04 02:01:23,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:01:23,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:01:23,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:01:23,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:01:23,070 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:01:23,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-2.i [2025-03-04 02:01:24,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1758fe3f/530b48e925804a8b8b4da6c0cf787554/FLAGf93144463 [2025-03-04 02:01:24,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:01:24,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-2.i [2025-03-04 02:01:24,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1758fe3f/530b48e925804a8b8b4da6c0cf787554/FLAGf93144463 [2025-03-04 02:01:24,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1758fe3f/530b48e925804a8b8b4da6c0cf787554 [2025-03-04 02:01:24,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:01:24,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:01:24,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:24,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:01:24,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:01:24,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:24" (1/1) ... [2025-03-04 02:01:24,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:24, skipping insertion in model container [2025-03-04 02:01:24,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:01:24" (1/1) ... [2025-03-04 02:01:24,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:01:24,959 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_longer-2.i[41529,41542] [2025-03-04 02:01:24,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:25,009 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:01:25,048 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_longer-2.i[41529,41542] [2025-03-04 02:01:25,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:01:25,140 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:01:25,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:25 WrapperNode [2025-03-04 02:01:25,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:01:25,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:25,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:01:25,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:01:25,146 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:25" (1/1) ... [2025-03-04 02:01:25,161 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:25" (1/1) ... [2025-03-04 02:01:25,204 INFO L138 Inliner]: procedures = 277, calls = 430, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 539 [2025-03-04 02:01:25,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:01:25,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:01:25,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:01:25,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:01:25,217 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:25" (1/1) ... [2025-03-04 02:01:25,217 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:25" (1/1) ... [2025-03-04 02:01:25,222 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:25" (1/1) ... [2025-03-04 02:01:25,236 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 02:01:25,237 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:25" (1/1) ... [2025-03-04 02:01:25,237 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:25" (1/1) ... [2025-03-04 02:01:25,249 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:25" (1/1) ... [2025-03-04 02:01:25,251 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:25" (1/1) ... [2025-03-04 02:01:25,252 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:25" (1/1) ... [2025-03-04 02:01:25,253 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:25" (1/1) ... [2025-03-04 02:01:25,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:01:25,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:01:25,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:01:25,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:01:25,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:25" (1/1) ... [2025-03-04 02:01:25,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:01:25,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:25,289 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:25,293 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:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 02:01:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 02:01:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 02:01:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:01:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:01:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:01:25,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:01:25,313 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:25,415 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:01:25,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:01:26,120 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-04 02:01:26,120 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-03-04 02:01:26,120 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-03-04 02:01:26,121 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:01:26,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:01:29,370 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:01:29,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:01:29,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:29 BoogieIcfgContainer [2025-03-04 02:01:29,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:01:29,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:01:29,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:01:29,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:01:29,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:01:24" (1/3) ... [2025-03-04 02:01:29,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccdc5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:29, skipping insertion in model container [2025-03-04 02:01:29,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:01:25" (2/3) ... [2025-03-04 02:01:29,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccdc5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:01:29, skipping insertion in model container [2025-03-04 02:01:29,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:01:29" (3/3) ... [2025-03-04 02:01:29,381 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-03-04 02:01:29,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:01:29,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 30 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 02:01:29,395 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:01:29,448 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:01:29,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 82 flow [2025-03-04 02:01:29,502 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-04 02:01:29,503 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:01:29,505 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:29,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 82 flow [2025-03-04 02:01:29,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 69 flow [2025-03-04 02:01:29,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:01:29,521 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;@2115a9a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:01:29,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:01:29,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:01:29,542 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-04 02:01:29,542 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:01:29,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:29,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:29,543 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:29,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -591730256, now seen corresponding path program 1 times [2025-03-04 02:01:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:29,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275028933] [2025-03-04 02:01:29,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:29,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:01:29,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:01:29,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:29,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:30,228 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:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275028933] [2025-03-04 02:01:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275028933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474923329] [2025-03-04 02:01:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:01:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:30,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:01:30,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:01:30,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 02:01:30,263 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:30,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 02:01:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:30,477 INFO L124 PetriNetUnfolderBase]: 307/564 cut-off events. [2025-03-04 02:01:30,478 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 02:01:30,480 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:30,487 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 41 selfloop transitions, 3 changer transitions 2/52 dead transitions. [2025-03-04 02:01:30,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 214 flow [2025-03-04 02:01:30,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:01:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:01:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 02:01:30,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2025-03-04 02:01:30,500 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:30,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 214 flow [2025-03-04 02:01:30,504 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:30,505 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 82 flow [2025-03-04 02:01:30,507 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:30,512 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2025-03-04 02:01:30,513 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 82 flow [2025-03-04 02:01:30,514 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:30,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:30,514 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:01:30,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:01:30,514 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:30,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2097533675, now seen corresponding path program 1 times [2025-03-04 02:01:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:30,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349410162] [2025-03-04 02:01:30,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:30,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:01:30,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:01:30,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:30,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:30,951 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:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349410162] [2025-03-04 02:01:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349410162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:30,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550928743] [2025-03-04 02:01:30,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:30,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:30,955 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:30,957 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:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:01:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:01:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:31,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:01:31,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:31,237 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:31,313 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:31,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:31,384 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:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550928743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:31,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:31,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 02:01:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624905693] [2025-03-04 02:01:31,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:31,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:01:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:31,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:01:31,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:01:31,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:31,390 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:31,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:31,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:31,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:32,001 INFO L124 PetriNetUnfolderBase]: 1257/2332 cut-off events. [2025-03-04 02:01:32,001 INFO L125 PetriNetUnfolderBase]: For 297/299 co-relation queries the response was YES. [2025-03-04 02:01:32,006 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:32,014 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 163 selfloop transitions, 32 changer transitions 4/204 dead transitions. [2025-03-04 02:01:32,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 204 transitions, 900 flow [2025-03-04 02:01:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:01:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:01:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 313 transitions. [2025-03-04 02:01:32,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6137254901960785 [2025-03-04 02:01:32,022 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:32,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 204 transitions, 900 flow [2025-03-04 02:01:32,025 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:32,027 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 329 flow [2025-03-04 02:01:32,027 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:32,029 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2025-03-04 02:01:32,029 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 329 flow [2025-03-04 02:01:32,029 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:32,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:32,029 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:32,037 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:32,231 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:32,231 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:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -728456380, now seen corresponding path program 1 times [2025-03-04 02:01:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030653147] [2025-03-04 02:01:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:32,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:01:32,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:01:32,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:32,455 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:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030653147] [2025-03-04 02:01:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030653147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:01:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419024399] [2025-03-04 02:01:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:32,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:01:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:32,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:01:32,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:01:32,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 02:01:32,456 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:32,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:32,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 02:01:32,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:32,635 INFO L124 PetriNetUnfolderBase]: 669/1351 cut-off events. [2025-03-04 02:01:32,635 INFO L125 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2025-03-04 02:01:32,639 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:32,643 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 43 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-04 02:01:32,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 339 flow [2025-03-04 02:01:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:01:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:01:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 02:01:32,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-03-04 02:01:32,644 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:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 339 flow [2025-03-04 02:01:32,651 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:32,651 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 198 flow [2025-03-04 02:01:32,652 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:32,652 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2025-03-04 02:01:32,652 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 198 flow [2025-03-04 02:01:32,652 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:32,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:32,652 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:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:01:32,653 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:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1583035145, now seen corresponding path program 1 times [2025-03-04 02:01:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820819599] [2025-03-04 02:01:32,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:32,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:01:32,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:01:32,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:33,573 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:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:33,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820819599] [2025-03-04 02:01:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820819599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:01:33,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:01:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:01:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446957642] [2025-03-04 02:01:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:33,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:33,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:33,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:33,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:01:33,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:33,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:33,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:33,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:33,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:33,784 INFO L124 PetriNetUnfolderBase]: 813/1606 cut-off events. [2025-03-04 02:01:33,785 INFO L125 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2025-03-04 02:01:33,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 1606 events. 813/1606 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8144 event pairs, 244 based on Foata normal form. 0/1550 useless extension candidates. Maximal degree in co-relation 3360. Up to 823 conditions per place. [2025-03-04 02:01:33,794 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 60 selfloop transitions, 13 changer transitions 6/84 dead transitions. [2025-03-04 02:01:33,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 463 flow [2025-03-04 02:01:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:01:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:01:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-03-04 02:01:33,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2025-03-04 02:01:33,797 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 198 flow. Second operand 5 states and 94 transitions. [2025-03-04 02:01:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 463 flow [2025-03-04 02:01:33,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:33,801 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 284 flow [2025-03-04 02:01:33,801 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 02:01:33,801 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2025-03-04 02:01:33,801 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 284 flow [2025-03-04 02:01:33,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:33,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:33,801 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:33,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:01:33,802 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:33,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash -983121724, now seen corresponding path program 1 times [2025-03-04 02:01:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636621357] [2025-03-04 02:01:33,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:33,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:01:33,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:01:33,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:33,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:34,551 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:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636621357] [2025-03-04 02:01:34,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636621357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583641371] [2025-03-04 02:01:34,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:34,555 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:34,557 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:34,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:01:34,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:01:34,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:34,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:34,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:01:34,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:34,769 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:34,848 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:34,917 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:34,966 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:34,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:35,255 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:35,311 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:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583641371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:35,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2025-03-04 02:01:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576332901] [2025-03-04 02:01:35,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:01:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:35,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:01:35,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:01:35,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:35,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 284 flow. Second operand has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 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:35,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:35,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:35,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:36,802 INFO L124 PetriNetUnfolderBase]: 2369/4633 cut-off events. [2025-03-04 02:01:36,803 INFO L125 PetriNetUnfolderBase]: For 3326/3326 co-relation queries the response was YES. [2025-03-04 02:01:36,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10864 conditions, 4633 events. 2369/4633 cut-off events. For 3326/3326 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 28595 event pairs, 281 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 9872. Up to 755 conditions per place. [2025-03-04 02:01:36,825 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 304 selfloop transitions, 77 changer transitions 40/426 dead transitions. [2025-03-04 02:01:36,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 426 transitions, 2360 flow [2025-03-04 02:01:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 02:01:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 02:01:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 670 transitions. [2025-03-04 02:01:36,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5325914149443561 [2025-03-04 02:01:36,828 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 284 flow. Second operand 37 states and 670 transitions. [2025-03-04 02:01:36,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 426 transitions, 2360 flow [2025-03-04 02:01:36,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 426 transitions, 2352 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:36,841 INFO L231 Difference]: Finished difference. Result has 99 places, 113 transitions, 860 flow [2025-03-04 02:01:36,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=860, PETRI_PLACES=99, PETRI_TRANSITIONS=113} [2025-03-04 02:01:36,842 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2025-03-04 02:01:36,842 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 113 transitions, 860 flow [2025-03-04 02:01:36,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.375) internal successors, (166), 16 states have internal predecessors, (166), 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:36,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:36,843 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:36,851 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:37,043 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:37,044 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:37,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1068749091, now seen corresponding path program 1 times [2025-03-04 02:01:37,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:37,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541965226] [2025-03-04 02:01:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:01:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:01:37,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541965226] [2025-03-04 02:01:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541965226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611004790] [2025-03-04 02:01:37,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:37,339 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:37,341 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:37,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:01:37,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:01:37,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:37,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:01:37,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:37,525 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:37,564 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:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:37,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:01:37,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611004790] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:37,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:01:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 12 [2025-03-04 02:01:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954799897] [2025-03-04 02:01:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:01:37,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:01:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:37,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:01:37,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:01:37,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:37,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 113 transitions, 860 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:37,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:37,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:37,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:38,132 INFO L124 PetriNetUnfolderBase]: 2537/5008 cut-off events. [2025-03-04 02:01:38,133 INFO L125 PetriNetUnfolderBase]: For 6360/6360 co-relation queries the response was YES. [2025-03-04 02:01:38,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12376 conditions, 5008 events. 2537/5008 cut-off events. For 6360/6360 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32228 event pairs, 642 based on Foata normal form. 24/5025 useless extension candidates. Maximal degree in co-relation 11766. Up to 1644 conditions per place. [2025-03-04 02:01:38,159 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 83 selfloop transitions, 68 changer transitions 2/158 dead transitions. [2025-03-04 02:01:38,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 158 transitions, 1329 flow [2025-03-04 02:01:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:01:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:01:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-04 02:01:38,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2025-03-04 02:01:38,161 INFO L175 Difference]: Start difference. First operand has 99 places, 113 transitions, 860 flow. Second operand 6 states and 112 transitions. [2025-03-04 02:01:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 158 transitions, 1329 flow [2025-03-04 02:01:38,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 158 transitions, 1272 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-03-04 02:01:38,179 INFO L231 Difference]: Finished difference. Result has 105 places, 121 transitions, 1062 flow [2025-03-04 02:01:38,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1062, PETRI_PLACES=105, PETRI_TRANSITIONS=121} [2025-03-04 02:01:38,180 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2025-03-04 02:01:38,180 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 121 transitions, 1062 flow [2025-03-04 02:01:38,180 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:38,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:38,180 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:38,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:01:38,380 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:38,381 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:38,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2128265606, now seen corresponding path program 1 times [2025-03-04 02:01:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:38,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508474872] [2025-03-04 02:01:38,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:38,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:01:38,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:01:38,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:38,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:39,477 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:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508474872] [2025-03-04 02:01:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508474872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772445980] [2025-03-04 02:01:39,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:01:39,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:39,481 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:39,481 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:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:01:39,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:01:39,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:01:39,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:39,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:01:39,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:39,699 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:39,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2025-03-04 02:01:39,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 94 [2025-03-04 02:01:39,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 43 [2025-03-04 02:01:40,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:40,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 57 [2025-03-04 02:01:40,240 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:40,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:40,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:40,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 02:01:40,838 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-04 02:01:40,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2025-03-04 02:01:40,906 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:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772445980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:40,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 02:01:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981211924] [2025-03-04 02:01:40,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:01:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:40,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:01:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:01:40,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:40,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 121 transitions, 1062 flow. Second operand has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 states have internal predecessors, (195), 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:40,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:40,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:40,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:44,020 INFO L124 PetriNetUnfolderBase]: 6025/11841 cut-off events. [2025-03-04 02:01:44,021 INFO L125 PetriNetUnfolderBase]: For 23030/23030 co-relation queries the response was YES. [2025-03-04 02:01:44,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30662 conditions, 11841 events. 6025/11841 cut-off events. For 23030/23030 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 85524 event pairs, 985 based on Foata normal form. 112/11946 useless extension candidates. Maximal degree in co-relation 29506. Up to 1967 conditions per place. [2025-03-04 02:01:44,094 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 302 selfloop transitions, 194 changer transitions 54/555 dead transitions. [2025-03-04 02:01:44,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 555 transitions, 4473 flow [2025-03-04 02:01:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:01:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:01:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 617 transitions. [2025-03-04 02:01:44,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5337370242214533 [2025-03-04 02:01:44,097 INFO L175 Difference]: Start difference. First operand has 105 places, 121 transitions, 1062 flow. Second operand 34 states and 617 transitions. [2025-03-04 02:01:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 555 transitions, 4473 flow [2025-03-04 02:01:44,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 555 transitions, 4342 flow, removed 40 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:44,162 INFO L231 Difference]: Finished difference. Result has 148 places, 245 transitions, 2828 flow [2025-03-04 02:01:44,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2828, PETRI_PLACES=148, PETRI_TRANSITIONS=245} [2025-03-04 02:01:44,162 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2025-03-04 02:01:44,162 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 245 transitions, 2828 flow [2025-03-04 02:01:44,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 states have internal predecessors, (195), 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:44,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:44,163 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 02:01:44,171 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:44,363 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:44,363 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:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 272416028, now seen corresponding path program 2 times [2025-03-04 02:01:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026938661] [2025-03-04 02:01:44,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:44,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:01:44,403 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:44,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:44,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,800 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:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026938661] [2025-03-04 02:01:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026938661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661948265] [2025-03-04 02:01:44,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:44,803 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:44,804 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:44,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 02:01:44,963 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:44,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:44,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:01:44,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:44,983 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:45,014 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:45,053 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:45,078 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:45,129 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:45,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:45,218 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:45,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661948265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:45,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:45,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-03-04 02:01:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244079240] [2025-03-04 02:01:45,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:01:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:45,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:01:45,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:01:45,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:45,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 245 transitions, 2828 flow. Second operand has 23 states, 23 states have (on average 10.26086956521739) internal successors, (236), 23 states have internal predecessors, (236), 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,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:45,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:45,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:01:48,223 INFO L124 PetriNetUnfolderBase]: 13008/25438 cut-off events. [2025-03-04 02:01:48,223 INFO L125 PetriNetUnfolderBase]: For 79911/79911 co-relation queries the response was YES. [2025-03-04 02:01:48,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72875 conditions, 25438 events. 13008/25438 cut-off events. For 79911/79911 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 197098 event pairs, 2350 based on Foata normal form. 290/25721 useless extension candidates. Maximal degree in co-relation 70923. Up to 4209 conditions per place. [2025-03-04 02:01:48,491 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 562 selfloop transitions, 465 changer transitions 20/1052 dead transitions. [2025-03-04 02:01:48,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1052 transitions, 10487 flow [2025-03-04 02:01:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 02:01:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-03-04 02:01:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 1043 transitions. [2025-03-04 02:01:48,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289046653144016 [2025-03-04 02:01:48,495 INFO L175 Difference]: Start difference. First operand has 148 places, 245 transitions, 2828 flow. Second operand 58 states and 1043 transitions. [2025-03-04 02:01:48,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1052 transitions, 10487 flow [2025-03-04 02:01:48,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1052 transitions, 10267 flow, removed 107 selfloop flow, removed 2 redundant places. [2025-03-04 02:01:48,914 INFO L231 Difference]: Finished difference. Result has 219 places, 547 transitions, 7588 flow [2025-03-04 02:01:48,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2784, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=7588, PETRI_PLACES=219, PETRI_TRANSITIONS=547} [2025-03-04 02:01:48,915 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2025-03-04 02:01:48,915 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 547 transitions, 7588 flow [2025-03-04 02:01:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.26086956521739) internal successors, (236), 23 states have internal predecessors, (236), 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,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:01:48,916 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:01:48,924 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:01:49,116 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:01:49,116 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:01:49,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:01:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2116565717, now seen corresponding path program 2 times [2025-03-04 02:01:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:01:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-03-04 02:01:49,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:01:49,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 02:01:49,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:01:49,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:01:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-03-04 02:01:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561244670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:01:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816161367] [2025-03-04 02:01:50,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:01:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:01:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:01:50,131 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:01:50,132 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:01:50,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 02:01:50,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:01:50,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:01:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:01:50,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:01:50,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:01:50,398 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:01:50,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-04 02:01:50,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2025-03-04 02:01:50,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 02:01:50,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 95 [2025-03-04 02:01:50,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:50,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2025-03-04 02:01:50,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:50,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 69 [2025-03-04 02:01:51,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:01:51,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 107 [2025-03-04 02:01:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:51,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:01:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:01:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816161367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:01:52,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:01:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-03-04 02:01:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109436927] [2025-03-04 02:01:52,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:01:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:01:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:01:52,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:01:52,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:01:52,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:01:52,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 547 transitions, 7588 flow. Second operand has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 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:52,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:01:52,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:01:52,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:02,886 INFO L124 PetriNetUnfolderBase]: 29358/56802 cut-off events. [2025-03-04 02:02:02,886 INFO L125 PetriNetUnfolderBase]: For 275778/275778 co-relation queries the response was YES. [2025-03-04 02:02:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175712 conditions, 56802 events. 29358/56802 cut-off events. For 275778/275778 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 467372 event pairs, 5689 based on Foata normal form. 483/57278 useless extension candidates. Maximal degree in co-relation 173556. Up to 9516 conditions per place. [2025-03-04 02:02:03,642 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 675 selfloop transitions, 935 changer transitions 28/1643 dead transitions. [2025-03-04 02:02:03,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1643 transitions, 22769 flow [2025-03-04 02:02:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 02:02:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 02:02:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 676 transitions. [2025-03-04 02:02:03,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-03-04 02:02:03,644 INFO L175 Difference]: Start difference. First operand has 219 places, 547 transitions, 7588 flow. Second operand 39 states and 676 transitions. [2025-03-04 02:02:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 1643 transitions, 22769 flow [2025-03-04 02:02:06,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1643 transitions, 21046 flow, removed 784 selfloop flow, removed 4 redundant places. [2025-03-04 02:02:06,899 INFO L231 Difference]: Finished difference. Result has 279 places, 1220 transitions, 19679 flow [2025-03-04 02:02:06,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6025, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=19679, PETRI_PLACES=279, PETRI_TRANSITIONS=1220} [2025-03-04 02:02:06,900 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 247 predicate places. [2025-03-04 02:02:06,901 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 1220 transitions, 19679 flow [2025-03-04 02:02:06,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 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:06,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:06,901 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:06,910 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:07,105 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:07,105 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:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 402698092, now seen corresponding path program 1 times [2025-03-04 02:02:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018163798] [2025-03-04 02:02:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:02:07,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:02:07,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:07,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:02:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018163798] [2025-03-04 02:02:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018163798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:02:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462786767] [2025-03-04 02:02:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:02:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:07,768 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:07,769 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:07,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:02:07,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:02:07,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:07,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:07,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:02:07,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:02:07,972 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:07,998 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:08,024 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:08,056 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:08,089 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:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:08,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:02:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:02:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462786767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:02:08,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:02:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 20 [2025-03-04 02:02:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625704983] [2025-03-04 02:02:08,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:02:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:02:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:08,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:02:08,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:02:08,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 02:02:08,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1220 transitions, 19679 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:08,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:08,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 02:02:08,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:32,167 INFO L124 PetriNetUnfolderBase]: 49131/95336 cut-off events. [2025-03-04 02:02:32,167 INFO L125 PetriNetUnfolderBase]: For 782508/782508 co-relation queries the response was YES. [2025-03-04 02:02:33,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323461 conditions, 95336 events. 49131/95336 cut-off events. For 782508/782508 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 850605 event pairs, 5371 based on Foata normal form. 348/95659 useless extension candidates. Maximal degree in co-relation 321279. Up to 15921 conditions per place. [2025-03-04 02:02:34,180 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 771 selfloop transitions, 1910 changer transitions 30/2716 dead transitions. [2025-03-04 02:02:34,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 2716 transitions, 41432 flow [2025-03-04 02:02:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 02:02:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-03-04 02:02:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 1142 transitions. [2025-03-04 02:02:34,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5167420814479639 [2025-03-04 02:02:34,182 INFO L175 Difference]: Start difference. First operand has 279 places, 1220 transitions, 19679 flow. Second operand 65 states and 1142 transitions. [2025-03-04 02:02:34,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 2716 transitions, 41432 flow [2025-03-04 02:02:49,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 2716 transitions, 40458 flow, removed 196 selfloop flow, removed 6 redundant places. [2025-03-04 02:02:49,628 INFO L231 Difference]: Finished difference. Result has 351 places, 2110 transitions, 37106 flow [2025-03-04 02:02:49,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=19191, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=37106, PETRI_PLACES=351, PETRI_TRANSITIONS=2110} [2025-03-04 02:02:49,630 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 319 predicate places. [2025-03-04 02:02:49,630 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 2110 transitions, 37106 flow [2025-03-04 02:02:49,630 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:49,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:49,630 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:49,638 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:49,830 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:49,831 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:49,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -544315964, now seen corresponding path program 3 times [2025-03-04 02:02:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470154676] [2025-03-04 02:02:49,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:02:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:49,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 4 equivalence classes. [2025-03-04 02:02:49,976 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:49,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 02:02:49,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat