./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:07:27,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:07:27,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:07:27,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:07:27,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:07:27,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:07:27,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:07:27,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:07:27,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:07:27,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:07:27,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:07:27,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:07:27,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:07:27,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:07:27,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:07:27,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:07:27,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:07:27,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:27,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:07:27,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:07:27,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:07:27,478 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2025-03-14 01:07:27,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:07:27,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:07:27,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:07:27,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:07:27,717 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:07:27,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-14 01:07:28,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a109cab/3585cd2801d04b97838eb9fb7a42ac58/FLAG1a9e17c38 [2025-03-14 01:07:29,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:07:29,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c [2025-03-14 01:07:29,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a109cab/3585cd2801d04b97838eb9fb7a42ac58/FLAG1a9e17c38 [2025-03-14 01:07:29,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a109cab/3585cd2801d04b97838eb9fb7a42ac58 [2025-03-14 01:07:29,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:07:29,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:07:29,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:29,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:07:29,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:07:29,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29, skipping insertion in model container [2025-03-14 01:07:29,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:07:29,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-03-14 01:07:29,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:29,561 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:07:29,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2025-03-14 01:07:29,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:29,586 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:07:29,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29 WrapperNode [2025-03-14 01:07:29,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:29,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:29,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:07:29,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:07:29,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,608 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 175 [2025-03-14 01:07:29,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:29,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:07:29,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:07:29,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:07:29,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,631 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-03-14 01:07:29,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:07:29,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:07:29,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:07:29,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:07:29,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (1/1) ... [2025-03-14 01:07:29,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:29,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:29,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:07:29,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:07:29,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:07:29,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:07:29,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:07:29,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:07:29,689 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:07:29,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:07:29,766 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:07:30,002 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:07:30,002 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:07:30,002 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:07:30,240 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:07:30,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:30 BoogieIcfgContainer [2025-03-14 01:07:30,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:07:30,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:07:30,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:07:30,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:07:30,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:07:29" (1/3) ... [2025-03-14 01:07:30,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8dbfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:30, skipping insertion in model container [2025-03-14 01:07:30,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:29" (2/3) ... [2025-03-14 01:07:30,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8dbfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:30, skipping insertion in model container [2025-03-14 01:07:30,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:30" (3/3) ... [2025-03-14 01:07:30,250 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2025-03-14 01:07:30,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:07:30,263 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-03-14 01:07:30,263 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:07:30,300 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:07:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2025-03-14 01:07:30,353 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-14 01:07:30,354 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:07:30,358 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 36 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-03-14 01:07:30,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2025-03-14 01:07:30,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2025-03-14 01:07:30,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:07:30,378 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;@49cc2b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:07:30,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:07:30,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:07:30,385 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2025-03-14 01:07:30,386 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:07:30,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:30,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:30,387 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-03-14 01:07:30,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1374407663, now seen corresponding path program 1 times [2025-03-14 01:07:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392517815] [2025-03-14 01:07:30,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:30,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:07:30,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:07:30,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:30,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392517815] [2025-03-14 01:07:30,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392517815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:30,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:07:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359145414] [2025-03-14 01:07:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:07:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:30,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:07:30,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:07:30,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:30,726 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-03-14 01:07:30,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:30,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:30,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:30,864 INFO L124 PetriNetUnfolderBase]: 219/367 cut-off events. [2025-03-14 01:07:30,865 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:07:30,866 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 1403 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-03-14 01:07:30,871 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-14 01:07:30,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 175 flow [2025-03-14 01:07:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:07:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:07:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-14 01:07:30,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2025-03-14 01:07:30,881 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 4 states and 63 transitions. [2025-03-14 01:07:30,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 175 flow [2025-03-14 01:07:30,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 165 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:07:30,888 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 74 flow [2025-03-14 01:07:30,890 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-03-14 01:07:30,893 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-03-14 01:07:30,894 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 74 flow [2025-03-14 01:07:30,894 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-03-14 01:07:30,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:30,894 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-03-14 01:07:30,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:07:30,895 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-03-14 01:07:30,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash 371436039, now seen corresponding path program 1 times [2025-03-14 01:07:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:30,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887649859] [2025-03-14 01:07:30,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:07:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:07:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887649859] [2025-03-14 01:07:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887649859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:31,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:31,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:07:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270051274] [2025-03-14 01:07:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:31,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:31,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:31,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:31,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:31,066 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-03-14 01:07:31,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:31,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:31,163 INFO L124 PetriNetUnfolderBase]: 219/368 cut-off events. [2025-03-14 01:07:31,164 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:07:31,165 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-03-14 01:07:31,168 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-03-14 01:07:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 128 flow [2025-03-14 01:07:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-14 01:07:31,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-14 01:07:31,171 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 74 flow. Second operand 3 states and 44 transitions. [2025-03-14 01:07:31,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 128 flow [2025-03-14 01:07:31,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:31,173 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 82 flow [2025-03-14 01:07:31,173 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-03-14 01:07:31,173 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-03-14 01:07:31,174 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 82 flow [2025-03-14 01:07:31,174 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-03-14 01:07:31,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:31,174 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-03-14 01:07:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:07:31,175 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-03-14 01:07:31,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -167651294, now seen corresponding path program 1 times [2025-03-14 01:07:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511098366] [2025-03-14 01:07:31,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 01:07:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 01:07:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:31,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:31,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511098366] [2025-03-14 01:07:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511098366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:31,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:31,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874085884] [2025-03-14 01:07:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:31,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:31,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:31,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:31,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:31,294 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-03-14 01:07:31,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:31,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:31,402 INFO L124 PetriNetUnfolderBase]: 333/575 cut-off events. [2025-03-14 01:07:31,403 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:07:31,406 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-03-14 01:07:31,408 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-03-14 01:07:31,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 198 flow [2025-03-14 01:07:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-14 01:07:31,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-14 01:07:31,411 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 82 flow. Second operand 3 states and 56 transitions. [2025-03-14 01:07:31,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 198 flow [2025-03-14 01:07:31,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 194 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:31,412 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 90 flow [2025-03-14 01:07:31,412 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-03-14 01:07:31,413 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-14 01:07:31,413 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 90 flow [2025-03-14 01:07:31,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:31,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:31,413 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-03-14 01:07:31,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:07:31,413 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-03-14 01:07:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1582559219, now seen corresponding path program 1 times [2025-03-14 01:07:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:31,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582318233] [2025-03-14 01:07:31,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:31,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:07:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:07:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582318233] [2025-03-14 01:07:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582318233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947973130] [2025-03-14 01:07:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:31,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:31,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:31,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:31,501 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-03-14 01:07:31,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:31,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:31,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:31,585 INFO L124 PetriNetUnfolderBase]: 336/594 cut-off events. [2025-03-14 01:07:31,585 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-14 01:07:31,586 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-03-14 01:07:31,588 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 35 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2025-03-14 01:07:31,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 209 flow [2025-03-14 01:07:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-14 01:07:31,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-14 01:07:31,590 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 90 flow. Second operand 3 states and 56 transitions. [2025-03-14 01:07:31,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 209 flow [2025-03-14 01:07:31,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:31,593 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 100 flow [2025-03-14 01:07:31,593 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-03-14 01:07:31,594 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-03-14 01:07:31,594 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 100 flow [2025-03-14 01:07:31,594 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-03-14 01:07:31,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:31,594 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-03-14 01:07:31,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:07:31,595 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-03-14 01:07:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -46598160, now seen corresponding path program 1 times [2025-03-14 01:07:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189656593] [2025-03-14 01:07:31,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:31,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:07:31,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189656593] [2025-03-14 01:07:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189656593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:07:31,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613563066] [2025-03-14 01:07:31,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:31,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:07:31,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:31,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:07:31,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:07:31,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:31,727 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-03-14 01:07:31,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:31,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:31,852 INFO L124 PetriNetUnfolderBase]: 421/764 cut-off events. [2025-03-14 01:07:31,852 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-14 01:07:31,853 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-03-14 01:07:31,858 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-03-14 01:07:31,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 250 flow [2025-03-14 01:07:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:07:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:07:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-14 01:07:31,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2025-03-14 01:07:31,859 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 100 flow. Second operand 4 states and 66 transitions. [2025-03-14 01:07:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 250 flow [2025-03-14 01:07:31,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:31,860 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 112 flow [2025-03-14 01:07:31,860 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-03-14 01:07:31,860 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-03-14 01:07:31,860 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 112 flow [2025-03-14 01:07:31,860 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-03-14 01:07:31,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:31,861 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-03-14 01:07:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:07:31,861 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-03-14 01:07:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1262609813, now seen corresponding path program 1 times [2025-03-14 01:07:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526176882] [2025-03-14 01:07:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:31,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:07:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:07:31,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:32,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526176882] [2025-03-14 01:07:32,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526176882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:32,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97533927] [2025-03-14 01:07:32,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:32,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:32,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:32,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:07:32,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:07:32,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:07:32,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:32,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:32,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 01:07:32,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:32,956 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-03-14 01:07:32,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-14 01:07:33,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:07:33,047 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-03-14 01:07:33,090 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 15 treesize of output 1 [2025-03-14 01:07:33,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 01:07:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:33,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:38,604 INFO L349 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2025-03-14 01:07:38,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 152 [2025-03-14 01:07:38,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:38,623 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 148 treesize of output 144 [2025-03-14 01:07:38,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-03-14 01:07:38,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-03-14 01:07:38,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2025-03-14 01:07:38,854 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-14 01:07:38,854 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 36 treesize of output 18 [2025-03-14 01:07:38,918 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-03-14 01:07:38,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 320 treesize of output 302 [2025-03-14 01:07:38,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:38,941 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 209 treesize of output 199 [2025-03-14 01:07:39,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-03-14 01:07:39,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:39,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 140 treesize of output 170 [2025-03-14 01:07:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:07:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97533927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:40,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:40,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2025-03-14 01:07:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409306501] [2025-03-14 01:07:40,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:40,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-14 01:07:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:40,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-14 01:07:40,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=805, Unknown=1, NotChecked=0, Total=992 [2025-03-14 01:07:40,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2025-03-14 01:07:40,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 112 flow. Second operand has 32 states, 32 states have (on average 7.21875) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:40,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:40,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2025-03-14 01:07:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:44,427 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-03-14 01:07:50,116 INFO L124 PetriNetUnfolderBase]: 1293/2185 cut-off events. [2025-03-14 01:07:50,116 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2025-03-14 01:07:50,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 2185 events. 1293/2185 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11025 event pairs, 226 based on Foata normal form. 5/1916 useless extension candidates. Maximal degree in co-relation 5139. Up to 403 conditions per place. [2025-03-14 01:07:50,125 INFO L140 encePairwiseOnDemand]: 12/31 looper letters, 209 selfloop transitions, 75 changer transitions 90/377 dead transitions. [2025-03-14 01:07:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 377 transitions, 1816 flow [2025-03-14 01:07:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-14 01:07:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-14 01:07:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 639 transitions. [2025-03-14 01:07:50,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38892270237370663 [2025-03-14 01:07:50,133 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 112 flow. Second operand 53 states and 639 transitions. [2025-03-14 01:07:50,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 377 transitions, 1816 flow [2025-03-14 01:07:50,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 377 transitions, 1800 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:50,138 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 741 flow [2025-03-14 01:07:50,138 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=741, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-14 01:07:50,138 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-03-14 01:07:50,138 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 741 flow [2025-03-14 01:07:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.21875) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:50,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:50,139 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-03-14 01:07:50,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:07:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-14 01:07:50,342 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-03-14 01:07:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash 641133056, now seen corresponding path program 2 times [2025-03-14 01:07:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694038790] [2025-03-14 01:07:50,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:07:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:50,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:07:50,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-03-14 01:07:50,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:07:50,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:07:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:50,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694038790] [2025-03-14 01:07:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694038790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:07:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99815527] [2025-03-14 01:07:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:07:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:50,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:07:50,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:07:50,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:50,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 741 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-03-14 01:07:50,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:50,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:51,014 INFO L124 PetriNetUnfolderBase]: 925/1663 cut-off events. [2025-03-14 01:07:51,014 INFO L125 PetriNetUnfolderBase]: For 7178/7178 co-relation queries the response was YES. [2025-03-14 01:07:51,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 1663 events. 925/1663 cut-off events. For 7178/7178 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8424 event pairs, 70 based on Foata normal form. 1/1660 useless extension candidates. Maximal degree in co-relation 7302. Up to 556 conditions per place. [2025-03-14 01:07:51,030 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 122 selfloop transitions, 38 changer transitions 6/172 dead transitions. [2025-03-14 01:07:51,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 172 transitions, 1507 flow [2025-03-14 01:07:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:07:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:07:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2025-03-14 01:07:51,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-14 01:07:51,035 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 741 flow. Second operand 9 states and 132 transitions. [2025-03-14 01:07:51,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 172 transitions, 1507 flow [2025-03-14 01:07:51,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1333 flow, removed 86 selfloop flow, removed 10 redundant places. [2025-03-14 01:07:51,071 INFO L231 Difference]: Finished difference. Result has 108 places, 117 transitions, 804 flow [2025-03-14 01:07:51,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=804, PETRI_PLACES=108, PETRI_TRANSITIONS=117} [2025-03-14 01:07:51,073 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2025-03-14 01:07:51,074 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 117 transitions, 804 flow [2025-03-14 01:07:51,074 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-03-14 01:07:51,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:51,075 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-03-14 01:07:51,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:07:51,075 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-03-14 01:07:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1193776216, now seen corresponding path program 3 times [2025-03-14 01:07:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116024796] [2025-03-14 01:07:51,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:07:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:51,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-14 01:07:51,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:07:51,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:07:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:51,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116024796] [2025-03-14 01:07:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116024796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283274672] [2025-03-14 01:07:51,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:07:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:51,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:51,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:07:51,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-14 01:07:51,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:07:51,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 01:07:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:51,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:07:51,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:51,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:07:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283274672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:51,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 10 [2025-03-14 01:07:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410361898] [2025-03-14 01:07:51,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:07:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:07:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:07:51,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:51,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 117 transitions, 804 flow. Second operand has 11 states, 11 states have (on average 12.181818181818182) internal successors, (134), 11 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:51,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:51,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:51,955 INFO L124 PetriNetUnfolderBase]: 1417/2624 cut-off events. [2025-03-14 01:07:51,956 INFO L125 PetriNetUnfolderBase]: For 10439/10447 co-relation queries the response was YES. [2025-03-14 01:07:51,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11010 conditions, 2624 events. 1417/2624 cut-off events. For 10439/10447 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14359 event pairs, 333 based on Foata normal form. 131/2752 useless extension candidates. Maximal degree in co-relation 8671. Up to 462 conditions per place. [2025-03-14 01:07:51,972 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 72 selfloop transitions, 13 changer transitions 127/216 dead transitions. [2025-03-14 01:07:51,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 216 transitions, 1851 flow [2025-03-14 01:07:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:07:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:07:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2025-03-14 01:07:51,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5601173020527859 [2025-03-14 01:07:51,974 INFO L175 Difference]: Start difference. First operand has 108 places, 117 transitions, 804 flow. Second operand 11 states and 191 transitions. [2025-03-14 01:07:51,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 216 transitions, 1851 flow [2025-03-14 01:07:51,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 216 transitions, 1782 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-03-14 01:07:51,996 INFO L231 Difference]: Finished difference. Result has 113 places, 52 transitions, 365 flow [2025-03-14 01:07:51,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=113, PETRI_TRANSITIONS=52} [2025-03-14 01:07:51,997 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2025-03-14 01:07:51,997 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 52 transitions, 365 flow [2025-03-14 01:07:51,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.181818181818182) internal successors, (134), 11 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:51,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:51,997 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-03-14 01:07:52,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:07:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-14 01:07:52,198 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-03-14 01:07:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1654450178, now seen corresponding path program 4 times [2025-03-14 01:07:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346868080] [2025-03-14 01:07:52,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:52,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:07:52,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:07:52,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:07:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346868080] [2025-03-14 01:07:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346868080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073712775] [2025-03-14 01:07:52,322 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:07:52,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:52,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:52,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:07:52,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:07:52,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:07:52,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:07:52,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:52,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:07:52,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:07:52,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:07:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073712775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:52,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:52,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 01:07:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894705033] [2025-03-14 01:07:52,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:52,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:07:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:52,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:07:52,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:07:52,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2025-03-14 01:07:52,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 52 transitions, 365 flow. Second operand has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:52,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:52,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2025-03-14 01:07:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:52,917 INFO L124 PetriNetUnfolderBase]: 856/1571 cut-off events. [2025-03-14 01:07:52,917 INFO L125 PetriNetUnfolderBase]: For 6147/6151 co-relation queries the response was YES. [2025-03-14 01:07:52,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 1571 events. 856/1571 cut-off events. For 6147/6151 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7111 event pairs, 512 based on Foata normal form. 20/1587 useless extension candidates. Maximal degree in co-relation 6556. Up to 1039 conditions per place. [2025-03-14 01:07:52,928 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 58 selfloop transitions, 5 changer transitions 29/96 dead transitions. [2025-03-14 01:07:52,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 846 flow [2025-03-14 01:07:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:07:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:07:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-14 01:07:52,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2025-03-14 01:07:52,930 INFO L175 Difference]: Start difference. First operand has 113 places, 52 transitions, 365 flow. Second operand 8 states and 110 transitions. [2025-03-14 01:07:52,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 96 transitions, 846 flow [2025-03-14 01:07:52,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 736 flow, removed 49 selfloop flow, removed 21 redundant places. [2025-03-14 01:07:52,942 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 333 flow [2025-03-14 01:07:52,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=333, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-03-14 01:07:52,943 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-03-14 01:07:52,944 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 333 flow [2025-03-14 01:07:52,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:52,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:52,944 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-03-14 01:07:52,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:07:53,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:53,145 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-03-14 01:07:53,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash -772124989, now seen corresponding path program 5 times [2025-03-14 01:07:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779064016] [2025-03-14 01:07:53,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:07:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:53,156 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:07:53,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:07:53,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:07:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779064016] [2025-03-14 01:07:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779064016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394196544] [2025-03-14 01:07:54,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:07:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:54,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:54,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:07:54,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:07:54,385 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:07:54,408 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:07:54,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:07:54,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:54,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-14 01:07:54,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:55,386 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2025-03-14 01:07:55,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 24 [2025-03-14 01:07:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:07:55,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:58,120 INFO L349 Elim1Store]: treesize reduction 164, result has 86.0 percent of original size [2025-03-14 01:07:58,121 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 1066