./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:40:29,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:40:29,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:40:29,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:40:29,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:40:29,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:40:29,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:40:29,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:40:29,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:40:29,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:40:29,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:40:29,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:40:29,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:40:29,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:40:29,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:40:29,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:40:29,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:29,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:40:29,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-02-06 04:40:29,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:40:29,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:40:29,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:40:29,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:40:29,534 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:40:29,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-02-06 04:40:30,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9bb3a8f5/b94860ae23bd4110ad6b1cd144ba2a53/FLAG674c032c9 [2025-02-06 04:40:30,862 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:40:30,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-02-06 04:40:30,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9bb3a8f5/b94860ae23bd4110ad6b1cd144ba2a53/FLAG674c032c9 [2025-02-06 04:40:31,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9bb3a8f5/b94860ae23bd4110ad6b1cd144ba2a53 [2025-02-06 04:40:31,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:40:31,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:40:31,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:31,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:40:31,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:40:31,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d647a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31, skipping insertion in model container [2025-02-06 04:40:31,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:40:31,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-02-06 04:40:31,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:31,345 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:40:31,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-02-06 04:40:31,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:40:31,378 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:40:31,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31 WrapperNode [2025-02-06 04:40:31,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:40:31,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:31,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:40:31,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:40:31,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,408 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 175 [2025-02-06 04:40:31,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:40:31,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:40:31,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:40:31,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:40:31,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,429 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 04:40:31,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:40:31,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:40:31,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:40:31,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:40:31,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (1/1) ... [2025-02-06 04:40:31,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:40:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:31,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:40:31,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:40:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:40:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:40:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:40:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:40:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:40:31,489 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:40:31,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:40:31,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:40:31,827 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:40:31,828 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:40:31,995 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:40:31,996 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:40:31,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:31 BoogieIcfgContainer [2025-02-06 04:40:31,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:40:31,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:40:31,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:40:32,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:40:32,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:40:31" (1/3) ... [2025-02-06 04:40:32,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bced180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:32, skipping insertion in model container [2025-02-06 04:40:32,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:40:31" (2/3) ... [2025-02-06 04:40:32,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bced180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:40:32, skipping insertion in model container [2025-02-06 04:40:32,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:40:31" (3/3) ... [2025-02-06 04:40:32,004 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-02-06 04:40:32,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:40:32,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-dec-subseq.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 04:40:32,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:40:32,070 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:40:32,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2025-02-06 04:40:32,142 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-02-06 04:40:32,144 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:40:32,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-02-06 04:40:32,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2025-02-06 04:40:32,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2025-02-06 04:40:32,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:40:32,169 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;@45355388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:40:32,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:40:32,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:40:32,181 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2025-02-06 04:40:32,181 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:40:32,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:32,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:32,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1177749298, now seen corresponding path program 1 times [2025-02-06 04:40:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757026999] [2025-02-06 04:40:32,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:40:32,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:40:32,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:32,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:32,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:32,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757026999] [2025-02-06 04:40:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757026999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213255977] [2025-02-06 04:40:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:32,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:32,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:40:32,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-06 04:40:32,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:32,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:40:32,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:32,637 INFO L124 PetriNetUnfolderBase]: 219/367 cut-off events. [2025-02-06 04:40:32,637 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 04:40:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 367 events. 219/367 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1387 event pairs, 64 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 713. Up to 211 conditions per place. [2025-02-06 04:40:32,644 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-02-06 04:40:32,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 175 flow [2025-02-06 04:40:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:40:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:40:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-06 04:40:32,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2025-02-06 04:40:32,655 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 4 states and 63 transitions. [2025-02-06 04:40:32,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 175 flow [2025-02-06 04:40:32,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 165 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:40:32,662 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 74 flow [2025-02-06 04:40:32,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2025-02-06 04:40:32,665 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-02-06 04:40:32,665 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 74 flow [2025-02-06 04:40:32,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-06 04:40:32,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:32,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:32,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:40:32,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:32,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash -135046107, now seen corresponding path program 1 times [2025-02-06 04:40:32,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:32,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938424790] [2025-02-06 04:40:32,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:32,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:40:32,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:40:32,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:32,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:32,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938424790] [2025-02-06 04:40:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938424790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208667199] [2025-02-06 04:40:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:32,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:32,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:32,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:40:32,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-06 04:40:32,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:32,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:40:32,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:32,896 INFO L124 PetriNetUnfolderBase]: 219/368 cut-off events. [2025-02-06 04:40:32,896 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:40:32,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 368 events. 219/368 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1389 event pairs, 158 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 303. Up to 362 conditions per place. [2025-02-06 04:40:32,901 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-02-06 04:40:32,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 128 flow [2025-02-06 04:40:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 04:40:32,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-02-06 04:40:32,904 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 74 flow. Second operand 3 states and 44 transitions. [2025-02-06 04:40:32,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 128 flow [2025-02-06 04:40:32,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:40:32,905 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 82 flow [2025-02-06 04:40:32,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2025-02-06 04:40:32,905 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-02-06 04:40:32,905 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 82 flow [2025-02-06 04:40:32,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-06 04:40:32,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:32,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:32,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:40:32,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -701839070, now seen corresponding path program 1 times [2025-02-06 04:40:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898836192] [2025-02-06 04:40:32,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:32,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:40:32,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:40:32,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:32,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898836192] [2025-02-06 04:40:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898836192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789389716] [2025-02-06 04:40:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:33,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:33,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:33,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:40:33,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 82 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-02-06 04:40:33,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:33,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:40:33,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:33,162 INFO L124 PetriNetUnfolderBase]: 333/575 cut-off events. [2025-02-06 04:40:33,163 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-06 04:40:33,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 575 events. 333/575 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2330 event pairs, 126 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 1182. Up to 277 conditions per place. [2025-02-06 04:40:33,166 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-02-06 04:40:33,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 198 flow [2025-02-06 04:40:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-06 04:40:33,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-02-06 04:40:33,167 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 82 flow. Second operand 3 states and 56 transitions. [2025-02-06 04:40:33,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 198 flow [2025-02-06 04:40:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:33,168 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 90 flow [2025-02-06 04:40:33,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-02-06 04:40:33,169 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-02-06 04:40:33,169 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 90 flow [2025-02-06 04:40:33,169 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-02-06 04:40:33,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:33,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:40:33,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:33,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1157323469, now seen corresponding path program 1 times [2025-02-06 04:40:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657388475] [2025-02-06 04:40:33,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:33,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:40:33,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:40:33,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657388475] [2025-02-06 04:40:33,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657388475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:33,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:40:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961432809] [2025-02-06 04:40:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:33,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:40:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:33,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:40:33,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:40:33,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:40:33,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-02-06 04:40:33,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:33,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:40:33,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:33,396 INFO L124 PetriNetUnfolderBase]: 336/594 cut-off events. [2025-02-06 04:40:33,396 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 04:40:33,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 594 events. 336/594 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2378 event pairs, 141 based on Foata normal form. 15/571 useless extension candidates. Maximal degree in co-relation 1301. Up to 406 conditions per place. [2025-02-06 04:40:33,400 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 35 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2025-02-06 04:40:33,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 209 flow [2025-02-06 04:40:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:40:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:40:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-06 04:40:33,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-02-06 04:40:33,402 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 90 flow. Second operand 3 states and 56 transitions. [2025-02-06 04:40:33,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 209 flow [2025-02-06 04:40:33,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:33,403 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 100 flow [2025-02-06 04:40:33,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2025-02-06 04:40:33,403 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-02-06 04:40:33,404 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 100 flow [2025-02-06 04:40:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-02-06 04:40:33,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:33,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:40:33,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:33,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -258908880, now seen corresponding path program 1 times [2025-02-06 04:40:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235400077] [2025-02-06 04:40:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:33,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:40:33,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:40:33,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:33,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:40:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235400077] [2025-02-06 04:40:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235400077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:40:33,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:40:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:40:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785404720] [2025-02-06 04:40:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:40:33,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:40:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:33,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:40:33,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:40:33,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:40:33,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02-06 04:40:33,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:33,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:40:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:33,694 INFO L124 PetriNetUnfolderBase]: 421/764 cut-off events. [2025-02-06 04:40:33,694 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-02-06 04:40:33,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 764 events. 421/764 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3317 event pairs, 349 based on Foata normal form. 16/726 useless extension candidates. Maximal degree in co-relation 1368. Up to 572 conditions per place. [2025-02-06 04:40:33,699 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-02-06 04:40:33,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 250 flow [2025-02-06 04:40:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:40:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:40:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-02-06 04:40:33,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2025-02-06 04:40:33,700 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 100 flow. Second operand 4 states and 66 transitions. [2025-02-06 04:40:33,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 250 flow [2025-02-06 04:40:33,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:40:33,701 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 112 flow [2025-02-06 04:40:33,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-02-06 04:40:33,702 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-02-06 04:40:33,702 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 112 flow [2025-02-06 04:40:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02-06 04:40:33,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:40:33,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:40:33,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:40:33,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:40:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:40:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 136020425, now seen corresponding path program 1 times [2025-02-06 04:40:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:40:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501101114] [2025-02-06 04:40:33,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:40:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:40:33,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:40:33,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:33,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:40:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501101114] [2025-02-06 04:40:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501101114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:40:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319116979] [2025-02-06 04:40:35,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:40:35,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:40:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:40:35,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:40:35,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:40:35,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:40:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:40:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:40:35,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:40:35,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 04:40:35,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:40:35,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 04:40:35,746 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-02-06 04:40:35,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:40:35,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-06 04:40:35,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-06 04:40:36,246 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-06 04:40:36,247 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 34 treesize of output 10 [2025-02-06 04:40:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:36,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:40:37,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:37,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2025-02-06 04:40:37,342 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2025-02-06 04:40:37,342 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 208 treesize of output 181 [2025-02-06 04:40:37,359 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:40:37,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:37,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 120 [2025-02-06 04:40:37,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:37,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-02-06 04:40:37,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:37,507 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 102 treesize of output 90 [2025-02-06 04:40:37,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:40:37,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 63 [2025-02-06 04:40:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:40:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319116979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:40:37,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:40:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-06 04:40:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754782491] [2025-02-06 04:40:37,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:40:37,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 04:40:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:40:37,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 04:40:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1051, Unknown=3, NotChecked=0, Total=1332 [2025-02-06 04:40:37,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2025-02-06 04:40:37,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 112 flow. Second operand has 37 states, 37 states have (on average 6.918918918918919) internal successors, (256), 37 states have internal predecessors, (256), 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-02-06 04:40:37,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:40:37,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2025-02-06 04:40:37,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:40:41,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:45,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:49,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:40:54,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 04:41:05,356 INFO L124 PetriNetUnfolderBase]: 1393/2336 cut-off events. [2025-02-06 04:41:05,357 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2025-02-06 04:41:05,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 2336 events. 1393/2336 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12145 event pairs, 201 based on Foata normal form. 2/2047 useless extension candidates. Maximal degree in co-relation 5483. Up to 387 conditions per place. [2025-02-06 04:41:05,365 INFO L140 encePairwiseOnDemand]: 11/31 looper letters, 227 selfloop transitions, 151 changer transitions 80/461 dead transitions. [2025-02-06 04:41:05,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 461 transitions, 2211 flow [2025-02-06 04:41:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-02-06 04:41:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-02-06 04:41:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 826 transitions. [2025-02-06 04:41:05,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3650022094564737 [2025-02-06 04:41:05,373 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 112 flow. Second operand 73 states and 826 transitions. [2025-02-06 04:41:05,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 461 transitions, 2211 flow [2025-02-06 04:41:05,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 461 transitions, 2187 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-02-06 04:41:05,379 INFO L231 Difference]: Finished difference. Result has 152 places, 197 transitions, 1314 flow [2025-02-06 04:41:05,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=1314, PETRI_PLACES=152, PETRI_TRANSITIONS=197} [2025-02-06 04:41:05,380 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2025-02-06 04:41:05,380 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 197 transitions, 1314 flow [2025-02-06 04:41:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.918918918918919) internal successors, (256), 37 states have internal predecessors, (256), 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-02-06 04:41:05,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:05,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:05,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:41:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:05,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:41:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 428822336, now seen corresponding path program 2 times [2025-02-06 04:41:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697852050] [2025-02-06 04:41:05,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:41:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:05,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-06 04:41:05,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-02-06 04:41:05,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:41:05,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:05,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697852050] [2025-02-06 04:41:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697852050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:05,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:05,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:41:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431473204] [2025-02-06 04:41:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:05,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:41:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:05,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:41:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:41:05,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:41:05,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 197 transitions, 1314 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-02-06 04:41:05,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:05,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:41:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:06,517 INFO L124 PetriNetUnfolderBase]: 1121/1963 cut-off events. [2025-02-06 04:41:06,518 INFO L125 PetriNetUnfolderBase]: For 17057/17102 co-relation queries the response was YES. [2025-02-06 04:41:06,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10748 conditions, 1963 events. 1121/1963 cut-off events. For 17057/17102 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10301 event pairs, 72 based on Foata normal form. 8/1850 useless extension candidates. Maximal degree in co-relation 10690. Up to 627 conditions per place. [2025-02-06 04:41:06,539 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 182 selfloop transitions, 61 changer transitions 5/258 dead transitions. [2025-02-06 04:41:06,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 258 transitions, 2470 flow [2025-02-06 04:41:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:41:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:41:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2025-02-06 04:41:06,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-02-06 04:41:06,541 INFO L175 Difference]: Start difference. First operand has 152 places, 197 transitions, 1314 flow. Second operand 9 states and 132 transitions. [2025-02-06 04:41:06,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 258 transitions, 2470 flow [2025-02-06 04:41:06,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 258 transitions, 2274 flow, removed 97 selfloop flow, removed 7 redundant places. [2025-02-06 04:41:06,596 INFO L231 Difference]: Finished difference. Result has 149 places, 202 transitions, 1465 flow [2025-02-06 04:41:06,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1465, PETRI_PLACES=149, PETRI_TRANSITIONS=202} [2025-02-06 04:41:06,598 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2025-02-06 04:41:06,599 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 202 transitions, 1465 flow [2025-02-06 04:41:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-02-06 04:41:06,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:06,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:06,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:41:06,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:41:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash 677688180, now seen corresponding path program 3 times [2025-02-06 04:41:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:06,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807008094] [2025-02-06 04:41:06,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:06,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:06,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 04:41:06,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:41:06,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 04:41:06,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807008094] [2025-02-06 04:41:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807008094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018731352] [2025-02-06 04:41:06,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:41:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:06,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:41:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:41:06,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-02-06 04:41:06,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:41:06,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 04:41:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:06,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:41:06,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:07,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:41:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018731352] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:07,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 04:41:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195065017] [2025-02-06 04:41:07,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:07,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:41:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:07,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:41:07,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:41:07,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:41:07,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 202 transitions, 1465 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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-02-06 04:41:07,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:07,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:41:07,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:07,642 INFO L124 PetriNetUnfolderBase]: 1061/1910 cut-off events. [2025-02-06 04:41:07,643 INFO L125 PetriNetUnfolderBase]: For 17312/17368 co-relation queries the response was YES. [2025-02-06 04:41:07,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10449 conditions, 1910 events. 1061/1910 cut-off events. For 17312/17368 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10247 event pairs, 211 based on Foata normal form. 70/1876 useless extension candidates. Maximal degree in co-relation 8937. Up to 583 conditions per place. [2025-02-06 04:41:07,653 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 4 changer transitions 170/218 dead transitions. [2025-02-06 04:41:07,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 218 transitions, 2094 flow [2025-02-06 04:41:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:41:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 04:41:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2025-02-06 04:41:07,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46953405017921146 [2025-02-06 04:41:07,654 INFO L175 Difference]: Start difference. First operand has 149 places, 202 transitions, 1465 flow. Second operand 9 states and 131 transitions. [2025-02-06 04:41:07,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 218 transitions, 2094 flow [2025-02-06 04:41:07,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 218 transitions, 1918 flow, removed 66 selfloop flow, removed 10 redundant places. [2025-02-06 04:41:07,687 INFO L231 Difference]: Finished difference. Result has 141 places, 42 transitions, 308 flow [2025-02-06 04:41:07,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=141, PETRI_TRANSITIONS=42} [2025-02-06 04:41:07,687 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2025-02-06 04:41:07,688 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 42 transitions, 308 flow [2025-02-06 04:41:07,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 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-02-06 04:41:07,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:07,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:07,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:07,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:07,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:41:07,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1767108229, now seen corresponding path program 4 times [2025-02-06 04:41:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941589198] [2025-02-06 04:41:07,889 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:41:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:07,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-06 04:41:07,901 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 04:41:07,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:41:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:07,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941589198] [2025-02-06 04:41:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941589198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:41:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:41:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:41:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413526648] [2025-02-06 04:41:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:41:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:41:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:07,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:41:07,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:41:07,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:41:07,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 42 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:07,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:07,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:41:07,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:08,214 INFO L124 PetriNetUnfolderBase]: 847/1488 cut-off events. [2025-02-06 04:41:08,215 INFO L125 PetriNetUnfolderBase]: For 9513/9513 co-relation queries the response was YES. [2025-02-06 04:41:08,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7394 conditions, 1488 events. 847/1488 cut-off events. For 9513/9513 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6363 event pairs, 316 based on Foata normal form. 30/1428 useless extension candidates. Maximal degree in co-relation 7344. Up to 500 conditions per place. [2025-02-06 04:41:08,226 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 77 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2025-02-06 04:41:08,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 807 flow [2025-02-06 04:41:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:41:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:41:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-02-06 04:41:08,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2025-02-06 04:41:08,227 INFO L175 Difference]: Start difference. First operand has 141 places, 42 transitions, 308 flow. Second operand 4 states and 84 transitions. [2025-02-06 04:41:08,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 807 flow [2025-02-06 04:41:08,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 575 flow, removed 111 selfloop flow, removed 35 redundant places. [2025-02-06 04:41:08,238 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 277 flow [2025-02-06 04:41:08,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2025-02-06 04:41:08,239 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2025-02-06 04:41:08,239 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 277 flow [2025-02-06 04:41:08,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:41:08,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:08,239 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:08,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:41:08,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:41:08,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash -896063105, now seen corresponding path program 5 times [2025-02-06 04:41:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051375557] [2025-02-06 04:41:08,240 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:08,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-02-06 04:41:08,260 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:41:08,260 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:41:08,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051375557] [2025-02-06 04:41:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051375557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125345561] [2025-02-06 04:41:08,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:41:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:08,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:41:08,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:41:08,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-02-06 04:41:08,456 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 04:41:08,456 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 04:41:08,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:08,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:41:08,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:08,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125345561] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:41:08,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:41:08,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:41:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964831008] [2025-02-06 04:41:08,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:41:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:41:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:41:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:41:08,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:41:08,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-02-06 04:41:08,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 277 flow. Second operand has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 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-02-06 04:41:08,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:41:08,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-02-06 04:41:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:41:08,938 INFO L124 PetriNetUnfolderBase]: 955/1718 cut-off events. [2025-02-06 04:41:08,939 INFO L125 PetriNetUnfolderBase]: For 3143/3149 co-relation queries the response was YES. [2025-02-06 04:41:08,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 1718 events. 955/1718 cut-off events. For 3143/3149 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7950 event pairs, 519 based on Foata normal form. 26/1654 useless extension candidates. Maximal degree in co-relation 5886. Up to 1119 conditions per place. [2025-02-06 04:41:08,946 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 53 selfloop transitions, 5 changer transitions 30/92 dead transitions. [2025-02-06 04:41:08,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 715 flow [2025-02-06 04:41:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:41:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:41:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-02-06 04:41:08,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2025-02-06 04:41:08,947 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 277 flow. Second operand 8 states and 110 transitions. [2025-02-06 04:41:08,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 715 flow [2025-02-06 04:41:08,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 697 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 04:41:08,951 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 295 flow [2025-02-06 04:41:08,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-02-06 04:41:08,952 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-02-06 04:41:08,952 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 295 flow [2025-02-06 04:41:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 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-02-06 04:41:08,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:41:08,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:41:08,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:41:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:09,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:41:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:41:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1357422716, now seen corresponding path program 6 times [2025-02-06 04:41:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:41:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266832204] [2025-02-06 04:41:09,155 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:41:09,164 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:41:09,203 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:41:09,203 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:41:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:41:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:41:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266832204] [2025-02-06 04:41:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266832204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:41:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980801577] [2025-02-06 04:41:10,420 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:41:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:41:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:41:10,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:41:10,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:41:10,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-02-06 04:41:10,486 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:41:10,486 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-06 04:41:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:41:10,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 04:41:10,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:41:11,573 INFO L349 Elim1Store]: treesize reduction 34, result has 57.0 percent of original size [2025-02-06 04:41:11,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2025-02-06 04:41:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:41:11,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:41:15,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:41:15,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1432